Skip to content
BranchesTags

Latest commit

 

History

724 Commits

Folders and files

NameName
Last commit message
Last commit date
.github/agents
.github/agents
 
 
100-same-tree
100-same-tree
 
 
1002-maximum-width-ramp
1002-maximum-width-ramp
 
 
1014-k-closest-points-to-origin
1014-k-closest-points-to-origin
 
 
102-binary-tree-level-order-traversal
102-binary-tree-level-order-traversal
 
 
103-binary-tree-zigzag-level-order-traversal
103-binary-tree-zigzag-level-order-traversal
 
 
1033-broken-calculator
1033-broken-calculator
 
 
1036-rotting-oranges
1036-rotting-oranges
 
 
1037-minimum-number-of-k-consecutive-bit-flips
1037-minimum-number-of-k-consecutive-bit-flips
 
 
104-maximum-depth-of-binary-tree
104-maximum-depth-of-binary-tree
 
 
1050-construct-binary-search-tree-from-preorder-traversal
1050-construct-binary-search-tree-from-preorder-traversal
 
 
111-minimum-depth-of-binary-tree
111-minimum-depth-of-binary-tree
 
 
1114-binary-search-tree-to-greater-sum-tree
1114-binary-search-tree-to-greater-sum-tree
 
 
1138-grumpy-bookstore-owner
1138-grumpy-bookstore-owner
 
 
1171-shortest-path-in-binary-matrix
1171-shortest-path-in-binary-matrix
 
 
118-pascals-triangle
118-pascals-triangle
 
 
1196-filling-bookcase-shelves
1196-filling-bookcase-shelves
 
 
1218-lowest-common-ancestor-of-deepest-leaves
1218-lowest-common-ancestor-of-deepest-leaves
 
 
122-best-time-to-buy-and-sell-stock-ii
122-best-time-to-buy-and-sell-stock-ii
 
 
123-best-time-to-buy-and-sell-stock-iii
123-best-time-to-buy-and-sell-stock-iii
 
 
1250-longest-common-subsequence
1250-longest-common-subsequence
 
 
1256-rank-transform-of-an-array
1256-rank-transform-of-an-array
 
 
1285-balance-a-binary-search-tree
1285-balance-a-binary-search-tree
 
 
1293-three-consecutive-odds
1293-three-consecutive-odds
 
 
1304-longest-happy-string
1304-longest-happy-string
 
 
1325-path-with-maximum-probability
1325-path-with-maximum-probability
 
 
1333-sort-the-jumbled-numbers
1333-sort-the-jumbled-numbers
 
 
137-single-number-ii
137-single-number-ii
 
 
1370-count-number-of-nice-subarrays
1370-count-number-of-nice-subarrays
 
 
1431-all-ancestors-of-a-node-in-a-directed-acyclic-graph
1431-all-ancestors-of-a-node-in-a-directed-acyclic-graph
 
 
1435-xor-queries-of-a-subarray
1435-xor-queries-of-a-subarray
 
 
144-binary-tree-preorder-traversal
144-binary-tree-preorder-traversal
 
 
145-binary-tree-postorder-traversal
145-binary-tree-postorder-traversal
 
 
1456-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance
1456-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance
 
 
1473-find-the-longest-substring-containing-vowels-in-even-counts
1473-find-the-longest-substring-containing-vowels-in-even-counts
 
 
1496-lucky-numbers-in-a-matrix
1496-lucky-numbers-in-a-matrix
 
 
1497-design-a-stack-with-increment-operation
1497-design-a-stack-with-increment-operation
 
 
1511-count-number-of-teams
1511-count-number-of-teams
 
 
1549-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit
1549-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit
 
 
155-min-stack
155-min-stack
 
 
1556-make-two-arrays-equal-by-reversing-subarrays
1556-make-two-arrays-equal-by-reversing-subarrays
 
 
1605-minimum-number-of-days-to-make-m-bouquets
1605-minimum-number-of-days-to-make-m-bouquets
 
 
1616-minimum-difference-between-largest-and-smallest-value-in-three-moves
1616-minimum-difference-between-largest-and-smallest-value-in-three-moves
 
 
1620-check-if-array-pairs-are-divisible-by-k
1620-check-if-array-pairs-are-divisible-by-k
 
 
1642-water-bottles
1642-water-bottles
 
 
1653-number-of-good-leaf-nodes-pairs
1653-number-of-good-leaf-nodes-pairs
 
 
1675-magnetic-force-between-two-balls
1675-magnetic-force-between-two-balls
 
 
1691-minimum-number-of-days-to-disconnect-island
1691-minimum-number-of-days-to-disconnect-island
 
 
1694-make-sum-divisible-by-p
1694-make-sum-divisible-by-p
 
 
1701-remove-max-number-of-edges-to-keep-graph-fully-traversable
1701-remove-max-number-of-edges-to-keep-graph-fully-traversable
 
 
1711-find-valid-matrix-given-row-and-column-sums
1711-find-valid-matrix-given-row-and-column-sums
 
 
1720-crawler-log-folder
1720-crawler-log-folder
 
 
1741-sort-array-by-increasing-frequency
1741-sort-array-by-increasing-frequency
 
 
1753-path-with-minimum-effort
1753-path-with-minimum-effort
 
 
1786-count-the-number-of-consistent-strings
1786-count-the-number-of-consistent-strings
 
 
179-largest-number
179-largest-number
 
 
1803-average-waiting-time
1803-average-waiting-time
 
 
1818-maximum-score-from-removing-substrings
1818-maximum-score-from-removing-substrings
 
 
188-best-time-to-buy-and-sell-stock-iv
188-best-time-to-buy-and-sell-stock-iv
 
 
19-remove-nth-node-from-end-of-list
19-remove-nth-node-from-end-of-list
 
 
1923-sentence-similarity-iii
1923-sentence-similarity-iii
 
 
1951-find-the-winner-of-the-circular-game
1951-find-the-winner-of-the-circular-game
 
 
198-house-robber
198-house-robber
 
 
1993-sum-of-all-subset-xor-totals
1993-sum-of-all-subset-xor-totals
 
 
2-add-two-numbers
2-add-two-numbers
 
 
20-valid-parentheses
20-valid-parentheses
 
 
200-number-of-islands
200-number-of-islands
 
 
2006-find-the-student-that-will-replace-the-chalk
2006-find-the-student-that-will-replace-the-chalk
 
 
2035-count-sub-islands
2035-count-sub-islands
 
 
205-isomorphic-strings
205-isomorphic-strings
 
 
2050-count-good-numbers
2050-count-good-numbers
 
 
2054-the-number-of-the-smallest-unoccupied-chair
2054-the-number-of-the-smallest-unoccupied-chair
 
 
206-reverse-linked-list
206-reverse-linked-list
 
 
207-course-schedule
207-course-schedule
 
 
2076-sum-of-digits-of-string-after-convert
2076-sum-of-digits-of-string-after-convert
 
 
2094-remove-stones-to-minimize-the-total
2094-remove-stones-to-minimize-the-total
 
 
2095-minimum-number-of-swaps-to-make-the-string-balanced
2095-minimum-number-of-swaps-to-make-the-string-balanced
 
 
210-course-schedule-ii
210-course-schedule-ii
 
 
2106-find-greatest-common-divisor-of-array
2106-find-greatest-common-divisor-of-array
 
 
213-house-robber-ii
213-house-robber-ii
 
 
2132-convert-1d-array-into-2d-array
2132-convert-1d-array-into-2d-array
 
 
214-shortest-palindrome
214-shortest-palindrome
 
 
215-kth-largest-element-in-an-array
215-kth-largest-element-in-an-array
 
 
2155-find-missing-observations
2155-find-missing-observations
 
 
2163-kth-distinct-string-in-an-array
2163-kth-distinct-string-in-an-array
 
 
2170-count-number-of-maximum-bitwise-or-subsets
2170-count-number-of-maximum-bitwise-or-subsets
 
 
2171-second-minimum-time-to-reach-destination
2171-second-minimum-time-to-reach-destination
 
 
2182-find-the-minimum-and-maximum-number-of-nodes-between-critical-points
2182-find-the-minimum-and-maximum-number-of-nodes-between-critical-points
 
 
2255-minimum-swaps-to-group-all-1s-together-ii
2255-minimum-swaps-to-group-all-1s-together-ii
 
 
2299-merge-nodes-in-between-zeros
2299-merge-nodes-in-between-zeros
 
 
230-kth-smallest-element-in-a-bst
230-kth-smallest-element-in-a-bst
 
 
2306-create-binary-tree-from-descriptions
2306-create-binary-tree-from-descriptions
 
 
2323-minimum-bit-flips-to-convert-number
2323-minimum-bit-flips-to-convert-number
 
 
234-palindrome-linked-list
234-palindrome-linked-list
 
 
235-lowest-common-ancestor-of-a-binary-search-tree
235-lowest-common-ancestor-of-a-binary-search-tree
 
 
2379-maximum-total-importance-of-roads
2379-maximum-total-importance-of-roads
 
 
241-different-ways-to-add-parentheses
241-different-ways-to-add-parentheses
 
 
2411-spiral-matrix-iv
2411-spiral-matrix-iv
 
 
242-valid-anagram
242-valid-anagram
 
 
2488-divide-intervals-into-minimum-number-of-groups
2488-divide-intervals-into-minimum-number-of-groups
 
 

About

This REPO contains solution for all the solved question on Leetcode , gfg , codeforces etc.

Activity

Stars

1 star

Watchers

1 watching

Forks

0 forks
Report repository

Releases

Packages

Contributors

Languages