Skip to content
BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

452 Commits
.github/workflows
.github/workflows
 
 
.vscode
.vscode
 
 
0009-palindrome-number
0009-palindrome-number
 
 
0011-container-with-most-water
0011-container-with-most-water
 
 
0020-valid-parentheses
0020-valid-parentheses
 
 
0031-next-permutation
0031-next-permutation
 
 
0039-combination-sum
0039-combination-sum
 
 
0050-powx-n
0050-powx-n
 
 
0082-remove-duplicates-from-sorted-list-ii
0082-remove-duplicates-from-sorted-list-ii
 
 
0088-merge-sorted-array
0088-merge-sorted-array
 
 
0099-recover-binary-search-tree
0099-recover-binary-search-tree
 
 
0101-symmetric-tree
0101-symmetric-tree
 
 
0102-binary-tree-level-order-traversal
0102-binary-tree-level-order-traversal
 
 
0128-longest-consecutive-sequence
0128-longest-consecutive-sequence
 
 
0143-reorder-list
0143-reorder-list
 
 
0146-lru-cache
0146-lru-cache
 
 
0148-sort-list
0148-sort-list
 
 
0177-nth-highest-salary
0177-nth-highest-salary
 
 
0227-basic-calculator-ii
0227-basic-calculator-ii
 
 
0234-palindrome-linked-list
0234-palindrome-linked-list
 
 
0242-valid-anagram
0242-valid-anagram
 
 
0316-remove-duplicate-letters
0316-remove-duplicate-letters
 
 
0326-power-of-three
0326-power-of-three
 
 
0347-top-k-frequent-elements
0347-top-k-frequent-elements
 
 
0509-fibonacci-number
0509-fibonacci-number
 
 
0560-subarray-sum-equals-k
0560-subarray-sum-equals-k
 
 
0595-big-countries
0595-big-countries
 
 
0607-sales-person
0607-sales-person
 
 
0619-biggest-single-number
0619-biggest-single-number
 
 
0662-maximum-width-of-binary-tree
0662-maximum-width-of-binary-tree
 
 
1081-smallest-subsequence-of-distinct-characters
1081-smallest-subsequence-of-distinct-characters
 
 
1189-maximum-number-of-balloons
1189-maximum-number-of-balloons
 
 
1260-shift-2d-grid
1260-shift-2d-grid
 
 
1288-remove-covered-intervals
1288-remove-covered-intervals
 
 
1291-sequential-digits
1291-sequential-digits
 
 
1301-number-of-paths-with-max-score
1301-number-of-paths-with-max-score
 
 
1331-rank-transform-of-an-array
1331-rank-transform-of-an-array
 
 
1358-number-of-substrings-containing-all-three-characters
1358-number-of-substrings-containing-all-three-characters
 
 
1373-maximum-sum-bst-in-binary-tree
1373-maximum-sum-bst-in-binary-tree
 
 
1464-maximum-product-of-two-elements-in-an-array
1464-maximum-product-of-two-elements-in-an-array
 
 
1846-maximum-element-after-decreasing-and-rearranging
1846-maximum-element-after-decreasing-and-rearranging
 
 
1967-number-of-strings-that-appear-as-substrings-in-word
1967-number-of-strings-that-appear-as-substrings-in-word
 
 
1979-find-greatest-common-divisor-of-array
1979-find-greatest-common-divisor-of-array
 
 
2492-minimum-score-of-a-path-between-two-cities
2492-minimum-score-of-a-path-between-two-cities
 
 
2685-count-the-number-of-complete-components
2685-count-the-number-of-complete-components
 
 
2812-find-the-safest-path-in-a-grid
2812-find-the-safest-path-in-a-grid
 
 
3020-find-the-maximum-number-of-elements-in-subset
3020-find-the-maximum-number-of-elements-in-subset
 
 
3286-find-a-safe-walk-through-a-grid
3286-find-a-safe-walk-through-a-grid
 
 
3312-sorted-gcd-pair-queries
3312-sorted-gcd-pair-queries
 
 
3336-find-the-number-of-subsequences-with-equal-gcd
3336-find-the-number-of-subsequences-with-equal-gcd
 
 
3499-maximize-active-section-with-trade-i
3499-maximize-active-section-with-trade-i
 
 
3501-maximize-active-section-with-trade-ii
3501-maximize-active-section-with-trade-ii
 
 
3514-number-of-unique-xor-triplets-ii
3514-number-of-unique-xor-triplets-ii
 
 
3517-smallest-palindromic-rearrangement-i
3517-smallest-palindromic-rearrangement-i
 
 
3532-path-existence-queries-in-a-graph-i
3532-path-existence-queries-in-a-graph-i
 
 
3534-path-existence-queries-in-a-graph-ii
3534-path-existence-queries-in-a-graph-ii
 
 
3611-find-overbooked-employees
3611-find-overbooked-employees
 
 
3658-gcd-of-odd-and-even-sums
3658-gcd-of-odd-and-even-sums
 
 
3699-number-of-zigzag-arrays-i
3699-number-of-zigzag-arrays-i
 
 
3700-number-of-zigzag-arrays-ii
3700-number-of-zigzag-arrays-ii
 
 
3737-count-subarrays-with-majority-element-i
3737-count-subarrays-with-majority-element-i
 
 
3739-count-subarrays-with-majority-element-ii
3739-count-subarrays-with-majority-element-ii
 
 
3754-concatenate-non-zero-digits-and-multiply-by-sum-i
3754-concatenate-non-zero-digits-and-multiply-by-sum-i
 
 
3756-concatenate-non-zero-digits-and-multiply-by-sum-ii
3756-concatenate-non-zero-digits-and-multiply-by-sum-ii
 
 
3867-sum-of-gcd-of-formed-pairs
3867-sum-of-gcd-of-formed-pairs
 
 
1008. Construct Binary Search Tree from Preorder Traversal
1008. Construct Binary Search Tree from Preorder Traversal
 
 
1009. Complement of Base 10 Integer
1009. Complement of Base 10 Integer
 
 
1022. Sum of Root To Leaf Binary Numbers
1022. Sum of Root To Leaf Binary Numbers
 
 
108. Convert Sorted Array to Binary Search Tree
108. Convert Sorted Array to Binary Search Tree
 
 
109. Convert Sorted List to Binary Search Tree
109. Convert Sorted List to Binary Search Tree
 
 
110. Balanced Binary Tree
110. Balanced Binary Tree
 
 
1200. Minimum Absolute Difference
1200. Minimum Absolute Difference
 
 
1235. Maximum Profit in Job Scheduling
1235. Maximum Profit in Job Scheduling
 
 
1248. Count Number of Nice Subarrays
1248. Count Number of Nice Subarrays
 
 
1266. Minimum Time Visiting All Points
1266. Minimum Time Visiting All Points
 
 
1292. Maximum Side Length of a Square with Sum Less than or Equal to Threshold
1292. Maximum Side Length of a Square with Sum Less than or Equal to Threshold
 
 
1356. Sort Integers by The Number of 1 Bits
1356. Sort Integers by The Number of 1 Bits
 
 
1382. Balance a Binary Search Tree
1382. Balance a Binary Search Tree
 
 
1404. Number of Steps to Reduce a Number in Binary Representation to One
1404. Number of Steps to Reduce a Number in Binary Representation to One
 
 
141. Linked List Cycle
141. Linked List Cycle
 
 
1461. Check If a String Contains All Binary Codes of Size K
1461. Check If a String Contains All Binary Codes of Size K
 
 
148. Sort List
148. Sort List
 
 
1536. Minimum Swaps to Arrange a Binary Grid
1536. Minimum Swaps to Arrange a Binary Grid
 
 
1545. Find Kth Bit in Nth Binary String
1545. Find Kth Bit in Nth Binary String
 
 
155. Min Stack
155. Min Stack
 
 
1582. Special Positions in a Binary Matrix
1582. Special Positions in a Binary Matrix
 
 
162. Find Peak Element
162. Find Peak Element
 
 
1653. Minimum Deletions to Make String Balanced
1653. Minimum Deletions to Make String Balanced
 
 
175. Contest Minimum K to Reduce Array Within Limit
175. Contest Minimum K to Reduce Array Within Limit
 
 
1758. Minimum Changes To Make Alternating Binary String
1758. Minimum Changes To Make Alternating Binary String
 
 
1784. Check if Binary String Has at Most One Segment of Ones
1784. Check if Binary String Has at Most One Segment of Ones
 
 
1877. Minimize Maximum Pair Sum in Array
1877. Minimize Maximum Pair Sum in Array
 
 
1895. Largest Magic Square
1895. Largest Magic Square
 
 
190. Reverse Bits
190. Reverse Bits
 
 
1980. Find Unique Binary String
1980. Find Unique Binary String
 
 
1984. Minimum Difference Between Highest and Lowest of K Scores
1984. Minimum Difference Between Highest and Lowest of K Scores
 
 
2. Add Two Numbers
2. Add Two Numbers
 
 
203. Remove Linked List Elements
203. Remove Linked List Elements
 
 
2149. Rearrange Array Elements by Sign
2149. Rearrange Array Elements by Sign
 
 
222. Count Complete Tree Nodes
222. Count Complete Tree Nodes
 
 

