Python Algorithms Training Basic

Python Algorithms Training Basic

written by sean base on following books

Github | https://github.com/newsteinking/High_pythonalgorithms_training_basic

• chapter 1: Array
  • Array - Easy
    • 1.Two Sum
    • 27.Remove Element
    • 35.Search Insert Position
    • 53.Maximum Subarray
    • 66.Plus One
    • 88. Merge Sorted Array
    • 88.2 Merge Sorted Array 2
    • 118. Pascal's Triangle
    • 118.2 Pascal's Triangle
    • 118.3 Pascal's Triangle 3
    • 119. Pascal's Triangle 2
    • 121. Best Time to Buy and Sell Stock
    • 122. Best Time to Buy and Sell Stock 2
    • 167. Two Sum 2
    • 169. Majority Element
    • 189. Rotate Array
    • 217. Contains Duplicate
    • 219. Contains Duplicate 2
    • 268. Missing Number
    • 283. Move Zeroes
    • 414. Third Maximum Number
    • 448. Find All Numbers Disappeared in Array
    • 485. Max Consecutive Ones
    • 532. K-diff Pairs in an Array
    • 561. Array Partition 1
    • 566. Reshape the Matrix
    • 581. Shortest Unsorted Continuous Subarray
  • Array - Easy 2
    • 31. Next Permutation
    • 41. First Missing Positive
    • 54. Spiral Matrix
    • 56. Merge Intervals
    • 57. Insert Intervals
    • 59. Spiral Matrix 2
    • 73. Set Matrix Zeroes
  • Array - Medium
  • Array - Hard
• chapter 2: Backtracking
  • Backtracking - Easy
    • 22. generate-parentheses
    • 39. Combination Sum
    • 40. Combination Sum 2
    • 46. Permutations
    • 47. Permutation 2
    • 51. NQueens
    • 52. N-Queens 2
    • 79. Word Search
    • 90. Subsets 2
    • 93. Restore IP Addresses
    • 131. Palindrome-partitioning
    • 216. Combination Sum 3
  • Backtracking - Medium
  • Backtracking - Hard
• chapter 3: Binary Search
  • BinarySearch - Easy
    • 4. Median of two sorted arrays
    • 33. Search In Rotated Sorted Array
    • 34. Search for a range
    • 35. Search In Position
    • 69. sqrtx
    • 74. Search a 2D matrix
    • 81. Search In rotated sorted array 2
    • 153. find minimum in rotated sorted array
    • 154. find minimum in rotated sorted array 2
    • 162. find peak element
    • 222. count complete tree nodes
    • 230. Kth smallest element in a bst
    • 275. H index 2
    • 278. First Bad Version
    • 367. Valid perfect square
    • 378. kth smallest element in a sorted matrix
  • BinarySearch - Medium
  • BinarySearch - Hard
• chapter 4: Bit manipulation
  • Bit manipulation - Easy
    • 136. Single Number
    • 169. Majority Element
    • 190. Reverse Bits
    • 191. Number of 1 Bits
    • 231. Power of Two
    • 268. Missing Number
    • 342. Power of Four
    • 371. Sum of Two Integers
    • 389. Find the Difference
    • 461. Hamming Distance
    • 476. Number Complement
  • Bit manipulation - Easy 2
    • 29. divide two integers
    • 78. subsets
    • 136. single number
    • 137. single number 2
    • 201. bitwise and of numbers range
    • 260. single number 3
    • 318. maximum product from all buildings
    • 338. Counting bits
  • Bit manipulation - Medium
  • Bit manipulation - Hard
• chapter 5: Breadth First Search
  • Breadth First Search - Easy
    • 102. Binary Tree level order traveral
    • 103. Binary tree zigzag level order traversal
    • 104. Maximum depth of binary tree
    • 107. Binary tree level order traveral 2
    • 126. word ladder 2
    • 127. word ladder
    • 130. Surrounded regions
    • 199. Binary tree right side view
    • 310. Minimum height trees
    • 322. coin change
  • Breadth First Search - Medium
  • Breadth First Search - Hard
• chapter 6: Combination
  • Combination - Easy
    • 30. substring with concatenaton of all words
    • 37. sudoku solver
    • 140. word break 2
    • 146. lru cache
    • 300. longest increasing subsequence
    • 324. wiggle sort 2
    • 329. longest increasing path in a matrix
    • 355. Design twitter
  • Combination - Medium
  • Combination - Hard
