Algorithm

BFS

name	go	py	ts
1091.shortest-path-in-binary-matrix	✓	✓
127.word-ladder	✓	✓	✓
1368.minimum-cost-to-make-at-least-one-valid-path-in-a-grid		✓
199.binary-tree-right-side-view	✓
207.course-schedule	✓
286.walls-and-gates	✓
314.binary-tree-vertical-order-traversal	✓
314.binary-tree-vertical-order-traversal_v1	✓
5.longest-palindromic-substring	✓	✓
863.all-nodes-distance-k-in-binary-tree	✓	✓
934.shortest-bridge	✓	✓
958.check-completeness-of-a-binary-tree	✓
987.vertical-order-traversal-of-a-binary-tree	✓	✓

Backtracking

name	go	py	ts
17.letter-combinations-of-a-phone-number	✓	✓
39.combination-sum	✓	✓	✓
40.combination-sum-ii	✓	✓	✓
46.permutations	✓	✓	✓
47.permutations-ii	✓	✓	✓
78.subsets	✓	✓	✓
90.subsets-ii	✓	✓	✓

BinarySearch

name	go	py	ts
14.longest-common-prefix		✓
1539.kth-missing-positive-number		✓
162.find-peak-element	✓
1752.check-if-array-is-sorted-and-rotated		✓
3105.longest-strictly-increasing-or-strictly-decreasing-subarray		✓
33.search-in-rotated-sorted-array		✓
34.find-first-and-last-position-of-element-in-sorted-array	✓
81.search-in-rotated-sorted-array-ii		✓

DFS

name	go	py	ts
101.symmetric-tree	✓
104.maximum-depth-of-binary-tree	✓	✓
105.construct-binary-tree-from-preorder-and-inorder-traversal	✓	✓	✓
106.construct-binary-tree-from-inorder-and-postorder-traversal	✓
110.balanced-binary-tree	✓	✓	✓
1123.lowest-common-ancestor-of-deepest-leaves		✓
129.sum-root-to-leaf-numbers	✓	✓
133.clone-graph	✓	✓
139.word-break	✓
142.linked-list-cycle-ii	✓
1448.count-good-nodes-in-binary-tree	✓	✓	✓
1650.lowest-common-ancestor-of-a-binary-tree-iii	✓
206.reverse-linked-list			✓
21.merge-two-sorted-lists	✓	✓
22.generate-parentheses	✓	✓
23.merge-k-sorted-lists	✓	✓
235.lowest-common-ancestor-of-a-binary-search-tree	✓
236.lowest-common-ancestor-of-a-binary-tree	✓		✓
282.expression-add-operators	✓
301.remove-invalid-parentheses		✓	✓
329.longest-increasing-path-in-a-matrix	✓
339.nested-list-weight-sum	✓
426.convert-binary-search-tree-to-sorted-doubly-linked-list	✓
543.diameter-of-binary-tree	✓	✓	✓
572.subtree-of-another-tree	✓	✓	✓
695.max-area-of-island	✓
701.insert-into-a-binary-search-tree	✓	✓
79.word-search	✓	✓
827.making-a-large-island		✓
88.merge-sorted-array	✓
938.range-sum-of-bst	✓
958.check-completeness-of-a-binary-tree		✓
971.flip-binary-tree-to-match-preorder-traversal			✓
98.validate-binary-search-tree	✓	✓

DataStructure

name	go	py	ts
146.lru-cache	✓	✓
1570.dot-product-of-two-sparse-vectors	✓		✓
2326.spiral-matrix-iv		✓
380.insert-delete-getrandom-o1	✓	✓
432.all-oone-data-structure		✓
59.spiral-matrix-ii		✓
707.design-linked-list	✓	✓
973.k-closest-points-to-origin		✓

DynamicProgramming

name	go	py	ts
1143.longest-common-subsequence		✓
1312.minimum-insertion-steps-to-make-a-string-palindrome		✓
139.word-break		✓	✓
494.target-sum	✓	✓	✓
516.longest-palindromic-subsequence		✓
62.unique-paths		✓
63.unique-paths-ii		✓
72.edit-distance		✓

Graph

