https://github.com/stuymedova/cracking-the-coding-interview
[LEARNING] Solutions to problems from "Cracking the Coding Interview"
https://github.com/stuymedova/cracking-the-coding-interview
cracking-the-coding-interview
Last synced: 3 months ago
JSON representation
[LEARNING] Solutions to problems from "Cracking the Coding Interview"
- Host: GitHub
- URL: https://github.com/stuymedova/cracking-the-coding-interview
- Owner: stuymedova
- Created: 2022-11-13T21:56:28.000Z (about 3 years ago)
- Default Branch: main
- Last Pushed: 2023-10-09T11:21:37.000Z (over 2 years ago)
- Last Synced: 2025-01-09T17:04:38.483Z (about 1 year ago)
- Topics: cracking-the-coding-interview
- Language: JavaScript
- Homepage:
- Size: 113 KB
- Stars: 1
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# Cracking the Coding Interview
#### Chapter 1 — Arrays and Strings
- [X] 1.1 - Is Unique
- [X] 1.2 - Check Permutation
- [X] 1.3 - URLify
- [X] 1.4 - Palindrome Permutation
- [X] 1.5 - One Away
- [X] 1.6 - String Compression
- [X] 1.7 - Rotate Matrix
- [X] 1.8 - Zero Matrix
- [X] 1.9 - String Rotation
#### Chapter 2 — Linked Lists
- [X] 2.1 - Remove Dups
- [X] 2.2 - Return Kth to Last
- [X] 2.3 - Delete Middle Node
- [X] 2.4 - Partition
- [X] 2.5 - Sum Lists
- [X] 2.6 - Palindrome
- [X] 2.7 - Intersection
- [X] 2.8 - Loop Detection
#### Chapter 3 — Stacks and Queues
- [X] 3.1 - Three in One
- [X] 3.2 - Stack Min
- [X] 3.3 - Stack of Plates
- [X] 3.4 - Queue via Stacks
- [X] 3.5 - Sort Stack
- [X] 3.6 - Animal Shelter
#### Chapter 4 — Trees and Graphs
- [X] 4.1 - Route Between Nodes
- [X] 4.2 - Minimal Tree
- [X] 4.3 - List of Depths
- [X] 4.4 - Check Balanced
- [X] 4.5 - Validate BST
- [X] 4.6 - Successor
- [X] 4.7 - Build Order
- [X] 4.8 - First Common Ancestor
- [X] 4.9 - BST Sequences
- [X] 4.10 - Check Subtree
- [X] 4.11 - Random Node
- [X] 4.12 - Paths with Sum
#### Chapter 8 — Recursion and Dynamic Programming
- [X] 8.1 - Triple Step
- [X] 8.2 - Robot in a Grid
- [X] 8.3 - Magic Index
- [X] 8.4 - Power Set
- [X] 8.5 - Recursive Multiply
- [X] 8.6 - Towers of Hanoi
- [X] 8.7 - Permutations without Dups
- [X] 8.8 - Permutations with Dups
- [X] 8.9 - Parens
- [X] 8.10 - Paint Fill
- [X] 8.11 - Coins
- [X] 8.12 - Eight Queens
- [X] 8.13 - Stack of Boxes
- [ ] 8.14 - Boolean Eval
#### Chapter 10 — Sorting and Searching
- [X] 10.1 - Sorted Merge
- [X] 10.2 - Group Anagrams
- [X] 10.3 - Search In Rotated Array
- [X] 10.4 - Sorted Search No Size
- [X] 10.5 - Sparse Search
- [ ] 10.6 - Sort Big File
- [X] 10.7 - Missing Int
- [X] 10.8 - Find Duplicates
- [X] 10.9 - Sorted Matrix Search
- [ ] 10.10 - Rank From Stream
- [X] 10.11 - Peaks And Valleys