Repository files navigation

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

LeetCode Topics

Hash Table
0128-longest-consecutive-sequence
0146-lru-cache
0242-valid-anagram
0347-top-k-frequent-elements
0560-subarray-sum-equals-k
1189-maximum-number-of-balloons
1331-rank-transform-of-an-array
1358-number-of-substrings-containing-all-three-characters
3020-find-the-maximum-number-of-elements-in-subset
3312-sorted-gcd-pair-queries
3532-path-existence-queries-in-a-graph-i
3737-count-subarrays-with-majority-element-i

String
0020-valid-parentheses
0227-basic-calculator-ii
0242-valid-anagram
0316-remove-duplicate-letters
1081-smallest-subsequence-of-distinct-characters
1189-maximum-number-of-balloons
1358-number-of-substrings-containing-all-three-characters
1967-number-of-strings-that-appear-as-substrings-in-word
3499-maximize-active-section-with-trade-i
3501-maximize-active-section-with-trade-ii
3517-smallest-palindromic-rearrangement-i
3756-concatenate-non-zero-digits-and-multiply-by-sum-ii

Sorting
0088-merge-sorted-array
0242-valid-anagram
0347-top-k-frequent-elements
1288-remove-covered-intervals
1331-rank-transform-of-an-array
1464-maximum-product-of-two-elements-in-an-array
1846-maximum-element-after-decreasing-and-rearranging
3517-smallest-palindromic-rearrangement-i
3534-path-existence-queries-in-a-graph-ii
3867-sum-of-gcd-of-formed-pairs

