LeetCode Submissions

I use a Chrome extension to automatically push my LeetCode solutions to this repository. This extension makes it easy to keep my solutions organized and up-to-date on GitHub.
You can find the source code for this extension on LeetHub v3.

LeetCode Topics

Array


0539-minimum-time-difference

Math


0539-minimum-time-difference
2383-add-two-integers

String


0539-minimum-time-difference

Sorting


0539-minimum-time-difference

Name		Name	Last commit message	Last commit date
Latest commit History 348 Commits
0001-two-sum		0001-two-sum
0002-add-two-numbers		0002-add-two-numbers
0003-longest-substring-without-repeating-characters		0003-longest-substring-without-repeating-characters
0007-reverse-integer		0007-reverse-integer
0009-palindrome-number		0009-palindrome-number
0014-longest-common-prefix		0014-longest-common-prefix
0020-valid-parentheses		0020-valid-parentheses
0026-remove-duplicates-from-sorted-array		0026-remove-duplicates-from-sorted-array
0027-remove-element		0027-remove-element
0031-next-permutation		0031-next-permutation
0035-search-insert-position		0035-search-insert-position
0038-count-and-say		0038-count-and-say
0075-sort-colors		0075-sort-colors
0078-subsets		0078-subsets
0090-subsets-ii		0090-subsets-ii
0094-binary-tree-inorder-traversal		0094-binary-tree-inorder-traversal
0125-valid-palindrome		0125-valid-palindrome
0136-single-number		0136-single-number
0141-linked-list-cycle		0141-linked-list-cycle
0144-binary-tree-preorder-traversal		0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal		0145-binary-tree-postorder-traversal
0167-two-sum-ii-input-array-is-sorted		0167-two-sum-ii-input-array-is-sorted
0179-largest-number		0179-largest-number
0200-number-of-islands		0200-number-of-islands
0204-count-primes		0204-count-primes
0217-contains-duplicate		0217-contains-duplicate
0232-implement-queue-using-stacks		0232-implement-queue-using-stacks
0237-delete-node-in-a-linked-list		0237-delete-node-in-a-linked-list
0241-different-ways-to-add-parentheses		0241-different-ways-to-add-parentheses
0268-missing-number		0268-missing-number
0278-first-bad-version		0278-first-bad-version
0287-find-the-duplicate-number		0287-find-the-duplicate-number
0368-largest-divisible-subset		0368-largest-divisible-subset
0386-lexicographical-numbers		0386-lexicographical-numbers
0416-partition-equal-subset-sum		0416-partition-equal-subset-sum
0440-k-th-smallest-in-lexicographical-order		0440-k-th-smallest-in-lexicographical-order
0443-string-compression		0443-string-compression
0476-number-complement		0476-number-complement
0509-fibonacci-number		0509-fibonacci-number
0539-minimum-time-difference		0539-minimum-time-difference
0547-number-of-provinces		0547-number-of-provinces
0564-find-the-closest-palindrome		0564-find-the-closest-palindrome
0584-find-customer-referee		0584-find-customer-referee
0590-n-ary-tree-postorder-traversal		0590-n-ary-tree-postorder-traversal
0592-fraction-addition-and-subtraction		0592-fraction-addition-and-subtraction
0595-big-countries		0595-big-countries
0725-split-linked-list-in-parts		0725-split-linked-list-in-parts
0733-flood-fill		0733-flood-fill
0781-rabbits-in-forest		0781-rabbits-in-forest
0790-domino-and-tromino-tiling		0790-domino-and-tromino-tiling
0838-push-dominoes		0838-push-dominoes
0877-stone-game		0877-stone-game
0884-uncommon-words-from-two-sentences		0884-uncommon-words-from-two-sentences
0945-minimum-increment-to-make-array-unique		0945-minimum-increment-to-make-array-unique
0993-cousins-in-binary-tree		0993-cousins-in-binary-tree
1007-minimum-domino-rotations-for-equal-row		1007-minimum-domino-rotations-for-equal-row
1123-lowest-common-ancestor-of-deepest-leaves		1123-lowest-common-ancestor-of-deepest-leaves
1128-number-of-equivalent-domino-pairs		1128-number-of-equivalent-domino-pairs
1143-longest-common-subsequence		1143-longest-common-subsequence
1148-article-views-i		1148-article-views-i
1295-find-numbers-with-even-number-of-digits		1295-find-numbers-with-even-number-of-digits
1310-xor-queries-of-a-subarray		1310-xor-queries-of-a-subarray
1367-linked-list-in-binary-tree		1367-linked-list-in-binary-tree
1399-count-largest-group		1399-count-largest-group
1497-check-if-array-pairs-are-divisible-by-k		1497-check-if-array-pairs-are-divisible-by-k
1534-count-good-triplets		1534-count-good-triplets
1550-three-consecutive-odds		1550-three-consecutive-odds
1669-merge-in-between-linked-lists		1669-merge-in-between-linked-lists
1683-invalid-tweets		1683-invalid-tweets
1684-count-the-number-of-consistent-strings		1684-count-the-number-of-consistent-strings
1757-recyclable-and-low-fat-products		1757-recyclable-and-low-fat-products
1837-sum-of-digits-in-base-k		1837-sum-of-digits-in-base-k
1838-frequency-of-the-most-frequent-element		1838-frequency-of-the-most-frequent-element
1863-sum-of-all-subset-xor-totals		1863-sum-of-all-subset-xor-totals
1894-find-the-student-that-will-replace-the-chalk		1894-find-the-student-that-will-replace-the-chalk
1920-build-array-from-permutation		1920-build-array-from-permutation
1922-count-good-numbers		1922-count-good-numbers
1945-sum-of-digits-of-string-after-convert		1945-sum-of-digits-of-string-after-convert
1971-find-if-path-exists-in-graph		1971-find-if-path-exists-in-graph
1993-sum-of-all-subset-xor-totals		1993-sum-of-all-subset-xor-totals
2022-convert-1d-array-into-2d-array		2022-convert-1d-array-into-2d-array
2071-maximum-number-of-tasks-you-can-assign		2071-maximum-number-of-tasks-you-can-assign
2090-k-radius-subarray-averages		2090-k-radius-subarray-averages
2094-finding-3-digit-even-numbers		2094-finding-3-digit-even-numbers
2140-solving-questions-with-brainpower		2140-solving-questions-with-brainpower
2145-count-the-hidden-sequences		2145-count-the-hidden-sequences
2176-count-equal-and-divisible-pairs-in-an-array		2176-count-equal-and-divisible-pairs-in-an-array
2179-count-good-triplets-in-an-array		2179-count-good-triplets-in-an-array
2180-count-integers-with-even-digit-sum		2180-count-integers-with-even-digit-sum
2181-merge-nodes-in-between-zeros		2181-merge-nodes-in-between-zeros
2220-minimum-bit-flips-to-convert-number		2220-minimum-bit-flips-to-convert-number
2235-add-two-integers		2235-add-two-integers
2240-number-of-ways-to-buy-pens-and-pencils		2240-number-of-ways-to-buy-pens-and-pencils
2302-count-subarrays-with-score-less-than-k		2302-count-subarrays-with-score-less-than-k
2326-spiral-matrix-iv		2326-spiral-matrix-iv
2338-count-the-number-of-ideal-arrays		2338-count-the-number-of-ideal-arrays
2396-strictly-palindromic-number		2396-strictly-palindromic-number
2419-longest-subarray-with-maximum-bitwise-and		2419-longest-subarray-with-maximum-bitwise-and
2444-count-subarrays-with-fixed-bounds		2444-count-subarrays-with-fixed-bounds
2537-count-the-number-of-good-subarrays		2537-count-the-number-of-good-subarrays

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Uh oh!

Repository files navigation

LeetCode Submissions

LeetCode Topics

Array

Math

String

Sorting

About

Uh oh!

Releases

Packages

Languages

Ellvius/LeetCode

Folders and files

Latest commit

History

Repository files navigation

LeetCode Submissions

LeetCode Topics

Array

Math

String

Sorting

About

Resources

Uh oh!

Stars

Watchers

Forks

Releases

Packages 0

Languages

Packages