LeetCode Topics

#	Problem	Platform	Difficulty	Date Solved	Time
391	Deepest Leaves Sum	LeetCode	Medium	11 Aug 2026	12:36 am

LeetCode Topics

Array

Problem Name	Difficulty
0001-two-sum	Easy
0014-longest-common-prefix	Easy
0049-group-anagrams	Medium
0128-longest-consecutive-sequence	Medium
0219-contains-duplicate-ii	Easy
0410-split-array-largest-sum	Hard
0496-next-greater-element-i	Easy
0654-maximum-binary-tree	Medium
0739-daily-temperatures	Medium
0929-unique-email-addresses	Easy
1004-max-consecutive-ones-iii	Medium
1008-construct-binary-search-tree-from-preorder-traversal	Medium
1310-xor-queries-of-a-subarray	Medium
1386-cinema-seat-allocation	Medium
1441-build-an-array-with-stack-operations	Medium
1472-design-browser-history	Medium
1475-final-prices-with-a-special-discount-in-a-shop	Easy
1563-stone-game-v	Hard
1829-maximum-xor-for-each-query	Medium
2213-longest-substring-of-one-repeating-character	Hard
2395-find-subarrays-with-equal-sum	Easy
2657-find-the-prefix-common-array-of-two-arrays	Medium
2824-count-pairs-whose-sum-is-less-than-target	Easy
2958-length-of-longest-subarray-with-at-most-k-frequency	Medium
2974-minimum-number-game	Easy
2996-smallest-missing-integer-greater-than-sequential-prefix-sum	Easy
3069-distribute-elements-into-two-arrays-i	Easy
3116-kth-smallest-amount-with-single-denomination-combination	Hard
3432-count-partitions-with-even-sum-difference	Easy
3471-find-the-largest-almost-missing-integer	Easy
3702-longest-subsequence-with-non-zero-bitwise-xor	Medium
3737-count-subarrays-with-majority-element-i	Medium

Bit Manipulation

Problem Name	Difficulty
1310-xor-queries-of-a-subarray	Medium
1386-cinema-seat-allocation	Medium
1829-maximum-xor-for-each-query	Medium
2657-find-the-prefix-common-array-of-two-arrays	Medium
3116-kth-smallest-amount-with-single-denomination-combination	Hard
3702-longest-subsequence-with-non-zero-bitwise-xor	Medium

Prefix Sum

Problem Name	Difficulty
0410-split-array-largest-sum	Hard
1004-max-consecutive-ones-iii	Medium
1310-xor-queries-of-a-subarray	Medium
1829-maximum-xor-for-each-query	Medium
3432-count-partitions-with-even-sum-difference	Easy
3737-count-subarrays-with-majority-element-i	Medium

Hash Table

Problem Name	Difficulty
0001-two-sum	Easy
0003-longest-substring-without-repeating-characters	Medium
0049-group-anagrams	Medium
0128-longest-consecutive-sequence	Medium
0141-linked-list-cycle	Easy
0205-isomorphic-strings	Easy
0219-contains-duplicate-ii	Easy
0290-word-pattern	Easy
0383-ransom-note	Easy
0496-next-greater-element-i	Easy
0929-unique-email-addresses	Easy
1386-cinema-seat-allocation	Medium
2395-find-subarrays-with-equal-sum	Easy
2657-find-the-prefix-common-array-of-two-arrays	Medium
2958-length-of-longest-subarray-with-at-most-k-frequency	Medium
2996-smallest-missing-integer-greater-than-sequential-prefix-sum	Easy
3090-maximum-length-substring-with-two-occurrences	Easy
3471-find-the-largest-almost-missing-integer	Easy
3692-majority-frequency-characters	Easy
3737-count-subarrays-with-majority-element-i	Medium
3945-digit-frequency-score	Easy

Sorting

Problem Name	Difficulty
0049-group-anagrams	Medium
2824-count-pairs-whose-sum-is-less-than-target	Easy
2974-minimum-number-game	Easy
2996-smallest-missing-integer-greater-than-sequential-prefix-sum	Easy

Divide and Conquer

Problem Name	Difficulty
0654-maximum-binary-tree	Medium
3737-count-subarrays-with-majority-element-i	Medium

Stack

Problem Name	Difficulty
0020-valid-parentheses	Easy
0155-min-stack	Medium
0225-implement-stack-using-queues	Easy
0496-next-greater-element-i	Easy
0654-maximum-binary-tree	Medium
0739-daily-temperatures	Medium
0901-online-stock-span	Medium
1008-construct-binary-search-tree-from-preorder-traversal	Medium
1021-remove-outermost-parentheses	Easy
1441-build-an-array-with-stack-operations	Medium
1472-design-browser-history	Medium
1475-final-prices-with-a-special-discount-in-a-shop	Easy

