LeetCode Solutions 💻🚀

This repository contains solutions to various LeetCode problems, implemented in multiple programming languages. It serves as a personal coding journal and a reference for others preparing for coding interviews.

📌 Repository Structure

The solutions are organized by difficulty levels and topics.

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Repository files navigation

LeetCode Solutions 💻🚀

📌 Repository Structure

About

Uh oh!

Releases

Packages

Uh oh!

Uh oh!

Contributors

Uh oh!

Languages

Name		Name	Last commit message	Last commit date
Latest commit History 326 Commits
1036-rotting-oranges		1036-rotting-oranges
1046-max-consecutive-ones-iii		1046-max-consecutive-ones-iii
1049-minimum-domino-rotations-for-equal-row		1049-minimum-domino-rotations-for-equal-row
1056-capacity-to-ship-packages-within-d-days		1056-capacity-to-ship-packages-within-d-days
1058-lexicographically-smallest-equivalent-string		1058-lexicographically-smallest-equivalent-string
1078-remove-outermost-parentheses		1078-remove-outermost-parentheses
1218-lowest-common-ancestor-of-deepest-leaves		1218-lowest-common-ancestor-of-deepest-leaves
1227-number-of-equivalent-domino-pairs		1227-number-of-equivalent-domino-pairs
125-valid-palindrome		125-valid-palindrome
1293-three-consecutive-odds		1293-three-consecutive-odds
13-roman-to-integer		13-roman-to-integer
1319-unique-number-of-occurrences		1319-unique-number-of-occurrences
135-candy		135-candy
1354-find-players-with-zero-or-one-losses		1354-find-players-with-zero-or-one-losses
1370-count-number-of-nice-subarrays		1370-count-number-of-nice-subarrays
138-copy-list-with-random-pointer		138-copy-list-with-random-pointer
14-longest-common-prefix		14-longest-common-prefix
1402-count-square-submatrices-with-all-ones		1402-count-square-submatrices-with-all-ones
141-linked-list-cycle		141-linked-list-cycle
142-linked-list-cycle-ii		142-linked-list-cycle-ii
1421-find-numbers-with-even-number-of-digits		1421-find-numbers-with-even-number-of-digits
1424-maximum-candies-you-can-get-from-boxes		1424-maximum-candies-you-can-get-from-boxes
1448-maximum-69-number		1448-maximum-69-number
146-lru-cache		146-lru-cache
1460-number-of-substrings-containing-all-three-characters		1460-number-of-substrings-containing-all-three-characters
1465-maximum-product-of-splitted-binary-tree		1465-maximum-product-of-splitted-binary-tree
1500-count-largest-group		1500-count-largest-group
151-reverse-words-in-a-string		151-reverse-words-in-a-string
1529-max-difference-you-can-get-from-changing-an-integer		1529-max-difference-you-can-get-from-changing-an-integer
153-find-minimum-in-rotated-sorted-array		153-find-minimum-in-rotated-sorted-array
155-min-stack		155-min-stack
1605-minimum-number-of-days-to-make-m-bouquets		1605-minimum-number-of-days-to-make-m-bouquets
162-find-peak-element		162-find-peak-element
1646-kth-missing-positive-number		1646-kth-missing-positive-number
1656-count-good-triplets		1656-count-good-triplets
1737-maximum-nesting-depth-of-the-parentheses		1737-maximum-nesting-depth-of-the-parentheses
189-rotate-array		189-rotate-array
1908-recyclable-and-low-fat-products		1908-recyclable-and-low-fat-products
198-house-robber		198-house-robber
1986-largest-color-value-in-a-directed-graph		1986-largest-color-value-in-a-directed-graph
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
2032-largest-odd-number-in-string		2032-largest-odd-number-in-string
2048-build-array-from-permutation		2048-build-array-from-permutation
2050-count-good-numbers		2050-count-good-numbers
206-reverse-linked-list		206-reverse-linked-list
2061-painting-a-grid-with-three-different-colors		2061-painting-a-grid-with-three-different-colors
21-merge-two-sorted-lists		21-merge-two-sorted-lists
2106-find-greatest-common-divisor-of-array		2106-find-greatest-common-divisor-of-array
2121-find-if-path-exists-in-graph		2121-find-if-path-exists-in-graph
213-house-robber-ii		213-house-robber-ii
2144-maximum-difference-between-increasing-elements		2144-maximum-difference-between-increasing-elements
2180-maximum-number-of-tasks-you-can-assign		2180-maximum-number-of-tasks-you-can-assign
2215-finding-3-digit-even-numbers		2215-finding-3-digit-even-numbers
2237-longest-palindrome-by-concatenating-two-letter-words		2237-longest-palindrome-by-concatenating-two-letter-words
2249-count-the-hidden-sequences		2249-count-the-hidden-sequences
2277-count-equal-and-divisible-pairs-in-an-array		2277-count-equal-and-divisible-pairs-in-an-array
2280-count-good-triplets-in-an-array		2280-count-good-triplets-in-an-array
2294-minimum-time-to-complete-trips		2294-minimum-time-to-complete-trips
232-implement-queue-using-stacks		232-implement-queue-using-stacks
2394-count-subarrays-with-score-less-than-k		2394-count-subarrays-with-score-less-than-k
2415-count-the-number-of-ideal-arrays		2415-count-the-number-of-ideal-arrays
242-valid-anagram		242-valid-anagram
2438-find-closest-node-to-given-two-nodes		2438-find-closest-node-to-given-two-nodes
2527-count-subarrays-with-fixed-bounds		2527-count-subarrays-with-fixed-bounds
2626-count-the-number-of-good-subarrays		2626-count-the-number-of-good-subarrays
2699-count-the-number-of-fair-pairs		2699-count-the-number-of-fair-pairs
2704-maximum-difference-by-remapping-a-digit		2704-maximum-difference-by-remapping-a-digit
2720-minimize-the-maximum-difference-of-pairs		2720-minimize-the-maximum-difference-of-pairs
2793-count-the-number-of-complete-components		2793-count-the-number-of-complete-components
2856-count-complete-subarrays-in-an-array		2856-count-complete-subarrays-in-an-array
2915-count-of-interesting-subarrays		2915-count-of-interesting-subarrays
3-longest-substring-without-repeating-characters		3-longest-substring-without-repeating-characters
3142-longest-unequal-adjacent-groups-subsequence-ii		3142-longest-unequal-adjacent-groups-subsequence-ii
3143-longest-unequal-adjacent-groups-subsequence-i		3143-longest-unequal-adjacent-groups-subsequence-i
3171-minimum-equal-sum-of-two-arrays-after-replacing-zeros		3171-minimum-equal-sum-of-two-arrays-after-replacing-zeros
3172-divisible-and-non-divisible-sums-difference		3172-divisible-and-non-divisible-sums-difference
3201-distribute-candies-among-children-ii		3201-distribute-candies-among-children-ii
3213-count-subarrays-where-max-element-appears-at-least-k-times		3213-count-subarrays-where-max-element-appears-at-least-k-times
3243-count-the-number-of-powerful-integers		3243-count-the-number-of-powerful-integers
33-search-in-rotated-sorted-array		33-search-in-rotated-sorted-array
3307-find-the-maximum-sum-of-node-values		3307-find-the-maximum-sum-of-node-values
3321-type-of-triangle		3321-type-of-triangle
34-find-first-and-last-position-of-element-in-sorted-array		34-find-first-and-last-position-of-element-in-sorted-array
344-reverse-string		344-reverse-string
3445-lexicographically-minimum-string-after-removing-stars		3445-lexicographically-minimum-string-after-removing-stars
3548-find-the-count-of-good-integers		3548-find-the-count-of-good-integers
3621-minimum-operations-to-make-array-values-equal-to-k		3621-minimum-operations-to-make-array-values-equal-to-k
3627-find-minimum-time-to-reach-last-room-i		3627-find-minimum-time-to-reach-last-room-i
3628-find-minimum-time-to-reach-last-room-ii		3628-find-minimum-time-to-reach-last-room-ii
3629-total-characters-in-string-after-transformations-i		3629-total-characters-in-string-after-transformations-i
3630-total-characters-in-string-after-transformations-ii		3630-total-characters-in-string-after-transformations-ii
3633-maximize-the-number-of-target-nodes-after-connecting-trees-i		3633-maximize-the-number-of-target-nodes-after-connecting-trees-i
3637-count-number-of-balanced-permutations		3637-count-number-of-balanced-permutations
3639-zero-array-transformation-i		3639-zero-array-transformation-i
3645-maximize-the-number-of-target-nodes-after-connecting-trees-ii		3645-maximize-the-number-of-target-nodes-after-connecting-trees-ii
3647-zero-array-transformation-iii		3647-zero-array-transformation-iii
3656-minimum-number-of-operations-to-make-elements-in-array-distinct		3656-minimum-number-of-operations-to-make-elements-in-array-distinct
368-largest-divisible-subset		368-largest-divisible-subset

Folders and files

Latest commit

History

Repository files navigation

LeetCode Solutions 💻🚀

📌 Repository Structure

About

Resources

Uh oh!

Stars

Watchers

Forks

Releases

Packages 0

Uh oh!

Uh oh!

Contributors

Uh oh!

Languages

Packages