Counting
0347-top-k-frequent-elements
1189-maximum-number-of-balloons
3312-sorted-gcd-pair-queries
3737-count-subarrays-with-majority-element-i

Array
0011-container-with-most-water
0031-next-permutation
0039-combination-sum
0088-merge-sorted-array
0128-longest-consecutive-sequence
0347-top-k-frequent-elements
0560-subarray-sum-equals-k
1260-shift-2d-grid
1288-remove-covered-intervals
1301-number-of-paths-with-max-score
1331-rank-transform-of-an-array
1464-maximum-product-of-two-elements-in-an-array
1846-maximum-element-after-decreasing-and-rearranging
1967-number-of-strings-that-appear-as-substrings-in-word
1979-find-greatest-common-divisor-of-array
2812-find-the-safest-path-in-a-grid
3020-find-the-maximum-number-of-elements-in-subset
3286-find-a-safe-walk-through-a-grid
3312-sorted-gcd-pair-queries
3336-find-the-number-of-subsequences-with-equal-gcd
3501-maximize-active-section-with-trade-ii
3514-number-of-unique-xor-triplets-ii
3532-path-existence-queries-in-a-graph-i
3534-path-existence-queries-in-a-graph-ii
3737-count-subarrays-with-majority-element-i
3867-sum-of-gcd-of-formed-pairs

Two Pointers
0011-container-with-most-water
0031-next-permutation
0082-remove-duplicates-from-sorted-list-ii
0088-merge-sorted-array
0234-palindrome-linked-list
3534-path-existence-queries-in-a-graph-ii
3867-sum-of-gcd-of-formed-pairs

Math
0009-palindrome-number
0050-powx-n
0227-basic-calculator-ii
0326-power-of-three
0509-fibonacci-number
1979-find-greatest-common-divisor-of-array
3312-sorted-gcd-pair-queries
3336-find-the-number-of-subsequences-with-equal-gcd
3514-number-of-unique-xor-triplets-ii
3658-gcd-of-odd-and-even-sums
3700-number-of-zigzag-arrays-ii
3754-concatenate-non-zero-digits-and-multiply-by-sum-i
3756-concatenate-non-zero-digits-and-multiply-by-sum-ii
3867-sum-of-gcd-of-formed-pairs

Dynamic Programming
0509-fibonacci-number
1301-number-of-paths-with-max-score
1373-maximum-sum-bst-in-binary-tree
3336-find-the-number-of-subsequences-with-equal-gcd
3534-path-existence-queries-in-a-graph-ii
3699-number-of-zigzag-arrays-i
3700-number-of-zigzag-arrays-ii

Recursion
0050-powx-n
0234-palindrome-linked-list
0326-power-of-three
0509-fibonacci-number

Memoization
0509-fibonacci-number

Prefix Sum
0560-subarray-sum-equals-k
3312-sorted-gcd-pair-queries
3699-number-of-zigzag-arrays-i
3737-count-subarrays-with-majority-element-i
3756-concatenate-non-zero-digits-and-multiply-by-sum-ii