Tree

Problem Name	Difficulty
0654-maximum-binary-tree	Medium
1008-construct-binary-search-tree-from-preorder-traversal	Medium

Monotonic Stack

Problem Name	Difficulty
0496-next-greater-element-i	Easy
0654-maximum-binary-tree	Medium
0739-daily-temperatures	Medium
0901-online-stock-span	Medium
1008-construct-binary-search-tree-from-preorder-traversal	Medium
1475-final-prices-with-a-special-discount-in-a-shop	Easy

Binary Tree

Problem Name	Difficulty
0654-maximum-binary-tree	Medium
1008-construct-binary-search-tree-from-preorder-traversal	Medium

Cartesian Tree

Problem Name	Difficulty
0654-maximum-binary-tree	Medium

Binary Search Tree

Problem Name	Difficulty
0410-split-array-largest-sum	Hard
1004-max-consecutive-ones-iii	Medium
1008-construct-binary-search-tree-from-preorder-traversal	Medium
2824-count-pairs-whose-sum-is-less-than-target	Easy
3116-kth-smallest-amount-with-single-denomination-combination	Hard

Sliding Window

Problem Name	Difficulty
0003-longest-substring-without-repeating-characters	Medium
0219-contains-duplicate-ii	Easy
1004-max-consecutive-ones-iii	Medium
2958-length-of-longest-subarray-with-at-most-k-frequency	Medium
3090-maximum-length-substring-with-two-occurrences	Easy

Database

Problem Name	Difficulty
0176-second-highest-salary	Medium
1517-find-users-with-valid-e-mails	Easy
1795-rearrange-products-table	Easy
3220-odd-and-even-transactions	Medium
3475-dna-pattern-recognition	Medium

Design

Problem Name	Difficulty
0155-min-stack	Medium
0225-implement-stack-using-queues	Easy
0901-online-stock-span	Medium
1472-design-browser-history	Medium

Data Stream

Problem Name	Difficulty
0901-online-stock-span	Medium
1472-design-browser-history	Medium

String

Problem Name	Difficulty
0003-longest-substring-without-repeating-characters	Medium
0014-longest-common-prefix	Easy
0020-valid-parentheses	Easy
0049-group-anagrams	Medium
0205-isomorphic-strings	Easy
0290-word-pattern	Easy
0383-ransom-note	Easy
0680-valid-palindrome-ii	Easy
0929-unique-email-addresses	Easy
1021-remove-outermost-parentheses	Easy
2213-longest-substring-of-one-repeating-character	Hard
2810-faulty-keyboard	Easy
3090-maximum-length-substring-with-two-occurrences	Easy
3330-find-the-original-typed-string-i	Easy
3692-majority-frequency-characters	Easy

Segment Tree

Problem Name	Difficulty
2213-longest-substring-of-one-repeating-character	Hard
3737-count-subarrays-with-majority-element-i	Medium

Ordered Set

Problem Name	Difficulty
2213-longest-substring-of-one-repeating-character	Hard

Math

Problem Name	Difficulty
1563-stone-game-v	Hard
3116-kth-smallest-amount-with-single-denomination-combination	Hard
3432-count-partitions-with-even-sum-difference	Easy
3945-digit-frequency-score	Easy

Dynamic Programming

Problem Name	Difficulty
0410-split-array-largest-sum	Hard
1563-stone-game-v	Hard

Greedy

Problem Name	Difficulty
0410-split-array-largest-sum	Hard
0680-valid-palindrome-ii	Easy
1386-cinema-seat-allocation	Medium

Merge Sort

Problem Name	Difficulty
3737-count-subarrays-with-majority-element-i	Medium

Counting

Problem Name	Difficulty
0383-ransom-note	Easy
3692-majority-frequency-characters	Easy
3737-count-subarrays-with-majority-element-i	Medium

Trie

Problem Name	Difficulty
0014-longest-common-prefix	Easy

Game Theory

Problem Name	Difficulty
1563-stone-game-v	Hard

Union-Find

Problem Name	Difficulty
0128-longest-consecutive-sequence	Medium

Simulation

Problem Name	Difficulty
1441-build-an-array-with-stack-operations	Medium
2810-faulty-keyboard	Easy
2974-minimum-number-game	Easy
3069-distribute-elements-into-two-arrays-i	Easy

