Skip to content

About

LeetCode problem-solving is an invaluable resource for software developers, coding enthusiasts, and students alike, providing a dynamic and interactive platform to enhance their programming skills and prepare for real-world coding challenges.

Resources

Readme
Activity

Stars

0 stars

Watchers

1 watching

Forks

0 forks
Report repository
BranchesTags

Latest commit

 

History

1,021 Commits

Folders and files

NameName
Last commit message
Last commit date
0017-letter-combinations-of-a-phone-number
0017-letter-combinations-of-a-phone-number
 
 
0025-reverse-nodes-in-k-group
0025-reverse-nodes-in-k-group
 
 
0031-next-permutation
0031-next-permutation
 
 
0036-valid-sudoku
0036-valid-sudoku
 
 
0037-sudoku-solver
0037-sudoku-solver
 
 
0039-combination-sum
0039-combination-sum
 
 
0040-combination-sum-ii
0040-combination-sum-ii
 
 
0044-wildcard-matching
0044-wildcard-matching
 
 
0046-permutations
0046-permutations
 
 
0047-permutations-ii
0047-permutations-ii
 
 
0051-n-queens
0051-n-queens
 
 
0052-n-queens-ii
0052-n-queens-ii
 
 
0072-edit-distance
0072-edit-distance
 
 
0074-search-a-2d-matrix
0074-search-a-2d-matrix
 
 
0076-minimum-window-substring
0076-minimum-window-substring
 
 
0077-combinations
0077-combinations
 
 
0078-subsets
0078-subsets
 
 
0079-word-search
0079-word-search
 
 
0090-subsets-ii
0090-subsets-ii
 
 
0098-validate-binary-search-tree
0098-validate-binary-search-tree
 
 
0106-construct-binary-tree-from-inorder-and-postorder-traversal
0106-construct-binary-tree-from-inorder-and-postorder-traversal
 
 
0113-path-sum-ii
0113-path-sum-ii
 
 
0116-populating-next-right-pointers-in-each-node
0116-populating-next-right-pointers-in-each-node
 
 
0122-best-time-to-buy-and-sell-stock-ii
0122-best-time-to-buy-and-sell-stock-ii
 
 
0123-best-time-to-buy-and-sell-stock-iii
0123-best-time-to-buy-and-sell-stock-iii
 
 
0130-surrounded-regions
0130-surrounded-regions
 
 
0131-palindrome-partitioning
0131-palindrome-partitioning
 
 
0146-lru-cache
0146-lru-cache
 
 
0155-min-stack
0155-min-stack
 
 
0188-best-time-to-buy-and-sell-stock-iv
0188-best-time-to-buy-and-sell-stock-iv
 
 
0208-implement-trie-prefix-tree
0208-implement-trie-prefix-tree
 
 
0239-sliding-window-maximum
0239-sliding-window-maximum
 
 
0240-search-a-2d-matrix-ii
0240-search-a-2d-matrix-ii
 
 
0300-longest-increasing-subsequence
0300-longest-increasing-subsequence
 
 
0301-remove-invalid-parentheses
0301-remove-invalid-parentheses
 
 
0309-best-time-to-buy-and-sell-stock-with-cooldown
0309-best-time-to-buy-and-sell-stock-with-cooldown
 
 
0322-coin-change
0322-coin-change
 
 
0329-longest-increasing-path-in-a-matrix
0329-longest-increasing-path-in-a-matrix
 
 
0410-split-array-largest-sum
0410-split-array-largest-sum
 
 
0416-partition-equal-subset-sum
0416-partition-equal-subset-sum
 
 
0419-battleships-in-a-board
0419-battleships-in-a-board
 
 
0424-longest-repeating-character-replacement
0424-longest-repeating-character-replacement
 
 
0437-path-sum-iii
0437-path-sum-iii
 
 
0494-target-sum
0494-target-sum
 
 
0518-coin-change-ii
0518-coin-change-ii
 
 
0538-convert-bst-to-greater-tree
0538-convert-bst-to-greater-tree
 
 
0560-subarray-sum-equals-k
0560-subarray-sum-equals-k
 
 
0621-task-scheduler
0621-task-scheduler
 
 
0662-maximum-width-of-binary-tree
0662-maximum-width-of-binary-tree
 
 
0714-best-time-to-buy-and-sell-stock-with-transaction-fee
0714-best-time-to-buy-and-sell-stock-with-transaction-fee
 
 
0721-accounts-merge
0721-accounts-merge
 
 
0787-cheapest-flights-within-k-stops
0787-cheapest-flights-within-k-stops
 
 
0797-all-paths-from-source-to-target
0797-all-paths-from-source-to-target
 
 
0841-keys-and-rooms
0841-keys-and-rooms
 
 
0875-koko-eating-bananas
0875-koko-eating-bananas
 
 
0987-vertical-order-traversal-of-a-binary-tree
0987-vertical-order-traversal-of-a-binary-tree
 
 
0992-subarrays-with-k-different-integers
0992-subarrays-with-k-different-integers
 
 
1011-capacity-to-ship-packages-within-d-days
1011-capacity-to-ship-packages-within-d-days
 
 
1091-shortest-path-in-binary-matrix
1091-shortest-path-in-binary-matrix
 
 
1248-count-number-of-nice-subarrays
1248-count-number-of-nice-subarrays
 
 
1306-jump-game-iii
1306-jump-game-iii
 
 
1482-minimum-number-of-days-to-make-m-bouquets
1482-minimum-number-of-days-to-make-m-bouquets
 
 
1976-number-of-ways-to-arrive-at-destination
1976-number-of-ways-to-arrive-at-destination
 
 
2409-count-days-spent-together
2409-count-days-spent-together
 
 
1. Two Sum
1. Two Sum
 
 
10. Regular Expression Matching
10. Regular Expression Matching
 
 
1002. Find Common Characters
1002. Find Common Characters
 
 
1007. Minimum Domino Rotations For Equal Row
1007. Minimum Domino Rotations For Equal Row
 
 
101. Symmetric Tree
101. Symmetric Tree
 
 
102. Binary Tree Level Order Traversal
102. Binary Tree Level Order Traversal
 
 
102. Binary Tree Level Order Traversal-----
102. Binary Tree Level Order Traversal-----
 
 
102. Binary Tree Level Order Traversal------
102. Binary Tree Level Order Traversal------
 
 
102. Binary Tree Level Order Traversal_____________
102. Binary Tree Level Order Traversal_____________
 
 
1028. Recover a Tree From Preorder Traversal
1028. Recover a Tree From Preorder Traversal
 
 
104. Maximum Depth of Binary Tree
104. Maximum Depth of Binary Tree
 
 
104. Maximum Depth of Binary Tree----
104. Maximum Depth of Binary Tree----
 
 
1046. Last Stone Weight
1046. Last Stone Weight
 
 
1048. Longest String Chain
1048. Longest String Chain
 
 
105. Construct Binary Tree from Preorder and Inorder Traversal
105. Construct Binary Tree from Preorder and Inorder Traversal
 
 
1061. Lexicographically Smallest Equivalent String
1061. Lexicographically Smallest Equivalent String
 
 
107. Binary Tree Level Order Traversal II
107. Binary Tree Level Order Traversal II
 
 
1071. Greatest Common Divisor of Strings
1071. Greatest Common Divisor of Strings
 
 
1071. Greatest Common Divisor of Strings----
1071. Greatest Common Divisor of Strings----
 
 
1072. Flip Columns For Maximum Number of Equal Rows
1072. Flip Columns For Maximum Number of Equal Rows
 
 
1074. Number of Submatrices That Sum to Target
1074. Number of Submatrices That Sum to Target
 
 
1079. Letter Tile Possibilities
1079. Letter Tile Possibilities
 
 
108. Convert Sorted Array to Binary Search Tree
108. Convert Sorted Array to Binary Search Tree
 
 
1081. Smallest Subsequence of Distinct Characters
1081. Smallest Subsequence of Distinct Characters
 
 
1092. Shortest Common Supersequence +_+_+_+
1092. Shortest Common Supersequence +_+_+_+
 
 
1094. Car Pooling
1094. Car Pooling
 
 
11. Container With Most Water
11. Container With Most Water
 
 
11. Container With Most Water--
11. Container With Most Water--
 
 
11. Container With Most Water-------
11. Container With Most Water-------
 
 
110. Balanced Binary Tree
110. Balanced Binary Tree
 
 
110. Balanced Binary Tree___
110. Balanced Binary Tree___
 
 
1105. Filling Bookcase Shelves
1105. Filling Bookcase Shelves
 
 
1106. Parsing A Boolean Expression
1106. Parsing A Boolean Expression
 
 
1108. Defanging an IP Address
1108. Defanging an IP Address
 
 
1108. Defanging an IP Address---
1108. Defanging an IP Address---
 
 
112. Path Sum
112. Path Sum
 
 

