$ cat ./coding/README.md
[#]Coding
────────────────────────────────────────────────────────────
--filterallArrayBacktrackBinary SearchBit ManipulationClassicDesignDynamic ProgrammingGraphGreedyHash TableHeapInorder TraversalIntervalsLinked ListMathMetaMonotonicObject Oriented DesignOtherPostorder TraversalPrefix SumPreorder TraversalQueueRecursionSliding WindowSortingStackStringTreeTrieTwo PointersUnionFind
1492. The kth Factor of n#Math102. Binary Tree Level Order Traversal#Tree23. Merge k Sorted Lists#Linked List904. Fruit Into Baskets#Sliding Window31. Next Permutation#Backtrack #Other394. Decode String#Stack1004. Max Consecutive Ones III#Sliding Window1446. Consecutive Characters#Other12. Integer to Roman#String862. Shortest Subarray with Sum at Least K#Sliding Window117. Populating Next Right Pointers in Each Node II#Tree1379. Find a Corresponding Node of a Binary Tree in a Clone of That Tree#Tree116. Populating Next Right Pointers in Each Node#Tree700. Search in a Binary Search Tree#Tree #Binary Search450. Delete Node in a BST#Tree752. Open the Lock#Tree104. Maximum Depth of Binary Tree#Tree652. Find Duplicate Subtrees#Tree #Postorder Traversal113. Path Sum II#Tree417. Pacific Atlantic Water Flow#Tree