Name		Name	Last commit message	Last commit date
Latest commit History 1,278 Commits
0012-integer-to-roman		0012-integer-to-roman
0038-count-and-say		0038-count-and-say
0049-group-anagrams		0049-group-anagrams
0076-minimum-window-substring		0076-minimum-window-substring
0219-contains-duplicate-ii		0219-contains-duplicate-ii
0220-contains-duplicate-iii		0220-contains-duplicate-iii
0237-delete-node-in-a-linked-list		0237-delete-node-in-a-linked-list
0239-sliding-window-maximum		0239-sliding-window-maximum
0334-increasing-triplet-subsequence		0334-increasing-triplet-subsequence
0433-minimum-genetic-mutation		0433-minimum-genetic-mutation
0523-continuous-subarray-sum		0523-continuous-subarray-sum
0632-smallest-range-covering-elements-from-k-lists		0632-smallest-range-covering-elements-from-k-lists
0692-top-k-frequent-words		0692-top-k-frequent-words
0766-toeplitz-matrix		0766-toeplitz-matrix
0976-largest-perimeter-triangle		0976-largest-perimeter-triangle
1-two-sum		1-two-sum
10-regular-expression-matching		10-regular-expression-matching
102-binary-tree-level-order-traversal		102-binary-tree-level-order-traversal
1032-stream-of-characters		1032-stream-of-characters
1048-longest-string-chain		1048-longest-string-chain
105-construct-binary-tree-from-preorder-and-inorder-traversal		105-construct-binary-tree-from-preorder-and-inorder-traversal
1074-number-of-submatrices-that-sum-to-target		1074-number-of-submatrices-that-sum-to-target
108-convert-sorted-array-to-binary-search-tree		108-convert-sorted-array-to-binary-search-tree
1080-insufficient-nodes-in-root-to-leaf-paths		1080-insufficient-nodes-in-root-to-leaf-paths
1091-shortest-path-in-binary-matrix		1091-shortest-path-in-binary-matrix
113-path-sum-ii		113-path-sum-ii
1131-maximum-of-absolute-value-expression		1131-maximum-of-absolute-value-expression
114-flatten-binary-tree-to-linked-list		114-flatten-binary-tree-to-linked-list
1140-stone-game-ii		1140-stone-game-ii
1155-number-of-dice-rolls-with-target-sum		1155-number-of-dice-rolls-with-target-sum
1162-as-far-from-land-as-possible		1162-as-far-from-land-as-possible
117-populating-next-right-pointers-in-each-node-ii		117-populating-next-right-pointers-in-each-node-ii
118-pascals-triangle		118-pascals-triangle
1191-k-concatenation-maximum-sum		1191-k-concatenation-maximum-sum
1192-critical-connections-in-a-network		1192-critical-connections-in-a-network
120-triangle		120-triangle
1202-smallest-string-with-swaps		1202-smallest-string-with-swaps
1209-remove-all-adjacent-duplicates-in-string-ii		1209-remove-all-adjacent-duplicates-in-string-ii
121-best-time-to-buy-and-sell-stock		121-best-time-to-buy-and-sell-stock
1220-count-vowels-permutation		1220-count-vowels-permutation
1224-maximum-equal-frequency		1224-maximum-equal-frequency
123-best-time-to-buy-and-sell-stock-iii		123-best-time-to-buy-and-sell-stock-iii
1239-maximum-length-of-a-concatenated-string-with-unique-characters		1239-maximum-length-of-a-concatenated-string-with-unique-characters
1240-tiling-a-rectangle-with-the-fewest-squares		1240-tiling-a-rectangle-with-the-fewest-squares
126-word-ladder-ii		126-word-ladder-ii
1260-shift-2d-grid		1260-shift-2d-grid
1268-search-suggestions-system		1268-search-suggestions-system
1276-number-of-burgers-with-no-waste-of-ingredients		1276-number-of-burgers-with-no-waste-of-ingredients
128-longest-consecutive-sequence		128-longest-consecutive-sequence
129-sum-root-to-leaf-numbers		129-sum-root-to-leaf-numbers
1293-shortest-path-in-a-grid-with-obstacles-elimination		1293-shortest-path-in-a-grid-with-obstacles-elimination
1296-divide-array-in-sets-of-k-consecutive-numbers		1296-divide-array-in-sets-of-k-consecutive-numbers
1302-deepest-leaves-sum		1302-deepest-leaves-sum
1311-get-watched-videos-by-your-friends		1311-get-watched-videos-by-your-friends
1328-break-a-palindrome		1328-break-a-palindrome
1329-sort-the-matrix-diagonally		1329-sort-the-matrix-diagonally
1330-reverse-subarray-to-maximize-array-value		1330-reverse-subarray-to-maximize-array-value
1332-remove-palindromic-subsequences		1332-remove-palindromic-subsequences
1335-minimum-difficulty-of-a-job-schedule		1335-minimum-difficulty-of-a-job-schedule
1338-reduce-array-size-to-the-half		1338-reduce-array-size-to-the-half
1342-number-of-steps-to-reduce-a-number-to-zero		1342-number-of-steps-to-reduce-a-number-to-zero
135-candy		135-candy
1354-construct-target-array-with-multiple-sums		1354-construct-target-array-with-multiple-sums
1377-frog-position-after-t-seconds		1377-frog-position-after-t-seconds
1379-find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree		1379-find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree
1383-maximum-performance-of-a-team		1383-maximum-performance-of-a-team
1392-longest-happy-prefix		1392-longest-happy-prefix
1404-number-of-steps-to-reduce-a-number-in-binary-representation-to-one		1404-number-of-steps-to-reduce-a-number-in-binary-representation-to-one
1406-stone-game-iii		1406-stone-game-iii
1415-the-k-th-lexicographical-string-of-all-happy-strings-of-length-n		1415-the-k-th-lexicographical-string-of-all-happy-strings-of-length-n
1423-maximum-points-you-can-obtain-from-cards		1423-maximum-points-you-can-obtain-from-cards
1424-diagonal-traverse-ii		1424-diagonal-traverse-ii
1448-count-good-nodes-in-binary-tree		1448-count-good-nodes-in-binary-tree
1457-pseudo-palindromic-paths-in-a-binary-tree		1457-pseudo-palindromic-paths-in-a-binary-tree
1461-check-if-a-string-contains-all-binary-codes-of-size-k		1461-check-if-a-string-contains-all-binary-codes-of-size-k
1465-maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts		1465-maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts
1473-paint-house-iii		1473-paint-house-iii
148-sort-list		148-sort-list
1480-running-sum-of-1d-array		1480-running-sum-of-1d-array
1482-minimum-number-of-days-to-make-m-bouquets		1482-minimum-number-of-days-to-make-m-bouquets
1483-kth-ancestor-of-a-tree-node		1483-kth-ancestor-of-a-tree-node
1525-number-of-good-ways-to-split-a-string		1525-number-of-good-ways-to-split-a-string
1531-string-compression-ii		1531-string-compression-ii
1569-number-of-ways-to-reorder-array-to-get-same-bst		1569-number-of-ways-to-reorder-array-to-get-same-bst
1578-minimum-time-to-make-rope-colorful		1578-minimum-time-to-make-rope-colorful
1584-min-cost-to-connect-all-points		1584-min-cost-to-connect-all-points
1599-maximum-profit-of-operating-a-centennial-wheel		1599-maximum-profit-of-operating-a-centennial-wheel
16-3sum-closest		16-3sum-closest
160-intersection-of-two-linked-lists		160-intersection-of-two-linked-lists
162-find-peak-element		162-find-peak-element
1626-best-team-with-no-conflicts		1626-best-team-with-no-conflicts
1627-graph-connectivity-with-threshold		1627-graph-connectivity-with-threshold
1631-path-with-minimum-effort		1631-path-with-minimum-effort
1638-count-substrings-that-differ-by-one-character		1638-count-substrings-that-differ-by-one-character
164-maximum-gap		164-maximum-gap
1641-count-sorted-vowel-strings		1641-count-sorted-vowel-strings
1642-furthest-building-you-can-reach		1642-furthest-building-you-can-reach
1647-minimum-deletions-to-make-character-frequencies-unique		1647-minimum-deletions-to-make-character-frequencies-unique
1658-minimum-operations-to-reduce-x-to-zero		1658-minimum-operations-to-reduce-x-to-zero
1662-check-if-two-string-arrays-are-equivalent		1662-check-if-two-string-arrays-are-equivalent

Folders and files

Latest commit

History

Repository files navigation

All_Solutions of leetcode problem.

About

Resources

Stars

Watchers

Forks

Releases

Packages

Contributors

Languages