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
Linked List - Easy
Linked List - Easy 2
Linked List - Medium
Linked List - Hard
chapter 17: Others
chapter 18: Recursion
chapter 19: Stack
chapter 20: String
chapter 21: ToBeOptimized
chapter 22: Tree
chapter 23: Two Pointers
Python Algorithms Traing Basic
Docs
»
chapter 16: Math
Edit on GitHub
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