Backtracking
0039-combination-sum

Divide and Conquer
0347-top-k-frequent-elements
3737-count-subarrays-with-majority-element-i

Segment Tree
3501-maximize-active-section-with-trade-ii
3737-count-subarrays-with-majority-element-i

Merge Sort
3737-count-subarrays-with-majority-element-i

Tree
0099-recover-binary-search-tree
0101-symmetric-tree
0662-maximum-width-of-binary-tree
1373-maximum-sum-bst-in-binary-tree

Depth-First Search
0099-recover-binary-search-tree
0101-symmetric-tree
0662-maximum-width-of-binary-tree
1373-maximum-sum-bst-in-binary-tree
2492-minimum-score-of-a-path-between-two-cities
2685-count-the-number-of-complete-components

Breadth-First Search
0101-symmetric-tree
0662-maximum-width-of-binary-tree
2492-minimum-score-of-a-path-between-two-cities
2685-count-the-number-of-complete-components
2812-find-the-safest-path-in-a-grid
3286-find-a-safe-walk-through-a-grid

Binary Tree
0099-recover-binary-search-tree
0101-symmetric-tree
0662-maximum-width-of-binary-tree
1373-maximum-sum-bst-in-binary-tree

Binary Search Tree
0099-recover-binary-search-tree
1373-maximum-sum-bst-in-binary-tree
2812-find-the-safest-path-in-a-grid
3312-sorted-gcd-pair-queries
3501-maximize-active-section-with-trade-ii
3532-path-existence-queries-in-a-graph-i
3534-path-existence-queries-in-a-graph-ii

Enumeration
1291-sequential-digits
3020-find-the-maximum-number-of-elements-in-subset
3499-maximize-active-section-with-trade-i
3514-number-of-unique-xor-triplets-ii

Greedy
0011-container-with-most-water
0316-remove-duplicate-letters
1081-smallest-subsequence-of-distinct-characters
1846-maximum-element-after-decreasing-and-rearranging
3534-path-existence-queries-in-a-graph-ii

Sliding Window
1358-number-of-substrings-containing-all-three-characters

Union-Find
0128-longest-consecutive-sequence
2492-minimum-score-of-a-path-between-two-cities
2685-count-the-number-of-complete-components
2812-find-the-safest-path-in-a-grid
3532-path-existence-queries-in-a-graph-i

Heap (Priority Queue)
0347-top-k-frequent-elements
1464-maximum-product-of-two-elements-in-an-array
2812-find-the-safest-path-in-a-grid
3286-find-a-safe-walk-through-a-grid

Matrix
1260-shift-2d-grid
1301-number-of-paths-with-max-score
2812-find-the-safest-path-in-a-grid
3286-find-a-safe-walk-through-a-grid

Graph Theory
2492-minimum-score-of-a-path-between-two-cities
2685-count-the-number-of-complete-components
3286-find-a-safe-walk-through-a-grid
3532-path-existence-queries-in-a-graph-i
3534-path-existence-queries-in-a-graph-ii

Shortest Path
3286-find-a-safe-walk-through-a-grid

Database
0177-nth-highest-salary
0595-big-countries
0607-sales-person
0619-biggest-single-number
3611-find-overbooked-employees

Bit Manipulation
3514-number-of-unique-xor-triplets-ii
3534-path-existence-queries-in-a-graph-ii

Number Theory
1979-find-greatest-common-divisor-of-array
3312-sorted-gcd-pair-queries
3336-find-the-number-of-subsequences-with-equal-gcd
3658-gcd-of-odd-and-even-sums
3867-sum-of-gcd-of-formed-pairs

Bucket Sort
0347-top-k-frequent-elements

Quickselect
0347-top-k-frequent-elements

Linked List
0082-remove-duplicates-from-sorted-list-ii
0146-lru-cache
0234-palindrome-linked-list

Stack
0020-valid-parentheses
0227-basic-calculator-ii
0234-palindrome-linked-list
0316-remove-duplicate-letters
1081-smallest-subsequence-of-distinct-characters

Simulation
1260-shift-2d-grid
3867-sum-of-gcd-of-formed-pairs

Combinatorics
3312-sorted-gcd-pair-queries

Monotonic Stack
0316-remove-duplicate-letters
1081-smallest-subsequence-of-distinct-characters

Design
0146-lru-cache

Doubly-Linked List
0146-lru-cache

Counting Sort
3517-smallest-palindromic-rearrangement-i

About

No description, website, or topics provided.

Resources

Readme
Activity

Stars

0 stars

Watchers

1 watching

Forks

0 forks
Report repository

Releases

Packages

Used by

Contributors

Languages