681 B
681 B
Cracking the coding interview exercises and notes
Introduction
- Big O
- Technical questions
Chapter 1 Arrays and strings
- check unique characters
- check if permutation
- replace character by substring
- Levenshtein distance
- String compression
- Matrix rotation
- String rotation
- Hash tables (chapter 7)
- Magic index (chapter 8)
- Search in sorted matrix (chapter 10)
Chapter 2 Linked lists
- Remove duplicates
- Return kth to last
- Delete middle node
- Partition list
- Sum lists
- Check if palindrome
Chapter 7 Object-oriented design
- Hash tables
Chapter 8 Recursion
- Magic index
Chapter 10 Sorting and searching
- Sorted matrix search