Algorithm Learning

LeetCode

1.Two Sum

2.Add Two Numbers

3.Longest Substring Without Repeating Characters

4.Median of Two Sorted Arrays

5. Longest Palindromic Substring

6. ZigZag Conversion

7. Reverse Integer

8. String to Integer (atoi)

9. Palindrome Number

10. Regular Expression Matching

11. Container With Most Water

12. Integer to Roman

13. Roman to Integer

14.LongestCommonPrefix

15. 3Sum

16. 3Sum Closest

17. Letter Combinations of a Phone Number

18. 4Sum

19. Remove Nth Node From End of List

20. Valid Parentheses

21. Merge Two Sorted Lists

22. Generate Parentheses

23. Merge k Sorted Lists

24. Swap Nodes in Pairs

25. Reverse Nodes in k-Group

26. Remove Duplicates from Sorted Array

27. Remove Element

28. Implement strStr()

29. Divide Two Integers

30. Substring with Concatenation of All Words

31. Next Permutation

32. Longest Valid Parentheses

33. Search in Rotated Sorted Array

34. Find First and Last Position of Element in Sorted Array

35. Search Insert Position

36. Valid Sudoku

37. Sudoku Solver

38. Count and Say

39. Combination Sum

40. Combination Sum II

41. First Missing Positive

42. Trapping Rain Water

43. Multiply Strings

44. Wildcard Matching

45. Jump Game II

46. Permutations

47. Permutations II

48. Rotate Image

49. Group Anagrams

50. Pow(x, n)

51. N-Queens

52. N-Queens II

53. Maximum Subarray

54. Spiral Matrix

55. Jump Game

56. Merge Intervals

57. Insert Interval

58. Length of Last Word

59. Spiral Matrix II

60. Permutation Sequence

61. Rotate List

62. Unique Paths

63. Unique Paths II

64. Minimum Path Sum

65. Valid Number

66. Plus One

67. Add Binary

69. Sqrt(x)

70. Climbing Stairs

71. Simplify Path

72. Edit Distance

73. Set Matrix Zeroes

74. Search a 2D Matrix

75. Sort Colors

76. Minimum Window Substring

77. Combinations

78. Subsets

79. Word Search

80. Remove Duplicates from Sorted Array II

81. Search in Rotated Sorted Array II

82. Remove Duplicates from Sorted List II

83. Remove Duplicates from Sorted List

84. Largest Rectangle in Histogram

86. Partition List

88. Merge Sorted Array

89. Gray Code

90. Subsets II

91. Decode Ways

92. Reverse Linked List II.md

94. Binary Tree Inorder Traversal

95. Unique Binary Search Trees II

96. Unique Binary Search Trees

98. Validate Binary Search Tree

100. Same Tree

101. Symmetric Tree

102. Binary Tree Level Order Traversal

103. Binary Tree Zigzag Level Order Traversal

104. Maximum Depth of Binary Tree

105. Construct Binary Tree from Preorder and Inorder Traversal

106. Construct Binary Tree from Inorder and Postorder Traversal

107. Binary Tree Level Order Traversal II

108. Convert Sorted Array to Binary Search Tree

109. Convert Sorted List to Binary Search Tree

110. Balanced Binary Tree

111. Minimum Depth of Binary Tree

112. Path Sum

113. Path Sum II

114. Flatten Binary Tree to Linked List

115. Distinct Subsequences

116. Populating Next Right Pointers in Each Node

117. Populating Next Right Pointers in Each Node II

118. Pascal's Triangle

119. Pascal's Triangle II

120. Triangle

121. Best Time to Buy and Sell Stock

122. Best Time to Buy and Sell Stock II

123. Best Time to Buy and Sell Stock III

124. Binary Tree Maximum Path Sum

125. Valid Palindrome

127. Word Ladder

128. Longest Consecutive Sequence

129. Sum Root to Leaf Numbers

130. Surrounded Regions

131. Palindrome Partitioning

132. Palindrome Partitioning II

133. Clone Graph

134. Gas Station

136. Single Number

137. Single Number II

138. Copy List with Random Pointer

139. Word Break

140. Word Break II

141. Linked List Cycle

142. Linked List Cycle II

143. Reorder List

144. Binary Tree Preorder Traversal

145. Binary Tree Postorder Traversal

147. Insertion Sort List

Algorithm(4th_Edition)

Reading notes of book Algorithm(4th Algorithm),ISBN: 9787115293800. All java realization codes are placed in different packages.

Sorting

• Selection
• Insertion
• Shell
• Merge
• QuickSort
• Priority Queue
• BucketSort

Search

• BinarySearch

Data Structure

I started learning the data struture systematically, I will list my notes in the order that I read the book.

Tree

1. Binary Tree
2. Complete Binary Tree
3. Balanced Binary Tree
4. Black Red Tree
5. B Tree series

Queue

• Blocking Queue

1. Array Blocking Queue
2. Linked Blocking Queue
3. Priority Blocking Queue
4. Delay Queue

• Non Blocking Queue

1. ConcurrentLinkedQueue

Map

1. HashMap
2. ConcurrentHashMap

Graph

1. Undirected Graph
2. Directed Graph
3. Minimun Spanning Trees
4. Shortest Path

Union-find

String

1. Trie Tree
2. KMP

Cracking the code interview

1. Array and String. (Question1_*)
2. List. (Question2_*)
3. Stack and Queue. (Question3_*)
4. Tree and Graph. (Question4_*)
5. Bit Operations. (Question5_*)
6. Recursive and Dynamic programming. (Question9_*)