$ cat ./coding/README.md
[#]Coding
────────────────────────────────────────────────────────────
--filterallArrayBacktrackBinary SearchBit ManipulationClassicDesignDynamic ProgrammingGraphGreedyHash TableHeapInorder TraversalIntervalsLinked ListMathMetaMonotonicObject Oriented DesignOtherPostorder TraversalPrefix SumPreorder TraversalQueueRecursionSliding WindowSortingStackStringTreeTrieTwo PointersUnionFind
1631. Path With Minimum Effort#Graph #Binary Search2101. Detonate the Maximum Bombs#Graph2368. Reachable Nodes With Restrictions#Graph695. Max Area of Island#Graph841. Keys and Rooms#Graph1466. Reorder Routes to Make All Paths Lead to the City Zero#Graph #Tree1584. Min Cost to Connect All Points#Graph #UnionFind1091. Shortest Path in Binary Matrix#Graph #Tree787. Cheapest Flights Within K Stops#Graph #Dynamic Programming399. Evaluate Division#Graph1202. Smallest String With Swaps#Graph1101. The Earliest Moment When Everyone Become Friends#Graph #UnionFind797. All Paths From Source to Target#Graph #Backtrack261. Graph Valid Tree#Graph #Tree286. Walls and Gates#Graph #Tree547. Number of Provinces#Graph #Tree323. Number of Connected Components in an Undirected Graph#Graph #Tree