GitHub - Devanshii-git/leetcode: My (almost)daily leetcode grind

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 495 Commits
1-two-sum		1-two-sum
1001-n-repeated-element-in-size-2n-array		1001-n-repeated-element-in-size-2n-array
1018-largest-perimeter-triangle		1018-largest-perimeter-triangle
1047-maximize-sum-of-array-after-k-negations		1047-maximize-sum-of-array-after-k-negations
1054-complement-of-base-10-integer		1054-complement-of-base-10-integer
1062-partition-array-into-three-parts-with-equal-sum		1062-partition-array-into-three-parts-with-equal-sum
1071-binary-prefix-divisible-by-5		1071-binary-prefix-divisible-by-5
1079-sum-of-root-to-leaf-binary-numbers		1079-sum-of-root-to-leaf-binary-numbers
1086-divisor-game		1086-divisor-game
110-balanced-binary-tree		110-balanced-binary-tree
1111-minimum-score-triangulation-of-polygon		1111-minimum-score-triangulation-of-polygon
112-path-sum		112-path-sum
1127-last-stone-weight		1127-last-stone-weight
118-pascals-triangle		118-pascals-triangle
119-pascals-triangle-ii		119-pascals-triangle-ii
121-best-time-to-buy-and-sell-stock		121-best-time-to-buy-and-sell-stock
1236-n-th-tribonacci-number		1236-n-th-tribonacci-number
125-valid-palindrome		125-valid-palindrome
1284-four-divisors		1284-four-divisors
1285-balance-a-binary-search-tree		1285-balance-a-binary-search-tree
13-roman-to-integer		13-roman-to-integer
136-single-number		136-single-number
14-longest-common-prefix		14-longest-common-prefix
141-linked-list-cycle		141-linked-list-cycle
1445-number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold		1445-number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold
1476-count-negative-numbers-in-a-sorted-matrix		1476-count-negative-numbers-in-a-sorted-matrix
15-3sum		15-3sum
1516-the-k-th-lexicographical-string-of-all-happy-strings-of-length-n		1516-the-k-th-lexicographical-string-of-all-happy-strings-of-length-n
1520-number-of-steps-to-reduce-a-number-in-binary-representation-to-one		1520-number-of-steps-to-reduce-a-number-in-binary-representation-to-one
1557-check-if-a-string-contains-all-binary-codes-of-size-k		1557-check-if-a-string-contains-all-binary-codes-of-size-k
16-3sum-closest		16-3sum-closest
1630-count-odd-numbers-in-an-interval-range		1630-count-odd-numbers-in-an-interval-range
1642-water-bottles		1642-water-bottles
1658-minimum-swaps-to-arrange-a-binary-grid		1658-minimum-swaps-to-arrange-a-binary-grid
1663-detect-cycles-in-2d-grid		1663-detect-cycles-in-2d-grid
1667-find-kth-bit-in-nth-binary-string		1667-find-kth-bit-in-nth-binary-string
169-majority-element		169-majority-element
1704-special-positions-in-a-binary-matrix		1704-special-positions-in-a-binary-matrix
171-excel-sheet-column-number		171-excel-sheet-column-number
1716-maximum-non-negative-product-in-a-matrix		1716-maximum-non-negative-product-in-a-matrix
1756-minimum-deletions-to-make-string-balanced		1756-minimum-deletions-to-make-string-balanced
1764-maximum-repeating-substring		1764-maximum-repeating-substring
1800-concatenation-of-consecutive-binary-numbers		1800-concatenation-of-consecutive-binary-numbers
1807-partitioning-into-minimum-number-of-deci-binary-numbers		1807-partitioning-into-minimum-number-of-deci-binary-numbers
1817-calculate-money-in-leetcode-bank		1817-calculate-money-in-leetcode-bank
1845-largest-submatrix-with-rearrangements		1845-largest-submatrix-with-rearrangements
1884-minimum-changes-to-make-alternating-binary-string		1884-minimum-changes-to-make-alternating-binary-string
190-reverse-bits		190-reverse-bits
191-number-of-1-bits		191-number-of-1-bits
1910-check-if-binary-string-has-at-most-one-segment-of-ones		1910-check-if-binary-string-has-at-most-one-segment-of-ones
196-delete-duplicate-emails		196-delete-duplicate-emails
1972-rotating-the-box		1972-rotating-the-box
1984-maximum-distance-between-a-pair-of-values		1984-maximum-distance-between-a-pair-of-values
1990-get-biggest-three-rhombus-sums-in-a-grid		1990-get-biggest-three-rhombus-sums-in-a-grid
2-add-two-numbers		2-add-two-numbers
20-valid-parentheses		20-valid-parentheses
2015-determine-whether-matrix-can-be-obtained-by-rotation		2015-determine-whether-matrix-can-be-obtained-by-rotation
202-happy-number		202-happy-number
203-remove-linked-list-elements		203-remove-linked-list-elements
2037-count-square-sum-triples		2037-count-square-sum-triples
2043-cyclically-rotating-a-grid		2043-cyclically-rotating-a-grid
205-isomorphic-strings		205-isomorphic-strings
206-reverse-linked-list		206-reverse-linked-list
21-merge-two-sorted-lists		21-merge-two-sorted-lists
2107-find-unique-binary-string		2107-find-unique-binary-string
215-kth-largest-element-in-an-array		215-kth-largest-element-in-an-array
2160-minimum-operations-to-make-a-uni-value-grid		2160-minimum-operations-to-make-a-uni-value-grid
2178-walking-robot-simulation-ii		2178-walking-robot-simulation-ii
2197-decode-the-slanted-ciphertext		2197-decode-the-slanted-ciphertext
22-generate-parentheses		22-generate-parentheses
222-count-complete-tree-nodes		222-count-complete-tree-nodes
225-implement-stack-using-queues		225-implement-stack-using-queues
226-invert-binary-tree		226-invert-binary-tree
2274-keep-multiplying-found-values-by-two		2274-keep-multiplying-found-values-by-two
228-summary-ranges		228-summary-ranges
2288-count-operations-to-obtain-zero		2288-count-operations-to-obtain-zero
231-power-of-two		231-power-of-two
232-implement-queue-using-stacks		232-implement-queue-using-stacks
2346-largest-3-same-digit-number-in-string		2346-largest-3-same-digit-number-in-string
242-valid-anagram		242-valid-anagram
2429-design-a-food-rating-system		2429-design-a-food-rating-system
2550-words-within-two-edits-of-dictionary		2550-words-within-two-edits-of-dictionary
258-add-digits		258-add-digits
2598-shortest-distance-to-target-string-in-a-circular-array		2598-shortest-distance-to-target-string-in-a-circular-array
26-remove-duplicates-from-sorted-array		26-remove-duplicates-from-sorted-array
2639-separate-the-digits-in-an-array		2639-separate-the-digits-in-an-array
268-missing-number		268-missing-number
278-first-bad-version		278-first-bad-version
28-find-the-index-of-the-first-occurrence-in-a-string		28-find-the-index-of-the-first-occurrence-in-a-string
2855-maximum-number-of-jumps-to-reach-the-last-index		2855-maximum-number-of-jumps-to-reach-the-last-index
287-find-the-duplicate-number		287-find-the-duplicate-number
29-divide-two-integers		29-divide-two-integers
2978-check-if-strings-can-be-made-equal-with-operations-ii		2978-check-if-strings-can-be-made-equal-with-operations-ii
2999-check-if-strings-can-be-made-equal-with-operations-i		2999-check-if-strings-can-be-made-equal-with-operations-i
3-longest-substring-without-repeating-characters		3-longest-substring-without-repeating-characters
3031-construct-product-matrix		3031-construct-product-matrix
31-next-permutation		31-next-permutation
3215-matrix-similarity-after-cyclic-shifts		3215-matrix-similarity-after-cyclic-shifts
3251-maximum-area-of-longest-diagonal-rectangle		3251-maximum-area-of-longest-diagonal-rectangle
3263-divide-an-array-into-subarrays-with-minimum-cost-i		3263-divide-an-array-into-subarrays-with-minimum-cost-i