$ cat ./coding/README.md
Coding
--filterall#Array#Backtrack#Binary Search#Bit Manipulation#Classic#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#Tree#Trie#Two Pointers#UnionFind
./2026/07-24BFS / DFS 模板5m
./2025/10-301631. Path With Minimum Effort4m10-272101. Detonate the Maximum Bombs1m03-272368. Reachable Nodes With Restrictions1m03-27695. Max Area of Island1m
./2024/03-12841. Keys and Rooms1m03-091466. Reorder Routes to Make All Paths Lead to the City Zero5m03-031584. Min Cost to Connect All Points1m03-021091. Shortest Path in Binary Matrix1m02-26787. Cheapest Flights Within K Stops2m02-26399. Evaluate Division1m02-251202. Smallest String With Swaps5m02-251101. The Earliest Moment When Everyone Become Friends3m02-22797. All Paths From Source to Target1m
./2023/01-29261. Graph Valid Tree6m01-29286. Walls and Gates6m01-29547. Number of Provinces6m01-29323. Number of Connected Components in an Undirected Graph3m