Some algorithms and data structures to prepare for a JavaScript coding interview.
| # | Coding Exercise |
|---|---|
| 01 | String Reversal |
| 02 | Palindromes |
| 03 | Integer Reversal |
| 04 | Max Chars |
| 05 | FizzBuzz |
| 06 | Array Chunk |
| 07 | Anagrams |
| 08 | Capitalization |
| 09 | Steps |
| 10 | Pyramids |
| 11 | Finding Vowels |
| 12 | Matrix Spiral |
| 13 | Fibonacci Series |
| 14 | Queue |
| 15 | Weave |
| 16 | Implementing Stacks |
| 17 | Queue From Stacks |
| 18 | Linked Lists |
| 19 | Midpoint |
| 20 | Circular |
| 21 | From Last |
| 22 | Building a Tree |
| 23 | Level Width |
| 24 | Binary Search Tree |
| 25 | Validating Binary Search Trees |
| 26 | Events |
| 27 | Sorting |
Based on The Coding Inteview Bootcamp: Algorithms + Data Structures by Stephen Grider (2022).