Two Pointers

Problem Name	Difficulty
0141-linked-list-cycle	Easy
0680-valid-palindrome-ii	Easy
0876-middle-of-the-linked-list	Easy
2824-count-pairs-whose-sum-is-less-than-target	Easy

Linked List

Problem Name	Difficulty
0021-merge-two-sorted-lists	Easy
0141-linked-list-cycle	Easy
0206-reverse-linked-list	Easy
0876-middle-of-the-linked-list	Easy
1472-design-browser-history	Medium
1669-merge-in-between-linked-lists	Medium

Recursion

Problem Name	Difficulty
0021-merge-two-sorted-lists	Easy
0206-reverse-linked-list	Easy

Floyd's Cycle Finding Algorithm

Problem Name	Difficulty
0141-linked-list-cycle	Easy

Doubly-Linked List

Problem Name	Difficulty
1472-design-browser-history	Medium

Bracket Sequences

Problem Name	Difficulty
0020-valid-parentheses	Easy
1021-remove-outermost-parentheses	Easy

Queue

Problem Name	Difficulty
0225-implement-stack-using-queues	Easy

Heap (Priority Queue)

Problem Name	Difficulty
2974-minimum-number-game	Easy

Combinatorics

Problem Name	Difficulty
3116-kth-smallest-amount-with-single-denomination-combination	Hard

Number Theory

Problem Name	Difficulty
3116-kth-smallest-amount-with-single-denomination-combination	Hard

| 2 | Union of Two Sets | GeeksForGeeks | Easy | 12 Aug 2026 | 05:03 pm | | 3 | Prime Frequencies in Array | GeeksForGeeks | Easy | 12 Aug 2026 | 05:06 pm | | 4 | Distinct-Digit Numbers in Range | GeeksForGeeks | Basic | 13 Aug 2026 | 10:48 pm | | 5 | K-Pangrams | GeeksForGeeks | Easy | 13 Aug 2026 | 10:53 pm | | 6 | Subarrays with given sum | GeeksForGeeks | Easy | 13 Aug 2026 | 10:56 pm | | 7 | Adjacent XOR Transformation | GeeksForGeeks | Basic | 14 Aug 2026 | 12:04 am | | 8 | Multiply left and right array sum | GeeksForGeeks | Basic | 14 Aug 2026 | 12:05 am | | 9 | Sum of Two Integers | LeetCode | Medium | 14 Aug 2026 | 01:13 am | | 10 | Maximum Sum Problem | GeeksForGeeks | Easy | 14 Aug 2026 | 11:17 pm | | 11 | Max Subarray Sum with Elements less than or equal to k | GeeksForGeeks | Easy | 14 Aug 2026 | 11:20 pm | | 12 | Max Profit with Money Exchange using n/2, n/3, and n/4 | GeeksForGeeks | Easy | 14 Aug 2026 | 11:22 pm | | 13 | Odd or Even | GeeksForGeeks | Basic | 15 Aug 2026 | 02:21 pm | | 14 | Bit Difference | GeeksForGeeks | Basic | 15 Aug 2026 | 02:22 pm | | 15 | One's Complement | GeeksForGeeks | Basic | 15 Aug 2026 | 02:24 pm | | 16 | Max Circular Subarray Sum | GeeksForGeeks | Hard | 15 Aug 2026 | 02:26 pm | | 17 | Check for Binary String | GeeksForGeeks | Basic | 15 Aug 2026 | 02:28 pm | | 18 | Alternate Merge Two Strings | GeeksForGeeks | Basic | 15 Aug 2026 | 02:29 pm | | 19 | Remove Sandwiched Vowels | GeeksForGeeks | Basic | 15 Aug 2026 | 02:32 pm | | 20 | Numbers Without d as Digit | GeeksForGeeks | Hard | 15 Aug 2026 | 02:39 pm | | 21 | Ransom Note | LeetCode | Easy | 15 Aug 2026 | 05:21 pm | | 22 | Sum of odd and even elements | GeeksForGeeks | Basic | 17 Aug 2026 | 02:44 pm | | 23 | Is Linked List Sorted | GeeksForGeeks | Easy | 17 Aug 2026 | 02:52 pm | | 24 | Split Linked List Alternatingly | GeeksForGeeks | Easy | 17 Aug 2026 | 02:53 pm | | 25 | Find the minimum time | GeeksForGeeks | Easy | 18 Aug 2026 | 02:16 pm | | 26 | Identical Linked Lists | GeeksForGeeks | Basic | 19 Aug 2026 | 12:38 pm | | 27 | Insert in a Sorted List | GeeksForGeeks | Easy | 19 Aug 2026 | 12:44 pm | | 28 | Merge In Between Linked Lists | LeetCode | Medium | 19 Aug 2026 | 07:16 pm | | 29 | Build an Array With Stack Operations | LeetCode | Medium | 19 Aug 2026 | 07:23 pm | | 30 | Search in Rotated Sorted Array | LeetCode | Medium | 20 Aug 2026 | 11:18 am | | 31 | k Largest Elements | GeeksForGeeks | Medium | 20 Aug 2026 | 06:58 pm | | 32 | Kth Largest | GeeksForGeeks | Medium | 20 Aug 2026 | 07:01 pm | | 33 | Smallest Range in K Lists | GeeksForGeeks | Hard | 20 Aug 2026 | 07:05 pm | | 34 | Deque Traversal | GeeksForGeeks | Basic | 20 Aug 2026 | 07:06 pm | | 35 | Josephus problem | GeeksForGeeks | Hard | 20 Aug 2026 | 07:10 pm | | 36 | Transform String | GeeksForGeeks | Medium | 21 Aug 2026 | 11:51 am | | 37 | Nearest Smaller Value | GeeksForGeeks | Medium | 21 Aug 2026 | 02:40 pm | | 38 | Get Max from Stack | GeeksForGeeks | Medium | 21 Aug 2026 | 02:42 pm | | 39 | Look and Say Pattern | GeeksForGeeks | Medium | 21 Aug 2026 | 02:46 pm | | 40 | Count Unique Vowel Strings | GeeksForGeeks | Medium | 21 Aug 2026 | 02:48 pm | | 41 | Find Users With Valid E-Mails | LeetCode | Easy | 21 Aug 2026 | 03:57 pm | | 42 | Search Query for Strings | GeeksForGeeks | Easy | 21 Aug 2026 | 04:04 pm |

