1
Notes for Preparing
Coding Interview
X Wang
Version 1.0
C O N T E N T S
i Freface 4
ii Java Questions 5
1 Top 10 Algorithms for Coding Interview 6
2 LeetCode - Evaluate Reverse Polish Notation 15
3 Leetcode Solution of Longest Palindromic Substring in Java 18
4 Leetcode Solution - Word Break 22
5 LeetCode - Word Ladder 24
6 LeetCode - Median of Two Sorted Arrays Java 28
7 LeetCode - Regular Expression Matching in Java 30
8 LeetCode - Merge Intervals 32
9 LeetCode - Insert Interval 34
10 LeetCode - Two Sum (Java) 36
11 LeetCode - 3Sum 37
12 LeetCode - String to Integer (atoi) 40
13 LeetCode - Merge Sorted Array (Java) 42
14 LeetCode - Valid Parentheses (Java) 44
15 LeetCode - Implement strStr() (Java) 46
16 LeetCode - Set Matrix Zeroes (Java) 48
17 Leetcode solution - Add Two Numbers in Java 50
18 Reorder List in Java 54
19 Leetcode - Linked List Cycle 59
20 LeetCode - Copy List with Random Pointer 61
21 LeetCode - Merge Two Sorted Lists (Java) 64
22 LeetCode - Remove Duplicates from Sorted List 66
23 Leetcode Solution for Binary Tree Preorder Traversal in Java 68
24 Leetcode Solution of Binary Tree Inorder Traversal in Java 70
25 Leetcode Solution of Iterative Binary Tree Postorder Traversal in Java 72
26 LeetCode - Word Ladder 74
27 LeetCode - Validate Binary Search Tree (Java) 78
28 LeetCode - Flatten Binary Tree to Linked List 80
29 LeetCode - Path Sum 82
30 Construct Binary Tree from Inorder and Postorder Traversal 84
31 LeetCode Clone Graph Java 86
32 LeetCode Solution - Merge Sort LinkedList in Java 89
33 Quicksort Array in Java 93
34 LeetCode Solution - Sort a linked list using insertion sort in Java 95
35 Iteration vs. Recursion in Java 98
2
Part I
F R E FA C E
Part II
J AVA Q U E S T I O N S
