$ cat ./coding/README.md
[#]Coding
────────────────────────────────────────────────────────────
--filterallArrayBacktrackBinary SearchBit ManipulationClassicDesignDynamic ProgrammingGraphGreedyHash TableHeapInorder TraversalIntervalsLinked ListMathMetaMonotonicObject Oriented DesignOtherPostorder TraversalPrefix SumPreorder TraversalQueueRecursionSliding WindowSortingStackStringTreeTrieTwo PointersUnionFind
472. Concatenated Words#Classic252. Meeting Rooms#Intervals #Classic731. My Calendar II#Classic505. The Maze II#Classic126. Word Ladder II#Classic269. Alien Dictionary#Other246. Strobogrammatic Number#Other726. Number of Atoms#String1373. Maximum Sum BST in Binary Tree#Tree94. Binary Tree Inorder Traversal#Inorder Traversal #Tree222. Count Complete Tree Nodes#Tree559. Maximum Depth of N-ary Tree#Tree261. Graph Valid Tree#Graph #Tree106. Construct Binary Tree from Inorder and Postorder Traversal#Tree #Postorder Traversal124. Binary Tree Maximum Path Sum#Tree #Postorder Traversal437. Path Sum III#Tree286. Walls and Gates#Graph #Tree590. N-ary Tree Postorder Traversal#Tree #Postorder Traversal144. Binary Tree Preorder Traversal#Preorder Traversal #Tree297. Serialize and Deserialize Binary Tree#Tree