LEETCODEY1

Collection of LeetCode questions to ace the coding interview! - Created using LeetHub v2

LeetCode Topics

Array

0118-pascals-triangle
0309-best-time-to-buy-and-sell-stock-with-cooldown
0594-longest-harmonious-subsequence
0945-snakes-and-ladders
1510-find-lucky-integer-in-an-array
1621-number-of-subsequences-that-satisfy-the-given-sum-condition
1851-maximum-number-of-events-that-can-be-attended-ii
1995-finding-pairs-with-a-certain-sum
2079-delete-duplicate-folders-in-system
2144-maximum-difference-between-increasing-elements
2150-kth-smallest-product-of-two-sorted-arrays
2170-count-number-of-maximum-bitwise-or-subsets
2204-find-subsequence-of-length-k-with-the-largest-sum
2320-find-all-k-distant-indices-in-an-array
2387-partition-array-such-that-maximum-difference-is-k
2479-meeting-rooms-iii
2498-smallest-subarrays-with-maximum-bitwise-or
2720-minimize-the-maximum-difference-of-pairs
3194-find-words-containing-character
3212-count-submatrices-with-equal-frequency-of-x-and-y
3315-construct-the-minimum-bitwise-array-ii
3453-separate-squares-i
3491-find-the-maximum-length-of-valid-subsequence-ii
3507-minimum-pair-removal-to-sort-array-i
3743-reschedule-meetings-for-maximum-free-time-i
3747-maximum-difference-between-adjacent-elements-in-a-circular-array
3789-maximize-subarrays-after-removing-one-conflicting-pair

String

1058-lexicographically-smallest-equivalent-string
1250-longest-common-subsequence
2079-delete-duplicate-folders-in-system
2395-longest-binary-subsequence-less-than-or-equal-to-k
3194-find-words-containing-character
3396-valid-word
3617-find-the-original-typed-string-i
3618-find-the-original-typed-string-ii
3753-maximum-difference-between-even-and-odd-frequency-i
3754-maximum-manhattan-distance-after-k-changes

Math

0062-unique-paths
1411-convert-binary-number-in-a-linked-list-to-integer
1529-max-difference-you-can-get-from-changing-an-integer
2704-maximum-difference-by-remapping-a-digit
3172-divisible-and-non-divisible-sums-difference
3600-find-the-k-th-character-in-string-game-i
3682-count-the-number-of-arrays-with-k-matching-adjacent-elements
3754-maximum-manhattan-distance-after-k-changes

Breadth-First Search

0945-snakes-and-ladders

Matrix

0945-snakes-and-ladders
3212-count-submatrices-with-equal-frequency-of-x-and-y

Union Find

1058-lexicographically-smallest-equivalent-string

Depth-First Search

0386-lexicographical-numbers

Trie

0386-lexicographical-numbers
2079-delete-duplicate-folders-in-system

Hash Table

0594-longest-harmonious-subsequence
1510-find-lucky-integer-in-an-array
1995-finding-pairs-with-a-certain-sum
2079-delete-duplicate-folders-in-system
2204-find-subsequence-of-length-k-with-the-largest-sum
2479-meeting-rooms-iii
3507-minimum-pair-removal-to-sort-array-i
3753-maximum-difference-between-even-and-odd-frequency-i
3754-maximum-manhattan-distance-after-k-changes

Counting

0594-longest-harmonious-subsequence
1510-find-lucky-integer-in-an-array
3753-maximum-difference-between-even-and-odd-frequency-i
3754-maximum-manhattan-distance-after-k-changes

Binary Search

1621-number-of-subsequences-that-satisfy-the-given-sum-condition
1851-maximum-number-of-events-that-can-be-attended-ii
2150-kth-smallest-product-of-two-sorted-arrays
2498-smallest-subarrays-with-maximum-bitwise-or
2720-minimize-the-maximum-difference-of-pairs
3453-separate-squares-i

Greedy

1529-max-difference-you-can-get-from-changing-an-integer
2387-partition-array-such-that-maximum-difference-is-k
2395-longest-binary-subsequence-less-than-or-equal-to-k
2704-maximum-difference-by-remapping-a-digit
2720-minimize-the-maximum-difference-of-pairs
3743-reschedule-meetings-for-maximum-free-time-i

Combinatorics

0062-unique-paths
3682-count-the-number-of-arrays-with-k-matching-adjacent-elements

Dynamic Programming

0062-unique-paths
0118-pascals-triangle
0309-best-time-to-buy-and-sell-stock-with-cooldown
1250-longest-common-subsequence
1851-maximum-number-of-events-that-can-be-attended-ii
2028-the-earliest-and-latest-rounds-where-players-compete
2395-longest-binary-subsequence-less-than-or-equal-to-k
3491-find-the-maximum-length-of-valid-subsequence-ii
3618-find-the-original-typed-string-ii

Sorting

0594-longest-harmonious-subsequence
1621-number-of-subsequences-that-satisfy-the-given-sum-condition
1851-maximum-number-of-events-that-can-be-attended-ii
2204-find-subsequence-of-length-k-with-the-largest-sum
2387-partition-array-such-that-maximum-difference-is-k
2479-meeting-rooms-iii

Two Pointers

1621-number-of-subsequences-that-satisfy-the-given-sum-condition
2320-find-all-k-distant-indices-in-an-array

Heap (Priority Queue)

2204-find-subsequence-of-length-k-with-the-largest-sum
2479-meeting-rooms-iii
3507-minimum-pair-removal-to-sort-array-i

Sliding Window

0594-longest-harmonious-subsequence
2498-smallest-subarrays-with-maximum-bitwise-or
3743-reschedule-meetings-for-maximum-free-time-i

Memoization

2028-the-earliest-and-latest-rounds-where-players-compete
2395-longest-binary-subsequence-less-than-or-equal-to-k

Prefix Sum

3212-count-submatrices-with-equal-frequency-of-x-and-y
3618-find-the-original-typed-string-ii
3789-maximize-subarrays-after-removing-one-conflicting-pair

Bit Manipulation

2170-count-number-of-maximum-bitwise-or-subsets
2498-smallest-subarrays-with-maximum-bitwise-or
3315-construct-the-minimum-bitwise-array-ii
3600-find-the-k-th-character-in-string-game-i

Recursion

3600-find-the-k-th-character-in-string-game-i

Simulation

2479-meeting-rooms-iii
3507-minimum-pair-removal-to-sort-array-i
3600-find-the-k-th-character-in-string-game-i

Design

1995-finding-pairs-with-a-certain-sum

Linked List

1411-convert-binary-number-in-a-linked-list-to-integer
3507-minimum-pair-removal-to-sort-array-i

Hash Function

2079-delete-duplicate-folders-in-system

Segment Tree

3789-maximize-subarrays-after-removing-one-conflicting-pair

Enumeration

2170-count-number-of-maximum-bitwise-or-subsets
3789-maximize-subarrays-after-removing-one-conflicting-pair

Backtracking

2170-count-number-of-maximum-bitwise-or-subsets

Doubly-Linked List

3507-minimum-pair-removal-to-sort-array-i

Ordered Set

3507-minimum-pair-removal-to-sort-array-i