$ cat ./coding/README.md
[#]Coding
────────────────────────────────────────────────────────────
--filterallArrayBacktrackBinary SearchBit ManipulationClassicDesignDynamic ProgrammingGraphGreedyHash TableHeapInorder TraversalIntervalsLinked ListMathMetaMonotonicObject Oriented DesignOtherPostorder TraversalPrefix SumPreorder TraversalQueueRecursionSliding WindowSortingStackStringTreeTrieTwo PointersUnionFind
677. Map Sum Pairs#Trie588. Design In-Memory File System#Trie19. Remove Nth Node From End of List#Two Pointers1095. Find in Mountain Array#Two Pointers271. Encode and Decode Strings#Object Oriented Design7. Reverse Integer#Bit Manipulation51. & 52. N Queens#BacktrackHackerRank Counting Valleys#Array372. Super Pow#Math191. Number of 1 Bits#Bit Manipulation1167. Minimum Cost to Connect Sticks#Heap322. Coin Change#Dynamic Programming158. Read N Characters Given Read4 II - Call multiple times#Other876. Middle of the Linked List#Linked List #Two Pointers692. Top K Frequent Words#Heap92. Reverse Linked List II#Linked List242. Valid Anagram#Hash Table1010. Pairs of Songs With Total Durations Divisible by 60#Hash Table340. Longest Substring with At Most K Distinct Character#Sliding Window380. Insert Delete GetRandom O(1)#Object Oriented Design