54 lines
1.2 KiB
Markdown
54 lines
1.2 KiB
Markdown
# Cracking the coding interview exercises and notes
|
|
|
|
If you can't afford to buy the book, you can find a free pdf [here](https://leonmercanti.com/books/personal-development/Cracking%20the%20Coding%20Interview%20189%20Programming%20Questions%20and%20Solutions.pdf).
|
|
|
|
## Introduction
|
|
|
|
1. Big O
|
|
2. 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
|
|
* Insert node at beginning
|
|
* Insert node at end
|
|
* Reverse list, single and double linked
|
|
* List intersection
|
|
* Loop detection
|
|
|
|
## Chapter 7 Object-oriented design
|
|
|
|
* Hash tables
|
|
|
|
## Chapter 8 Recursion
|
|
|
|
* Magic index (index such that A[i] = 1)
|
|
|
|
## Chapter 10 Sorting and searching
|
|
|
|
* Sorted matrix search
|
|
|
|
## Chapter 16 Moderate problems
|
|
|
|
* Write an integer in english
|
|
* Contiguous sequence or Maximum subarray
|
|
* Least Recently Used cache
|