Cracking the Coding Interview

Reference: Cracking the Coding Interview by Gayle Laakmann McDowell

Code

Arrays and Strings

1. Palindrome Permutation
2. Rotate Matrix
3. String Compression
4. String One Away
5. String Permutation Count
6. String Permutation Sorting
7. String URLify
8. Unique String
9. Zero Matrix

Linked Lists

1. Delete Middle Node
2. Intersection List
3. Loop Detection LinkedList
4. Palindrome List
5. Palindrome List Recursive
6. Palindrome List Stack Approach
7. Palindrome List Stack Pointer Approach
8. Partition LinkedList
9. Partition List With New Lists
10. Remove Duplicates LinkedList
11. Remove Duplicates LinkedList Runner
12. Return Kth Element LinkedList
13. Singly LinkedList
14. Sum Lists
15. Circularly LinkedList

Stacks and Queues

1. Animal
2. Fixed Multi Stack Array
3. Queue Via Stacks
4. Set Of Stacks
5. Sort Stack
6. Stack Min
7. Stack Node Min

Trees and Graphs

1. Check Balanced
2. Check Balanced Efficient
3. Create Minimal BST
4. LinkedLists Of Depths BFS
5. LinkedLists Of Depths DFS
6. Successor
7. TreeNode

Programming Language

Java