$ cat ./coding/README.md
[#]Coding
────────────────────────────────────────────────────────────
--filterallArrayBacktrackBinary SearchBit ManipulationClassicDesignDynamic ProgrammingGraphGreedyHash TableHeapInorder TraversalIntervalsLinked ListMathMetaMonotonicObject Oriented DesignOtherPostorder TraversalPrefix SumPreorder TraversalQueueRecursionSliding WindowSortingStackStringTreeTrieTwo PointersUnionFind
386. Lexicographical Numbers#Other547. Number of Provinces#Graph #Tree347. Top K Frequent Elements#Heap84. Largest Rectangle in Histogram#Stack713. Subarray Product Less Than K#Sliding Window20. Valid Parentheses#Stack250. Count Univalue Subtrees#Tree49. Group Anagrams#Hash Table99. Recover Binary Search Tree#Tree710. Random Pick with Blacklist#Object Oriented Design204. Count Primes#Math344. Reverse String#String1135. Connecting Cities With Minimum Cost#Tree829. Consecutive Numbers Sum#Math701. Insert into a Binary Search Tree#Tree #Two Pointers112. Path Sum#Tree426. Convert Binary Search Tree to Sorted Doubly Linked List#Inorder Traversal #Tree930. Binary Subarrays With Sum#Sliding Window323. Number of Connected Components in an Undirected Graph#Graph #Tree8. String to Integer atoi#String