GitHub - Gopi-27/LeetCode: My solutions to LeetCode problems

Repository navigation

LeetCode

Public

About

My solutions to LeetCode problems

arrays-and-strings binary-search binary-tree dynamic-programming segment-tree sliding-windows sortings two-pointers

Activity

0 stars

1 watching

Name		Name	Last commit message	Last commit date
Sorry, we had to truncate this directory to 1,000 files. 130 entries were omitted from the list.
0000-0-3456-find-special-substring-of-length-k		0000-0-3456-find-special-substring-of-length-k
0000-0-3512-minimum-operations-to-make-array-sum-divisible-by-k		0000-0-3512-minimum-operations-to-make-array-sum-divisible-by-k
0001-can-make-arithmetic-progression-from-sequence		0001-can-make-arithmetic-progression-from-sequence
0001-set-mismatch		0001-set-mismatch
0002-1-3522-calculate-score-after-performing-instructions		0002-1-3522-calculate-score-after-performing-instructions
0002-daily-temperatures		0002-daily-temperatures
0002-how-many-numbers-are-smaller-than-the-current-number		0002-how-many-numbers-are-smaller-than-the-current-number
0003-0-3467-transform-array-by-parity		0003-0-3467-transform-array-by-parity
0003-consecutive-numbers		0003-consecutive-numbers
0003-longest-substring-without-repeating-characters		0003-longest-substring-without-repeating-characters
0004-0-3487-maximum-unique-subarray-sum-after-deletion		0004-0-3487-maximum-unique-subarray-sum-after-deletion
0004-movie-rating		0004-movie-rating
0005-0-3468-find-the-number-of-copy-arrays		0005-0-3468-find-the-number-of-copy-arrays
0006-zigzag-conversion		0006-zigzag-conversion
0007-1-3498-reverse-degree-of-a-string		0007-1-3498-reverse-degree-of-a-string
0007-reverse-integer		0007-reverse-integer
0008-0-3516-find-closest-person		0008-0-3516-find-closest-person
0011-container-with-most-water		0011-container-with-most-water
0012-0-3461-check-if-digits-are-equal-in-string-after-operations-i		0012-0-3461-check-if-digits-are-equal-in-string-after-operations-i
0012-2-3452-sum-of-good-numbers		0012-2-3452-sum-of-good-numbers
0015-2-3545-minimum-deletions-for-at-most-k-distinct-characters		0015-2-3545-minimum-deletions-for-at-most-k-distinct-characters
0017-1-3561-resulting-string-after-adjacent-removals		0017-1-3561-resulting-string-after-adjacent-removals
0017-letter-combinations-of-a-phone-number		0017-letter-combinations-of-a-phone-number
0019-remove-nth-node-from-end-of-list		0019-remove-nth-node-from-end-of-list
0020-valid-parentheses		0020-valid-parentheses
0021-5-3471-find-the-largest-almost-missing-integer		0021-5-3471-find-the-largest-almost-missing-integer
0022-generate-parentheses		0022-generate-parentheses
0024-swap-nodes-in-pairs		0024-swap-nodes-in-pairs
0025-reverse-nodes-in-k-group		0025-reverse-nodes-in-k-group
0026-remove-duplicates-from-sorted-array		0026-remove-duplicates-from-sorted-array
0029-2-3546-equal-sum-grid-partition-i		0029-2-3546-equal-sum-grid-partition-i
0036-valid-sudoku		0036-valid-sudoku
0040-6-3492-maximum-containers-on-a-ship		0040-6-3492-maximum-containers-on-a-ship
0041-first-missing-positive		0041-first-missing-positive
0045-jump-game-ii		0045-jump-game-ii
0048-rotate-image		0048-rotate-image
0049-group-anagrams		0049-group-anagrams
0051-n-queens		0051-n-queens
0053-8-3392-count-subarrays-of-length-three-with-a-condition		0053-8-3392-count-subarrays-of-length-three-with-a-condition
0053-maximum-subarray		0053-maximum-subarray
0054-spiral-matrix		0054-spiral-matrix
0055-jump-game		0055-jump-game
0056-4-3402-minimum-operations-to-make-columns-strictly-increasing		0056-4-3402-minimum-operations-to-make-columns-strictly-increasing
0057-7-3438-find-valid-pair-of-adjacent-digits-in-string		0057-7-3438-find-valid-pair-of-adjacent-digits-in-string
0057-insert-interval		0057-insert-interval
0058-20-3442-maximum-difference-between-even-and-odd-frequency-i		0058-20-3442-maximum-difference-between-even-and-odd-frequency-i
0059-spiral-matrix-ii		0059-spiral-matrix-ii
0061-rotate-list		0061-rotate-list
0062-unique-paths		0062-unique-paths
0063-unique-paths-ii		0063-unique-paths-ii
0064-minimum-path-sum		0064-minimum-path-sum
0066-plus-one		0066-plus-one
0067-19-3427-sum-of-variable-length-subarrays		0067-19-3427-sum-of-variable-length-subarrays
0067-add-binary		0067-add-binary
0068-2-3300-minimum-element-after-replacement-with-digit-sum		0068-2-3300-minimum-element-after-replacement-with-digit-sum
0071-6-3330-find-the-original-typed-string-i		0071-6-3330-find-the-original-typed-string-i
0072-edit-distance		0072-edit-distance
0074-search-a-2d-matrix		0074-search-a-2d-matrix
0077-34-3285-find-indices-of-stable-mountains		0077-34-3285-find-indices-of-stable-mountains
0077-combinations		0077-combinations
0082-remove-duplicates-from-sorted-list-ii		0082-remove-duplicates-from-sorted-list-ii
0086-partition-list		0086-partition-list
0091-0-3340-check-balanced-string		0091-0-3340-check-balanced-string
0092-reverse-linked-list-ii		0092-reverse-linked-list-ii
0096-unique-binary-search-trees		0096-unique-binary-search-trees
0097-interleaving-string		0097-interleaving-string
0098-validate-binary-search-tree		0098-validate-binary-search-tree
0100-same-tree		0100-same-tree
0101-symmetric-tree		0101-symmetric-tree
0103-binary-tree-zigzag-level-order-traversal		0103-binary-tree-zigzag-level-order-traversal
0104-maximum-depth-of-binary-tree		0104-maximum-depth-of-binary-tree
0105-construct-binary-tree-from-preorder-and-inorder-traversal		0105-construct-binary-tree-from-preorder-and-inorder-traversal
0106-construct-binary-tree-from-inorder-and-postorder-traversal		0106-construct-binary-tree-from-inorder-and-postorder-traversal
0108-convert-sorted-array-to-binary-search-tree		0108-convert-sorted-array-to-binary-search-tree
0110-balanced-binary-tree		0110-balanced-binary-tree
0111-minimum-depth-of-binary-tree		0111-minimum-depth-of-binary-tree
0112-path-sum		0112-path-sum
0113-path-sum-ii		0113-path-sum-ii
0114-flatten-binary-tree-to-linked-list		0114-flatten-binary-tree-to-linked-list
0115-distinct-subsequences		0115-distinct-subsequences
0116-populating-next-right-pointers-in-each-node		0116-populating-next-right-pointers-in-each-node
0117-19-3024-type-of-triangle		0117-19-3024-type-of-triangle
0117-9-2980-check-if-bitwise-or-has-trailing-zeros		0117-9-2980-check-if-bitwise-or-has-trailing-zeros
0117-populating-next-right-pointers-in-each-node-ii		0117-populating-next-right-pointers-in-each-node-ii
0118-9-3074-apple-redistribution-into-boxes		0118-9-3074-apple-redistribution-into-boxes
0118-pascals-triangle		0118-pascals-triangle
0119-111-3136-valid-word		0119-111-3136-valid-word
0119-5-3274-check-if-two-chessboard-squares-have-the-same-color		0119-5-3274-check-if-two-chessboard-squares-have-the-same-color
0120-triangle		0120-triangle
0122-7-3280-convert-date-to-binary		0122-7-3280-convert-date-to-binary
0124-binary-tree-maximum-path-sum		0124-binary-tree-maximum-path-sum
0129-sum-root-to-leaf-numbers		0129-sum-root-to-leaf-numbers
0131-14-3019-number-of-changing-keys		0131-14-3019-number-of-changing-keys
0131-15-3065-minimum-operations-to-exceed-threshold-value-i		0131-15-3065-minimum-operations-to-exceed-threshold-value-i
0132-12-3168-minimum-number-of-chairs-in-a-waiting-room		0132-12-3168-minimum-number-of-chairs-in-a-waiting-room
0133-14-3162-find-the-number-of-good-pairs-i		0133-14-3162-find-the-number-of-good-pairs-i
0133-clone-graph		0133-clone-graph
0136-13-3158-find-the-xor-of-numbers-which-appear-twice		0136-13-3158-find-the-xor-of-numbers-which-appear-twice
0136-8-3232-find-if-digit-game-can-be-won		0136-8-3232-find-if-digit-game-can-be-won
0136-single-number		0136-single-number

About

My solutions to LeetCode problems

arrays-and-strings binary-search binary-tree dynamic-programming segment-tree sliding-windows sortings two-pointers

Activity

0 stars

1 watching

0 forks

Report repository

Navigation Menu

Repository navigation

About

About

Releases

Packages

Contributors

Languages

Latest commit

History

Folders and files

About

Topics

Stars

Watchers

Forks

Releases

Packages

Contributors

Languages