Mappings for Cracking the Coding Interview (6th edition) problems to closest match on Leetcode

Arrays and Strings

Problem	LeetCode
1.1	217. Contains Duplicate
1.2	567. Permutation in String
1.3	1410. HTML Entity Parser
1.4	266. Palindrome Permutation
1.5	161. One Edit Distance
1.6	443. String Compression
1.7	48. Rotate Image
1.8	73. Set Matrix Zeroes
1.9	796. Rotate String

Linked Lists

Problem	LeetCode
2.1	1836. Remove Duplicates from an Unsorted Linked List
2.2	19. Remove Nth Node from End of List
2.3	876. Middle of the Linked List
2.4	86. Partition List
2.5	2. Add Two Numbers with follow up 445. Add Two Numbers II
2.6	234. Palindrome Linked List
2.7	160. Intersection of Two Linked Lists
2.8	142. Linked List Cycle II

Stacks and Queues

Problem	LeetCode
3.1
3.2	155. Min Stack
3.3	1172. Dinner Plate Stacks
3.4	232. Implement Queue using Stacks
3.5
3.6

Trees and Graphs

Problem	LeetCode
4.1	1971. Find if Path Exists in Graph
4.2	108. Covert Sorted Array to Binary Search Tree
4.3	102. Binary Tree Level Order Traversal
4.4	110. Balanced Binary Tree
4.5	98. Validate Binary Search Tree
4.6	510. Inorder Successor in BST II
4.7	210. Course Schedule II
4.8	236. Lowest Common Ancestor of a Binary Tree
4.9	1569. Number of Ways to Reorder Array to Get Same BST
4.10	572. Subtree of Another Tree
4.11	381. Insert Delete GetRandom
4.12	437. Path Sum III

Bit Manipulation

Problem	LeetCode
5.1
5.2
5.3
5.4
5.5
5.6
5.7
5.8

Recursion and Dynamic Programming

Problem	LeetCode
8.1
8.2
8.3
8.4
8.5
8.6
8.7
8.8
8.9
8.10
8.11
8.12
8.13
8.14

Sorting and Searching

Problem	LeetCode
10.1
10.2
10.3
10.4
10.5
10.6
10.7
10.8
10.9
10.10
10.11

Moderate

Problem	LeetCode
16.1
16.2
16.3
16.4
16.5
16.6
16.7
16.8
16.9
16.10
16.11
16.12
16.13
16.14
16.15
16.16
16.17
16.18
16.19
16.20
16.21
16.22
16.23
16.24
16.25
16.26

Hard

Problem	LeetCode
12.1
12.2
12.3
12.4
12.5
12.6
12.7
12.8
12.9
12.10
12.11
12.12
12.13
12.14
12.15
12.16
12.17
12.18
12.19
12.20
12.21
12.22
12.23
12.24
12.25
12.26