name	go	py	ts
48.rotate-image	✓
498.diagonal-traverse	✓	✓
827.making-a-large-island	✓

Greedy

name	go	py	ts
45.jump-game-ii		✓

Heap

name	go	py	ts
215.kth-largest-element-in-an-array	✓		✓
347.top-k-frequent-elements	✓
973.k-closest-points-to-origin	✓

PrefixSum

name	go	py	ts
238.product-of-array-except-self	✓	✓
523.continuous-subarray-sum	✓	✓
528.random-pick-with-weight		✓
560.subarray-sum-equals-k	✓	✓

Stack

name	go	py	ts
1047.remove-all-adjacent-duplicates-in-string		✓
155.min-stack	✓	✓
173.binary-search-tree-iterator	✓	✓
20.valid-parentheses	✓
239.sliding-window-maximum	✓	✓
394.decode-string	✓	✓
71.simplify-path	✓
739.daily-temperatures		✓
84.largest-rectangle-in-histogram	✓	✓
921.minimum-add-to-make-parentheses-valid	✓	✓

TwoPointer

name	go	py	ts
1.two-sum	✓	✓	✓
1004.max-consecutive-ones-iii	✓	✓
118.pascals-triangle		✓
121.best-time-to-buy-and-sell-stock	✓	✓
1249.minimum-remove-to-make-valid-parentheses	✓
125.valid-palindrome	✓	✓
128.longest-consecutive-sequence	✓	✓
13.roman-to-integer	✓
138.copy-list-with-random-pointer	✓	✓
14.longest-common-prefix	✓
1424.diagonal-traverse-ii	✓	✓
149.max-points-on-a-line		✓
15.3sum	✓	✓
1539.kth-missing-positive-number	✓
163.missing-ranges	✓
167.two-sum-ii-input-array-is-sorted		✓
169.majority-element	✓	✓	✓
1748.sum-of-unique-elements		✓
1768.merge-strings-alternately		✓
1790.check-if-one-string-swap-can-make-strings-equal		✓
19.remove-nth-node-from-end-of-list	✓	✓	✓
2.add-two-numbers	✓	✓	✓
20.valid-parentheses		✓
2013.detect-squares	✓	✓
209.minimum-size-subarray-sum		✓
2116.check-if-a-parentheses-string-can-be-valid	✓	✓
219.contains-duplicate-ii	✓	✓
227.basic-calculator-ii	✓	✓
242.valid-anagram		✓
249.group-shifted-strings	✓
26.remove-duplicates-from-sorted-array	✓	✓
268.missing-number		✓
270.closest-binary-search-tree-value	✓
28.find-the-index-of-the-first-occurrence-in-a-string	✓	✓
287.find-the-duplicate-number	✓	✓
3.longest-substring-without-repeating-characters	✓	✓
31.next-permutation	✓	✓
346.moving-average-from-data-stream	✓
38.count-and-say	✓	✓
393.utf-8-validation	✓	✓
398.random-pick-index	✓	✓
408.valid-word-abbreviation	✓
415.add-strings	✓	✓
424.longest-repeating-character-replacement	✓	✓
43.multiply-strings		✓
438.find-all-anagrams-in-a-string		✓
49.group-anagrams	✓	✓
528.random-pick-with-weight	✓
53.maximum-subarray	✓	✓
56.merge-intervals	✓	✓
567.permutation-in-string		✓
609.find-duplicate-file-in-system		✓
636.exclusive-time-of-functions		✓
643.maximum-average-subarray-i	✓	✓
647.palindromic-substrings		✓	✓
66.plus-one	✓	✓
670.maximum-swap	✓	✓
680.valid-palindrome-ii	✓	✓
7.reverse-integer	✓	✓
70.climbing-stairs		✓
71.simplify-path		✓
75.sort-colors	✓	✓
76.minimum-window-substring	✓	✓
766.toeplitz-matrix	✓	✓
791.custom-sort-string	✓	✓
8.string-to-integer-atoi	✓	✓
875.koko-eating-bananas		✓
88.merge-sorted-array		✓
9.palindrome-number	✓	✓
986.interval-list-intersections	✓	✓

UnionFind

name	go	py	ts
721.accounts-merge	✓