The Coding Interview Bootcamp: Algorithms + Data Structures

Practice coding interview questions by understanding and solving each one, with two options to write and run code: locally on your machine or using built-in course exercises.

Set up your coding practice environment by cloning Stephen Grider's algo cas repo, navigating to the project, and installing the global gest package with npm; on Windows omit sudo.

Set up a Git repo of course exercises, install the just command line tool with npm, and use Jest to run tests on each exercise's js and test js files.

Open the reverse string problem, run tests to see failures, implement a function that reverses the input string and returns it, and re-run tests until all pass.

Explore string reversal in JavaScript by converting a string to an array with split, applying array.prototype.reverse, and joining back to a reversed string.

Explore a manual string reversal using a for-of loop to prepend each character, building the reversed string, and learn why to avoid classic for loops in favor of ES2015 syntax.

Explore a third solution to string reversal using a split and reduce helper to build the reverse, illustrating ES6 refinements and interview-ready problem solving.

Use debugger statements to pause execution, inspect variables, and validate string manipulation in JavaScript. Leverage ripple mode and node inspect to audit and develop algorithms across problems.

Explore palindromes by reversing a string and checking if it matches the original, returning a boolean true or false. Practice with JavaScript tests to verify your palindrome function.

Explore a direct palindrome check by reversing the input string using split, reverse, and join, then comparing to the original to return a boolean result tested against the test suite.

Explore an alternative palindrome solution using the every array helper, converting a string to an array, and comparing mirrored characters to evaluate palindromes, while discussing trade-offs in an interview setting.

Learn to reverse an integer in JavaScript by converting to string, reversing with split and join, and converting back with parseInt, while handling negatives and trailing zeros.

Reverse the integer by converting it to a string, then split, reverse, and join, finally parsing the result with parseInt while preserving the sign. Use Math.sign to simplify sign handling.

Learn a character frequency technique by converting a string into a character-count map to identify the most common character, detect duplicates, and compare strings for equal counts.

Learn to solve the max char problem by building a character map: iterate the string with for-of, update an object with counts, handle undefined, and identify the most frequent character.

Build a character map to count each character in a string and identify the most frequent one, applying this approach to the max char problem.

Build and iterate a character map to find the most frequent character in a string using a for-in loop, updating max and maxChar, then return maxChar.

Master the fizz buzz problem by using a for loop from one to n and the modulo operator to detect multiples, printing lowercase fizz, buzz, or fizz buzz.

Demonstrates a clear fizz buzz solution by iterating from one to n and using modulo checks with console.log to print fizz, buzz, fizz buzz, or the number.

learn to implement a chunk function that splits an array into subarrays of a given size, placing orphaned elements into their own chunk.

Explore a practical solution to the chunk problem by building a chunked array of subarrays, iterating the input to fill chunks of the given chunk size.

Create a chunked array by iterating an array, starting a new chunk when the last one is full with the given chunk size, and returning the final result.

Explore an alternate chunk solution using the slice method to create chunks from an array. Iterate with an index, slice from index to index plus size, and push to results.

Explore chunking arrays with the slice function to create fixed-size chunks, using a while loop, index management, and pushing slices into a result array.

Explore how to determine if two strings are anagrams by building character maps, ignoring spaces and punctuation, and treating uppercase and lowercase as equal, with regex-based cleanup.

Learn to solve anagrams by building character maps from two strings using a reusable helper, normalizing input by lowercasing and removing spaces and punctuation, and comparing maps for equality.

Apply the sorting trick to anagrams by cleaning, lowercasing, sorting characters, and comparing the two sorted strings for equality.

Explore how to capitalize the first letter of each word in a string using JavaScript, leveraging slice and toUpperCase, and compare concise versus brute-force solutions.

Apply a practical capitalization solution: split the sentence into words, uppercase each first letter, and join them back. Uses a words array, toUpperCase, and slice.

Explore an alternative capitalized function that builds a result by iterating characters, capitalizing when the left neighbor is a space, starting with the first character capitalized.