Python ==================================== .. toctree:: :maxdepth: 2 template dp TwoSum add-two-numbers longest-substring-without-repeating-characters longest-palindromic-substring container-with-most-water longest-common-prefix 3Sum valid-parentheses merge-two-sorted-lists generate-parentheses merge-k-sorted-lists reverse-nodes-in-k-group swap-nodes-in-pairs remove-duplicates-from-sorted-array search-in-rotated-sorted-array first-missing-positive trapping-rain-water permutations merge-intervals minimum-path-sum plus-one climbing-stairs edit-distance minimum-window-substring search-in-rotated-sorted-array-ii remove-duplicates-from-sorted-list-ii remove-duplicates-from-sorted-list largest-rectangle-in-histogram merge-sorted-array validate-binary-search-tree binary-tree-level-order-traversal binary-tree-zigzag-level-order-traversal maximum-depth-of-binary-tree construct-binary-tree-from-preorder-and-inorder-traversal convert-sorted-array-to-binary-search-tree balanced-binary-tree minimum-depth-of-binary-tree best-time-to-buy-and-sell-stock best-time-to-buy-and-sell-stock-ii binary-tree-maximum-path-sum single-number linked-list-cycle linked-list-cycle-ii reorder-list lru-cache Reverse-Words-in-a-String min-stack two-sum-ii-input-array-is-sorted intersection-of-two-linked-lists majority-element rotate-array house-robber binary-tree-right-side-view reverse-linked-list implement-trie-prefix-tree minimum-size-subarray-sum house-robber-ii kth-largest-element-in-an-array implement-stack-using-queues invert-binary-tree implement-queue-using-stacks lowest-common-ancestor-of-a-binary-search-tree lowest-common-ancestor-of-a-binary-tree sliding-window-maximum move-zeroes ongest-increasing-subsequence coin-change house-robber-iii third-maximum-number n-ary-tree-level-order-traversal add-two-numbers-ii fibonacci-number diameter-of-binary-tree degree-of-an-array kth-largest-element-in-a-stream middle-of-the-linked-list check-completeness-of-a-binary-tree