$ cat ./coding/README.md
[#]Coding
────────────────────────────────────────────────────────────
--filterallArrayBacktrackBinary SearchBit ManipulationClassicDesignDynamic ProgrammingGraphGreedyHash TableHeapInorder TraversalIntervalsLinked ListMathMetaMonotonicObject Oriented DesignOtherPostorder TraversalPrefix SumPreorder TraversalQueueRecursionSliding WindowSortingStackStringTreeTrieTwo PointersUnionFind
543. Diameter of Binary Tree#Tree #Postorder Traversal429. N-ary Tree Level Order Traversal#Tree114. Flatten Binary Tree to Linked List#Tree #Postorder Traversal255. Verify Preorder Sequence in Binary Search Tree#Preorder Traversal #Tree111. Minimum Depth of Binary Tree#Tree145. Binary Tree Postorder Traversal#Tree #Postorder Traversal279. Perfect Squares#Tree994. Rotting Oranges#Tree648. Replace Words#Trie428. Serialize and Deserialize N-ary Tree#Tree572. Subtree of Another Tree#Tree589. N-ary Tree Preorder Traversal#Preorder Traversal #Tree606. Construct String from Binary Tree#Tree105. Construct Binary Tree from Preorder and Inorder Traversal#Preorder Traversal #Tree337. House Robber III#Tree #Postorder Traversal83. Remove Duplicates from Sorted List#Two Pointers211. Design Add and Search Words Data Structure#Trie1248. Count Number of Nice Subarrays#Two Pointers642. Design Search Autocomplete System#Trie1268. Search Suggestions System#Trie