Cracking the Coding Interview
These are my solutions for the questions from the book Cracking the Coding Interview by Gayle Laakman McDowell.
- Is Unique
- Check Permutation
- URLify
- Palindrome Permutation
- One Away
- String Compresison
- Rotate Matrix
- Zero Matrix
- String Rotation
- Remove Dups
- Return Kth to Last
- Delete Middle Node
- Partition
- Sum Lists
- Palindrome
- Intersection
- Loop Detection
- Route Between Nodes
- Minimal Tree
- List of Depths
- Check Balanced
- Validate BST
- Successor
- Build Order
- First Common Ancestor
- BST Sequences
- Check Subtree
- Random Node
- Paths with Sum
- Deck of Cards
- Call Center
- Jukebox
- Parking Lot
- Online Book Reader
- Jigsaw
- Chat Server
- Othello
- Circular Array
- Minesweeper
- File System
- Hash Table
- Triple Step
- Robot in a Grid
- Magic Index
- Power Set
- Recursive Multiply
- Towers of Hanoi
- Permutations without Dups
- Permutations with Dups
- Parens
- Paint Fill
- Coins
- Eight Queens
- Stack of Boxes
- Boolean Evaluation
- Stock Data
- Social Network
- Web Crawler
- Duplicate URLs
- Cache
- Sales Rank
- Personal Financial Manger
- Pastebin
- Sorted Merge
- Group Anagrams
- Search in Rotated Array
- Sorted Search, No Size
- Sparse Search
- Sort Big File
- Missing Int
- Find Duplicates
- Sorted Matrix Search
- Rank from Stream
- Peaks and Valleys