https://github.com/solygambas/coding-interview-algorithms-data-structures

Some algorithms and data structures to prepare for a JavaScript coding interview.
https://github.com/solygambas/coding-interview-algorithms-data-structures

algorithms algorithms-and-data-structures coding-challenge coding-interviews data-structures javascript

Last synced: 8 months ago
JSON representation

Some algorithms and data structures to prepare for a JavaScript coding interview.

• Host: GitHub
• URL: https://github.com/solygambas/coding-interview-algorithms-data-structures
• Owner: solygambas
• License: gpl-3.0
• Created: 2022-12-17T17:38:55.000Z (almost 3 years ago)
• Default Branch: main
• Last Pushed: 2023-01-14T19:38:15.000Z (almost 3 years ago)
• Last Synced: 2025-02-13T23:34:13.694Z (9 months ago)
• Topics: algorithms, algorithms-and-data-structures, coding-challenge, coding-interviews, data-structures, javascript
• Language: JavaScript
• Homepage:
• Size: 85.9 KB
• Stars: 1
• Watchers: 3
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

          
# Coding interview: Algorithms & Data Structures

Some algorithms and data structures to prepare for a JavaScript coding interview.

|  #  | Coding Exercise                               |

| :-: | --------------------------------------------- |

| 01  | [String Reversal](01-reversestring)           |

| 02  | [Palindromes](02-palindrome)                  |

| 03  | [Integer Reversal](03-reverseint)             |

| 04  | [Max Chars](04-maxchar)                       |

| 05  | [FizzBuzz](05-fizzbuzz)                       |

| 06  | [Array Chunk](06-chunk)                       |

| 07  | [Anagrams](07-anagrams)                       |

| 08  | [Capitalization](08-capitalize)               |

| 09  | [Steps](09-steps)                             |

| 10  | [Pyramids](10-pyramid)                        |

| 11  | [Finding Vowels](11-vowels)                   |

| 12  | [Matrix Spiral](12-matrix)                    |

| 13  | [Fibonacci Series](13-fib)                    |

| 14  | [Queue](14-queue)                             |

| 15  | [Weave](15-weave)                             |

| 16  | [Implementing Stacks](16-stack)               |

| 17  | [Queue From Stacks](17-qfroms)                |

| 18  | [Linked Lists](18-linkedlist)                 |

| 19  | [Midpoint](19-midpoint)                       |

| 20  | [Circular](20-circular)                       |

| 21  | [From Last](21-fromlast)                      |

| 22  | [Building a Tree](22-tree)                    |

| 23  | [Level Width](23-levelwidth)                  |

| 24  | [Binary Search Tree](24-bst)                  |

| 25  | [Validating Binary Search Trees](25-validate) |

| 26  | [Events](26-events)                           |

| 27  | [Sorting](27-sorting)                         |

Based on [The Coding Inteview Bootcamp: Algorithms + Data Structures](https://www.udemy.com/course/coding-interview-bootcamp-algorithms-and-data-structure/) by Stephen Grider (2022).