Repository files navigation

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

LeetCode Topics

Math
1248-count-number-of-nice-subarrays
2409-count-days-spent-together

String
0017-letter-combinations-of-a-phone-number
0044-wildcard-matching
0072-edit-distance
0076-minimum-window-substring
0079-word-search
0131-palindrome-partitioning
0208-implement-trie-prefix-tree
0301-remove-invalid-parentheses
0424-longest-repeating-character-replacement
0721-accounts-merge
2409-count-days-spent-together

Hash Table
0017-letter-combinations-of-a-phone-number
0036-valid-sudoku
0037-sudoku-solver
0076-minimum-window-substring
0106-construct-binary-tree-from-inorder-and-postorder-traversal
0146-lru-cache
0208-implement-trie-prefix-tree
0424-longest-repeating-character-replacement
0560-subarray-sum-equals-k
0621-task-scheduler
0721-accounts-merge
0992-subarrays-with-k-different-integers
1248-count-number-of-nice-subarrays

Design
0146-lru-cache
0155-min-stack
0208-implement-trie-prefix-tree

Trie
0208-implement-trie-prefix-tree

Array
0031-next-permutation
0036-valid-sudoku
0037-sudoku-solver
0039-combination-sum
0040-combination-sum-ii
0046-permutations
0047-permutations-ii
0051-n-queens
0074-search-a-2d-matrix
0078-subsets
0079-word-search
0090-subsets-ii
0106-construct-binary-tree-from-inorder-and-postorder-traversal
0122-best-time-to-buy-and-sell-stock-ii
0123-best-time-to-buy-and-sell-stock-iii
0130-surrounded-regions
0188-best-time-to-buy-and-sell-stock-iv
0239-sliding-window-maximum
0240-search-a-2d-matrix-ii
0300-longest-increasing-subsequence
0309-best-time-to-buy-and-sell-stock-with-cooldown
0322-coin-change
0329-longest-increasing-path-in-a-matrix
0410-split-array-largest-sum
0416-partition-equal-subset-sum
0419-battleships-in-a-board
0494-target-sum
0518-coin-change-ii
0560-subarray-sum-equals-k
0621-task-scheduler
0714-best-time-to-buy-and-sell-stock-with-transaction-fee
0721-accounts-merge
0875-koko-eating-bananas
0992-subarrays-with-k-different-integers
1011-capacity-to-ship-packages-within-d-days
1091-shortest-path-in-binary-matrix
1248-count-number-of-nice-subarrays
1306-jump-game-iii
1482-minimum-number-of-days-to-make-m-bouquets