Name		Name	Last commit message	Last commit date
.github/workflows		.github/workflows
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
0004-median-of-two-sorted-arrays		0004-median-of-two-sorted-arrays
0005-longest-palindromic-substring		0005-longest-palindromic-substring
0007-reverse-integer		0007-reverse-integer
0009-palindrome-number		0009-palindrome-number
0010-regular-expression-matching		0010-regular-expression-matching
0011-container-with-most-water		0011-container-with-most-water
0012-integer-to-roman		0012-integer-to-roman
0014-longest-common-prefix		0014-longest-common-prefix
0015-3sum		0015-3sum
0016-3sum-closest		0016-3sum-closest
0019-remove-nth-node-from-end-of-list		0019-remove-nth-node-from-end-of-list
0020-valid-parentheses		0020-valid-parentheses
0021-merge-two-sorted-lists		0021-merge-two-sorted-lists
0022-generate-parentheses		0022-generate-parentheses
0026-remove-duplicates-from-sorted-array		0026-remove-duplicates-from-sorted-array
0027-remove-element		0027-remove-element
0028-find-the-index-of-the-first-occurrence-in-a-string		0028-find-the-index-of-the-first-occurrence-in-a-string
0033-search-in-rotated-sorted-array		0033-search-in-rotated-sorted-array
0034-find-first-and-last-position-of-element-in-sorted-array		0034-find-first-and-last-position-of-element-in-sorted-array
0035-search-insert-position		0035-search-insert-position
0041-first-missing-positive		0041-first-missing-positive
0042-trapping-rain-water		0042-trapping-rain-water
0049-group-anagrams		0049-group-anagrams
0053-maximum-subarray		0053-maximum-subarray
0055-jump-game		0055-jump-game
0056-merge-intervals		0056-merge-intervals
0058-length-of-last-word		0058-length-of-last-word
0069-sqrtx		0069-sqrtx
0070-climbing-stairs		0070-climbing-stairs
0072-edit-distance		0072-edit-distance
0075-sort-colors		0075-sort-colors
0076-minimum-window-substring		0076-minimum-window-substring
0080-remove-duplicates-from-sorted-array-ii		0080-remove-duplicates-from-sorted-array-ii
0083-remove-duplicates-from-sorted-list		0083-remove-duplicates-from-sorted-list
0088-merge-sorted-array		0088-merge-sorted-array
0094-binary-tree-inorder-traversal		0094-binary-tree-inorder-traversal
0100-same-tree		0100-same-tree
0104-maximum-depth-of-binary-tree		0104-maximum-depth-of-binary-tree
0118-pascals-triangle		0118-pascals-triangle
0121-best-time-to-buy-and-sell-stock		0121-best-time-to-buy-and-sell-stock
0122-best-time-to-buy-and-sell-stock-ii		0122-best-time-to-buy-and-sell-stock-ii
0125-valid-palindrome		0125-valid-palindrome
0128-longest-consecutive-sequence		0128-longest-consecutive-sequence
0136-single-number		0136-single-number
0141-linked-list-cycle		0141-linked-list-cycle
0142-linked-list-cycle-ii		0142-linked-list-cycle-ii
0146-lru-cache		0146-lru-cache
0151-reverse-words-in-a-string		0151-reverse-words-in-a-string
0153-find-minimum-in-rotated-sorted-array		0153-find-minimum-in-rotated-sorted-array
0155-min-stack		0155-min-stack
0160-intersection-of-two-linked-lists		0160-intersection-of-two-linked-lists
0162-find-peak-element		0162-find-peak-element
0167-two-sum-ii-input-array-is-sorted		0167-two-sum-ii-input-array-is-sorted
0169-majority-element		0169-majority-element
0175-combine-two-tables		0175-combine-two-tables
0176-second-highest-salary		0176-second-highest-salary
0177-nth-highest-salary		0177-nth-highest-salary
0178-rank-scores		0178-rank-scores
0181-employees-earning-more-than-their-managers		0181-employees-earning-more-than-their-managers
0182-duplicate-emails		0182-duplicate-emails
0183-customers-who-never-order		0183-customers-who-never-order
0184-department-highest-salary		0184-department-highest-salary
0185-department-top-three-salaries		0185-department-top-three-salaries
0189-rotate-array		0189-rotate-array
0196-delete-duplicate-emails		0196-delete-duplicate-emails
0198-house-robber		0198-house-robber
0204-count-primes		0204-count-primes
0205-isomorphic-strings		0205-isomorphic-strings
0206-reverse-linked-list		0206-reverse-linked-list
0209-minimum-size-subarray-sum		0209-minimum-size-subarray-sum
0213-house-robber-ii		0213-house-robber-ii
0215-kth-largest-element-in-an-array		0215-kth-largest-element-in-an-array
0217-contains-duplicate		0217-contains-duplicate
0219-contains-duplicate-ii		0219-contains-duplicate-ii
0225-implement-stack-using-queues		0225-implement-stack-using-queues
0231-power-of-two		0231-power-of-two
0234-palindrome-linked-list		0234-palindrome-linked-list
0237-delete-node-in-a-linked-list		0237-delete-node-in-a-linked-list
0238-product-of-array-except-self		0238-product-of-array-except-self
0242-valid-anagram		0242-valid-anagram
0268-missing-number		0268-missing-number
0278-first-bad-version		0278-first-bad-version
0283-move-zeroes		0283-move-zeroes
0287-find-the-duplicate-number		0287-find-the-duplicate-number
0290-word-pattern		0290-word-pattern
0303-range-sum-query-immutable		0303-range-sum-query-immutable
0316-remove-duplicate-letters		0316-remove-duplicate-letters
0322-coin-change		0322-coin-change
0328-odd-even-linked-list		0328-odd-even-linked-list
0334-increasing-triplet-subsequence		0334-increasing-triplet-subsequence
0338-counting-bits		0338-counting-bits
0345-reverse-vowels-of-a-string		0345-reverse-vowels-of-a-string
0347-top-k-frequent-elements		0347-top-k-frequent-elements
0371-sum-of-two-integers		0371-sum-of-two-integers
0374-guess-number-higher-or-lower		0374-guess-number-higher-or-lower
0383-ransom-note		0383-ransom-note

Latest commit

History

Folders and files

Repository files navigation

LeetCode Topics

Array

Bit Manipulation

Prefix Sum

Hash Table

Sorting

Divide and Conquer

Stack

Tree

Monotonic Stack

Binary Tree

Cartesian Tree

Binary Search Tree

Sliding Window

Database

Design

Data Stream

String

Segment Tree

Ordered Set

Math

Dynamic Programming

Greedy

Merge Sort

Counting

Trie

Game Theory

Union-Find

Simulation

Two Pointers

Linked List

Recursion

Floyd's Cycle Finding Algorithm

Doubly-Linked List

Bracket Sequences

Queue

Heap (Priority Queue)

Combinatorics

Number Theory

About

Topics

Resources

Stars

Watchers

Forks

Releases

Packages

Contributors

Languages