Cracking the Coding Interview (6th Edition)
Java solutions to problems in the book Cracking the Coding Interview(6th Edition).
Table of Contents
- Arrays and Strings
- LinkedList
- Stacks and Queues
- Trees and Graphs
- Bit Manipulation
- Math and Logic Puzzles
- Object Oriented Design
- Recursion and Dynamic Programming
- System Design and Scalability
- Sorting and Searching
- Testing
- Additional Review Problems
Arrays and Strings
- Check Permutation
- Is Unique
- One Away
- Palindrome Permutation
- Rotate Matrix
- String Compression
- String Rotation
- Urlify
- Zero Matrix
LinkedList
- Delete Middle Node
- Intersection
- ListNode
- Loop Detection
- Palindrome
- Partition
- Remove Duplicates
- Return Kth To Last
- Sum Lists
Stacks and Queues
Trees and Graphs
- Check Balanced Tree
- First Common Ancestor
- List of Depths
- Minimal Tree
- Paths with Sum
- Random Node
- Route between Nodes
- Successor
- Tree Node
- Validate BST
Bit Manipulation
Math and Logic Puzzles
Object Oriented Design
Recursion and Dynamic Programming
- Boolean Evaluation
- Coins
- Eight Queues
- Fibonacci
- Magic Index
- Paint Fill
- Parenthesis
- Permutations with Duplicates
- Permutations without Duplicates
- Power Set
- Recursive Multiply
- Robot In a Grid
- Stack of Boxes
- Towers of Hanoi
- Triple Steps
System Design and Scalability
Sorting and Searching
- Group Anagrams
- Merge Sort
- Quick Sort
- Search in Rotated Array
- Sort Big File
- Sorted Merge
- Sorted Search No Size
- Sparse Search