$ cat ./coding/README.md | sed -n '1,20p'
Coding
--filterall#Array#Backtrack#Binary Search#Binary Search Tree#Bit Manipulation#Breadth-First Search#Classic#Depth-First Search#Design#Dynamic Programming#Graph#Greedy#Hash Table#Heap#Inorder Traversal#Intervals#Linked List#Math#Meta#Monotonic#Object Oriented Design#Other#Palindrome#Postorder Traversal#Prefix Sum#Preorder Traversal#Queue#Recursion#Sliding Window#Sorting#Stack#String#Topological Sort#Tree#Trie#Two Pointers#UnionFind
./2026/08-18708. Insert into a Sorted Circular Linked List1m07-24Linked List 模板5m
./2025/12-24143. Reorder List7m04-0124. Swap Nodes in Pairs3m
./2024/08-0986. Partition List1m06-0921. Merge Two Sorted Lists7m03-12206. Reverse Linked List8m03-092095. Delete the Middle Node of a Linked List1m
./2023/11-06707. Design Linked List2m11-05147. Insertion Sort List5m11-01141. Linked List Cycle7m01-311650. Lowest Common Ancestor of a Binary Tree III9m01-29234. Palindrome Linked List12m01-29876. Middle of the Linked List6m01-2992. Reverse Linked List II11m01-29148. Sort List2m01-29430. Flatten a Multilevel Doubly Linked List1m01-29426. Convert Binary Search Tree to Sorted Doubly Linked List8m01-2923. Merge k Sorted Lists13m01-29117. Populating Next Right Pointers in Each Node II6m
page 1/2 · showing 1–20 of 21