Dynamic Programming
0044-wildcard-matching
0072-edit-distance
0122-best-time-to-buy-and-sell-stock-ii
0123-best-time-to-buy-and-sell-stock-iii
0131-palindrome-partitioning
0188-best-time-to-buy-and-sell-stock-iv
0300-longest-increasing-subsequence
0309-best-time-to-buy-and-sell-stock-with-cooldown
0322-coin-change
0329-longest-increasing-path-in-a-matrix
0410-split-array-largest-sum
0416-partition-equal-subset-sum
0494-target-sum
0518-coin-change-ii
0714-best-time-to-buy-and-sell-stock-with-transaction-fee
0787-cheapest-flights-within-k-stops
1976-number-of-ways-to-arrive-at-destination

Depth-First Search
0079-word-search
0098-validate-binary-search-tree
0113-path-sum-ii
0116-populating-next-right-pointers-in-each-node
0130-surrounded-regions
0329-longest-increasing-path-in-a-matrix
0419-battleships-in-a-board
0437-path-sum-iii
0538-convert-bst-to-greater-tree
0662-maximum-width-of-binary-tree
0721-accounts-merge
0787-cheapest-flights-within-k-stops
0797-all-paths-from-source-to-target
0841-keys-and-rooms
1306-jump-game-iii

Breadth-First Search
0116-populating-next-right-pointers-in-each-node
0130-surrounded-regions
0301-remove-invalid-parentheses
0322-coin-change
0329-longest-increasing-path-in-a-matrix
0662-maximum-width-of-binary-tree
0721-accounts-merge
0787-cheapest-flights-within-k-stops
0797-all-paths-from-source-to-target
0841-keys-and-rooms
1091-shortest-path-in-binary-matrix
1306-jump-game-iii

Graph Theory
0329-longest-increasing-path-in-a-matrix
0787-cheapest-flights-within-k-stops
0797-all-paths-from-source-to-target
0841-keys-and-rooms
1976-number-of-ways-to-arrive-at-destination

Topological Sort
0329-longest-increasing-path-in-a-matrix
1976-number-of-ways-to-arrive-at-destination

Memoization
0329-longest-increasing-path-in-a-matrix

