$ cat ./coding/README.md
[#]Coding
────────────────────────────────────────────────────────────
--filterallArrayBacktrackBinary SearchBit ManipulationClassicDesignDynamic ProgrammingGraphGreedyHash TableHeapInorder TraversalIntervalsLinked ListMathMetaMonotonicObject Oriented DesignOtherPostorder TraversalPrefix SumPreorder TraversalQueueRecursionSliding WindowSortingStackStringTreeTrieTwo PointersUnionFind
480. Sliding Window Median#Heap #Sliding Window2368. Reachable Nodes With Restrictions#Graph695. Max Area of Island#Graph270. Closest Binary Search Tree Value#Tree938. Range Sum of BST#Tree103. Binary Tree Zigzag Level Order Traversal#Tree1302. Deepest Leaves Sum#Tree515. Find Largest Value in Each Tree Row#Tree1026. Maximum Difference Between Node and Ancestor#Tree1208. Get Equal Substrings Within Budget#Sliding Window2090. K Radius Subarray Averages#Prefix Sum1413. Minimum Value to Get Positive Step by Step Sum#Prefix Sum2270. Number of Ways to Split Array#Prefix Sum525. Contiguous Array#Prefix Sum1314. Matrix Block Sum#Prefix Sum304. Range Sum Query 2D - Immutable#Prefix Sum #Classic1081. Smallest Subsequence of Distinct Characters#String #Stack316. Remove Duplicate Letters#String #Stack870. Advantage Shuffle#Heap #Two Pointers240. Search a 2D Matrix II