I've decided to run through Cracking the Coding Interview to prime myself for my current job search. I'll be posting solutions to the problems within the book to this repository.
After a slow start, I've decided to eliminate the performance testing of multiple solutions that I was initially doing. I'll be focusing on rapid development and unit testing of solutions in order to try to get through everything in a more timely fashion.
Progress:
| Arrays and Strings | Status |
|---|---|
| Is Unique | Solved |
| Check Permutation | Solved |
| URLify | Solved |
| Palindrome Permutation | Solved |
| One Away | Solved |
| String Compression | Solved |
| Rotate Matrix | Solved |
| Zero Matrix | |
| String Rotation |
| Linked Lists | Status |
|---|---|
| Remove Dupes | 1/2 solved |
| Return Kth to Last | Solved |
| Delete Middle Node | Solved |
| Partition | Solved |
| Sum Lists | Solved |
| Palindrome | Solved |
| Intersection | Solved |
| Loop Detection | Solved |
| Stacks and Queues | Status |
|---|---|
| Three in One | |
| Stack Min | Solved |
| Stack of Plates | Solved |
| Queue via Stacks | Solved |
| Sort Stack | |
| Animal Shelter | Solved |
| Trees and Graphs | Status |
|---|---|
| Route Between Nodes | Solved |
| Minimal Tree | Need tests |
| List of Depths | Solved |
| Check Balanced | Solved |
| Validate BST | Need tests |
| Successor | Need tests |
| Build Order | Solved |
| First Common Ancestor | Solved |
| BST Sequences | Solved |
| Check Subtree | Solved |
| Random Node | |
| Paths with Sum |