Matrix
0036-valid-sudoku
0037-sudoku-solver
0074-search-a-2d-matrix
0079-word-search
0130-surrounded-regions
0240-search-a-2d-matrix-ii
0329-longest-increasing-path-in-a-matrix
0419-battleships-in-a-board
1091-shortest-path-in-binary-matrix

Directed Acyclic Graph
0329-longest-increasing-path-in-a-matrix
0797-all-paths-from-source-to-target

Tree
0098-validate-binary-search-tree
0106-construct-binary-tree-from-inorder-and-postorder-traversal
0113-path-sum-ii
0116-populating-next-right-pointers-in-each-node
0437-path-sum-iii
0538-convert-bst-to-greater-tree
0662-maximum-width-of-binary-tree

Binary Search Tree
0074-search-a-2d-matrix
0098-validate-binary-search-tree
0240-search-a-2d-matrix-ii
0300-longest-increasing-subsequence
0410-split-array-largest-sum
0538-convert-bst-to-greater-tree
0875-koko-eating-bananas
1011-capacity-to-ship-packages-within-d-days
1482-minimum-number-of-days-to-make-m-bouquets

Binary Tree
0098-validate-binary-search-tree
0106-construct-binary-tree-from-inorder-and-postorder-traversal
0113-path-sum-ii
0116-populating-next-right-pointers-in-each-node
0437-path-sum-iii
0538-convert-bst-to-greater-tree
0662-maximum-width-of-binary-tree

Backtracking
0017-letter-combinations-of-a-phone-number
0037-sudoku-solver
0039-combination-sum
0040-combination-sum-ii
0046-permutations
0047-permutations-ii
0051-n-queens
0052-n-queens-ii
0077-combinations
0078-subsets
0079-word-search
0090-subsets-ii
0113-path-sum-ii
0131-palindrome-partitioning
0301-remove-invalid-parentheses
0494-target-sum
0797-all-paths-from-source-to-target

Stack
0155-min-stack

Linked List
0025-reverse-nodes-in-k-group
0116-populating-next-right-pointers-in-each-node
0146-lru-cache

Doubly-Linked List
0146-lru-cache

Sorting
0047-permutations-ii
0621-task-scheduler
0721-accounts-merge

Two Pointers
0031-next-permutation

Algorithm X
0037-sudoku-solver
0051-n-queens
0052-n-queens-ii

Divide and Conquer
0106-construct-binary-tree-from-inorder-and-postorder-traversal
0240-search-a-2d-matrix-ii

Longest Increasing Subsequence
0300-longest-increasing-subsequence

Prefix Sum
0410-split-array-largest-sum
0560-subarray-sum-equals-k
1248-count-number-of-nice-subarrays

Recursion
0025-reverse-nodes-in-k-group
0044-wildcard-matching

Queue
0239-sliding-window-maximum

Sliding Window
0076-minimum-window-substring
0239-sliding-window-maximum
0424-longest-repeating-character-replacement
0992-subarrays-with-k-different-integers
1248-count-number-of-nice-subarrays

Heap (Priority Queue)
0239-sliding-window-maximum
0621-task-scheduler
0787-cheapest-flights-within-k-stops

Monotonic Queue
0239-sliding-window-maximum

Range Minimum/Maximum Query
0239-sliding-window-maximum

Greedy
0044-wildcard-matching
0122-best-time-to-buy-and-sell-stock-ii
0410-split-array-largest-sum
0621-task-scheduler
0714-best-time-to-buy-and-sell-stock-with-transaction-fee

Counting
0621-task-scheduler
0992-subarrays-with-k-different-integers

Union-Find
0130-surrounded-regions
0721-accounts-merge

Knapsack Problem
0322-coin-change
0416-partition-equal-subset-sum
0494-target-sum
0518-coin-change-ii

0-1 Knapsack
0416-partition-equal-subset-sum
0494-target-sum

Complete Knapsack
0322-coin-change
0518-coin-change-ii

Dancing Links
0037-sudoku-solver

Shortest Path
0787-cheapest-flights-within-k-stops
1976-number-of-ways-to-arrive-at-destination

Dijkstra's Algorithm
1976-number-of-ways-to-arrive-at-destination

Bit Manipulation
0078-subsets
0090-subsets-ii

About

LeetCode problem-solving is an invaluable resource for software developers, coding enthusiasts, and students alike, providing a dynamic and interactive platform to enhance their programming skills and prepare for real-world coding challenges.

Resources

Readme
Activity

Stars

0 stars

Watchers

1 watching

Forks

0 forks
Report repository

Releases

Packages

Contributors

Languages