$ cat ./coding/README.md
[#]Coding
────────────────────────────────────────────────────────────
--filterallArrayBacktrackBinary SearchBit ManipulationClassicDesignDynamic ProgrammingGraphGreedyHash TableHeapInorder TraversalIntervalsLinked ListMathMetaMonotonicObject Oriented DesignOtherPostorder TraversalPrefix SumPreorder TraversalQueueRecursionSliding WindowSortingStackStringTreeTrieTwo PointersUnionFind
1338. Reduce Array Size to The Half#Greedy #Heap1962. Remove Stones to Minimize the Total#Heap480. Sliding Window Median#Heap #Sliding Window870. Advantage Shuffle#Heap #Two PointersMeta - Kaitenzushi#Heap #Meta658. Find K Closest Elements#Heap #Array933. Number of Recent Calls#HeapKth Smallest Element in a Sorted Matrix#Heap1046. Last Stone Weight#Design #Heap703. Kth Largest Element in a Stream#Design #Heap215. Kth Largest Element in an Array#Sorting #Heap295. Find Median from Data Stream#Design #Heap1167. Minimum Cost to Connect Sticks#Heap692. Top K Frequent Words#Heap973. K Closest Points to Origin#Heap128. Longest Consecutive Sequence#Heap347. Top K Frequent Elements#Heap