• chapter 7: Depth First Search
  • Depth First Search - Easy
    • 98. validate binary search tree
    • 126. word ladder 2
    • 129. sum root to leaf numbers
    • 140. word break 2
    • 200. number of islands
    • 257. Binary tree paths
    • 282. expression add operators
    • 301. remove invalid parentheses
    • 306. additive number
  • Depth First Search - Medium
  • Depth First Search - Hard
• chapter 8: DFA
  • DFA - Easy
    • 65. Valid Number
  • DFA - Medium
  • DFA - Hard
• chapter 9: DivideConquer
  • DivideConquer - Easy
    • 215. Kth Largest Element Array
    • 240. Search 2D Matrix 2
    • 241. Different Ways To Add Parenthese
  • DivideConquer - Medium
  • DivideConquer - Hard
• chapter 10: Dynamic Programming
  • Dynamic Programming - Easy
    • 53. Maximum Subarray
    • 62. Unique Paths
    • 63. Unique Paths 2
    • 64. Minimum Path Sum
    • 70. Climibing Stairs
    • 121. Best Time To Buy and Sell Stock
  • Dynamic Programming - Easy 2
    • 10. Regular Expression Matching
    • 32. Longest Valid Parentheses
    • 44. WildCard Matching
    • 53. Maximum subarray
    • 70. Climbing Stairs
    • 72. Edit Distance
    • 87. Scramble String
    • 91. Decode Ways
    • 97. Interleaving String
  • Dynamic Programming - Easy
    • New
  • Dynamic Programming - Hard
    • New
• chapter 11: Graph
  • Graph - Easy
    • 133. Clone Graph
    • 207. Course Schedule
    • 210. Course Schedule 2
  • Graph - Medium
  • Graph - Hard
• chapter 12: Greedy
  • Greedy - Easy
    • 45. Jump Game 2
    • 55. Jump Game
    • 122. Best time to buy and sell stock
    • 134. Gas Station
    • 316. Remove duplicate letters
    • 330. Patching Array
  • Greedy - Medium
  • Greedy - Hard
• chapter 13: Hash table
  • Hash table - Easy
    • 1. Two Sum
    • 136. Single Number
    • 202. Happy Number
    • 204. Count Primes
    • 205. Isomorphic Strings
    • 217. Contains Duplicate
    • 219. Cotains Duplicate 2
    • 242. Valid Anagram
    • 290. Word Pattern
    • 349. Intersection of Two Arrays
    • 350. Intersection of Two Arrays 2
    • 389. Find the Difference
    • 409. Longest Palindrome
    • 438. Find All Anagrams in a String
    • 447. Number of Boomerangs
    • 463. Island Perimeter
    • 575. Distribute Candies
    • 594. Longest Harmonious Subsequence
    • 599. Minimum Index Sum of Two Lists
  • Hash table - Easy 2
    • 1. Two Sum
    • 3. Longest substring without repeating charater
    • 36. Valid Sudoku
    • 49. Group Anagrams
    • 128. Longest Consecutive Sequence
    • 146. LRU Cache
    • 149. Max Points on a line
    • 187. Repeated DNA Sequences
  • Hash table - Medium
    • New
  • Hash table - Hard
    • New
• chapter 14: Heap
  • Heap - Easy
    • 23. Merge K Sorted Lists
    • 295. Find Median From Data Stream
    • 347. Top K Frequent Elements
  • Heap - Medium
  • Heap - Hard
• chapter 15: Linked List
  • Images - Easy
    • 223. Retangle Area
    • 65. Valid Number
    • 223
    • 65 State Convert
    • 65 Valid Number
    • Backtracking 1
    • Backtracking 2
    • Backtracking 3
    • Backtracking 4
    • Graph 1
    • Stack Demo
    • Tree 1
    • Tree 2
  • Images - Medium
  • Images - Hard
• chapter 16: Math
  • Linked List - Easy
    • 21. Merge Two Sorted Lists
    • 83. Remove Duplicates from Sorted List
    • 141. Linked List Cycle
    • 160. Intersection of Two Linked Lists
    • 203. Remove Linked List Elements
    • 206. Reverse Linked List
    • 234. Palindrome Linked List
    • 237. Delete Node in a Linked List
  • Linked List - Easy 2
    • 2. Add Two Number
    • 61. Rotate LIst
    • 76. Minimum window substring
    • 82. Remove duplicates from sorted list 2
    • 86. Partition List
    • 92. Reverse Linked List 2
    • 138. Copy list with random pointer
    • 143. Reorder List
    • 147. Insertion sort list
    • 148. Sort List
    • 328. Odd Even Linked List
  • Linked List - Medium
    • New
  • Linked List - Hard
    • New
