Python Algorithms Traing Basic
latest
chapter 1: Array
chapter 2: Backtracking
chapter 3: Binary Search
chapter 4: Bit manipulation
chapter 5: Breadth First Search
chapter 6: Combination
chapter 7: Depth First Search
chapter 8: DFA
chapter 9: DivideConquer
chapter 10: Dynamic Programming
chapter 11: Graph
chapter 12: Greedy
chapter 13: Hash table
chapter 14: Heap
chapter 15: Linked List
chapter 16: Math
chapter 17: Others
chapter 18: Recursion
chapter 19: Stack
chapter 20: String
chapter 21: ToBeOptimized
chapter 22: Tree
ToBeOptimized - Easy
ToBeOptimized - Medium
ToBeOptimized - Hard
chapter 23: Two Pointers
Python Algorithms Traing Basic
Docs
»
chapter 22: Tree
Edit on GitHub
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