$ cat ./coding/README.md
[#]Coding
────────────────────────────────────────────────────────────
--filterallArrayBacktrackBinary SearchBit ManipulationClassicDesignDynamic ProgrammingGraphGreedyHash TableHeapInorder TraversalIntervalsLinked ListMathMetaMonotonicObject Oriented DesignOtherPostorder TraversalPrefix SumPreorder TraversalQueueRecursionSliding WindowSortingStackStringTreeTrieTwo PointersUnionFind
701. Insert into a Binary Search Tree#Tree #Two Pointers112. Path Sum#Tree426. Convert Binary Search Tree to Sorted Doubly Linked List#Inorder Traversal #Tree323. Number of Connected Components in an Undirected Graph#Graph #Tree102. Binary Tree Level Order Traversal#Tree117. 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#Tree543. 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#Tree