• chapter 17: Others
  • Math - Easy
    • 66. Plus One
    • 168. Excel Sheet Column Title
    • 171. Excel Sheet Column Number
    • 172. Factorial Trailing Zeroes
    • 202. Happy Number
    • 204. Count Primes
    • 231. Power of Two
    • 258. Add Digits
    • 268. Missing Number
    • 367. Valid Perfect Square
    • 441. Arranging Coins
    • 453. Minimum Moves to Equal Array Elements
    • 598. Range Addition 2
  • Math - Easy 2
    • 12 Integer to Roman
    • 13. Roman to Integer
    • 43. Multiply Strings
    • 48. Rotate Image
    • 50. powx-n
    • 60. Permutation Sequence
    • 166. Fraction to Recurring Decimal
    • 179. Largest Number
    • 223. Rectangle Area
    • 233. Number of Digit One
    • 238. Product of array except self
    • 273. Integer to English
    • 292. Nim Game
    • 319. bulb switcher
    • 326. Power of three
    • 335. Self Crossing
    • 343. Integer Break
  • Math - Medium
    • New
  • Math - Hard
    • New
• chapter 18: Recursion
  • Others - Easy
    • 220. Contains Duplicate 3
    • 229. Majority Element 2
    • 239. Sliding window Maximum
    • 284. Peeking Iterator
    • 307. Range sum query mutable
    • 329. Longest Increasing Path in a Matrix
    • 332. Reconstruct itinerary
  • Others - Medium
  • Others - Hard
• chapter 19: Stack
  • Recursion - Easy
    • 77. Combinations
    • 89. Gray Code
    • 101. Symmetric Tree
  • Recursion - Medium
  • Recursion - Hard
• chapter 20: String
  • Stack - Easy
    • 20. Valid Parentheses
    • 32. Longest Valid Parentheses
    • 71. Simplify Path
    • 84. Largest Rectangle in Histogram
    • 85. Maximal Rectangle
    • 94. Binary tree inorder traversal
    • 150. Evaluate Reverse Polish notation
    • 155. Min Stack
    • 1224. Basic Caculator
    • 225. Implement stack using queues
    • 227. Basic Calculator 2
    • 232. Implement queue using stacks
    • 316. Remove duplicate letters
    • 341. Flatten nested list iterator
  • Stack - Medium
  • Stack - Hard
• chapter 21: ToBeOptimized
  • String - Easy
    • 5. Longest palindromic substring
    • 6. Zigzag Conversion
    • 8. String to integer atoi
    • 14. Longest Common Prefix
    • 17. Letter combination of a phone number
    • 28. Implement StrStr
    • 38. Count and Say
    • 58. Length of Last word
    • 67. Add Binary
    • 68. Text Justification
    • 151. Reverse words in a string
    • 165. Compare version numbers
    • 344. Reverse String
  • String - Medium
  • String - Hard
• chapter 22: Tree
  • ToBeOptimized - Easy
    • 18. 4sum
    • 125. Valid Palindrome
    • 127. Word Ladder
    • 131. palindrome partitioning
    • 132. palindrome partitioning 2
    • 140. Word break 2
    • 279. Perfect squares
    • 322. Coin Change
    • 324. Wiggle Sort 2
  • ToBeOptimized - Medium
  • ToBeOptimized - Hard
• chapter 23: Two Pointers
  • Tree - Easy
    • 94. Binary Tree inorder traversal
    • 95. Unique Binary Search Trees 2
    • 96. Unique Binary Search Trees
    • 99. Recover Binary Search Tree
    • 100. Same Tree
    • 105. Contruct binary tree from preorder and inorder traversal
    • 106. Construct binary tree from inorder and preorder traversal
    • 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 2
    • 114. Flatten binary tree to linked list
    • 116. Populating next right pointers in each node
    • 117. populating next right pointers in each node 2
    • 124. Binary tree maximum path sum
    • 144. Binary tree preorder traversal
    • 145. Binary Tree postorder traversal
    • 173. Binary Search tree iterator
    • 208. Implement trie prefix
    • 211. Add and Search word data Structure design
    • 226. Invert Binary tree
    • 235. Lowest common ancestor of a binary search
    • 236. Lowest common ancestor of a binary tree
    • 297. Serialize and deserialize binary tree
    • 331. Verify preorder serialization of a binary tree
  • Tree - Medium
  • Tree - Hard