Name		Name	Last commit message	Last commit date
Latest commit History 1,421 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
0012-integer-to-roman		0012-integer-to-roman
0013-roman-to-integer		0013-roman-to-integer
0014-longest-common-prefix		0014-longest-common-prefix
0017-letter-combinations-of-a-phone-number		0017-letter-combinations-of-a-phone-number
0020-valid-parentheses		0020-valid-parentheses
0021-merge-two-sorted-lists		0021-merge-two-sorted-lists
0023-merge-k-sorted-lists		0023-merge-k-sorted-lists
0024-swap-nodes-in-pairs		0024-swap-nodes-in-pairs
0025-reverse-nodes-in-k-group		0025-reverse-nodes-in-k-group
0028-find-the-index-of-the-first-occurrence-in-a-string		0028-find-the-index-of-the-first-occurrence-in-a-string
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
0037-sudoku-solver		0037-sudoku-solver
0042-trapping-rain-water		0042-trapping-rain-water
0046-permutations		0046-permutations
0049-group-anagrams		0049-group-anagrams
0050-powx-n		0050-powx-n
0051-n-queens		0051-n-queens
0053-maximum-subarray		0053-maximum-subarray
0054-spiral-matrix		0054-spiral-matrix
0058-length-of-last-word		0058-length-of-last-word
0066-plus-one		0066-plus-one
0069-sqrtx		0069-sqrtx
0070-climbing-stairs		0070-climbing-stairs
0074-search-a-2d-matrix		0074-search-a-2d-matrix
0078-subsets		0078-subsets
0082-remove-duplicates-from-sorted-list-ii		0082-remove-duplicates-from-sorted-list-ii
0083-remove-duplicates-from-sorted-list		0083-remove-duplicates-from-sorted-list
0084-largest-rectangle-in-histogram		0084-largest-rectangle-in-histogram
0085-maximal-rectangle		0085-maximal-rectangle
0094-binary-tree-inorder-traversal		0094-binary-tree-inorder-traversal
0098-validate-binary-search-tree		0098-validate-binary-search-tree
0100-same-tree		0100-same-tree
0102-binary-tree-level-order-traversal		0102-binary-tree-level-order-traversal
0103-binary-tree-zigzag-level-order-traversal		0103-binary-tree-zigzag-level-order-traversal
0104-maximum-depth-of-binary-tree		0104-maximum-depth-of-binary-tree
0105-construct-binary-tree-from-preorder-and-inorder-traversal		0105-construct-binary-tree-from-preorder-and-inorder-traversal
0106-construct-binary-tree-from-inorder-and-postorder-traversal		0106-construct-binary-tree-from-inorder-and-postorder-traversal
0110-balanced-binary-tree		0110-balanced-binary-tree
0111-minimum-depth-of-binary-tree		0111-minimum-depth-of-binary-tree
0113-path-sum-ii		0113-path-sum-ii
0114-flatten-binary-tree-to-linked-list		0114-flatten-binary-tree-to-linked-list
0125-valid-palindrome		0125-valid-palindrome
0128-longest-consecutive-sequence		0128-longest-consecutive-sequence
0129-sum-root-to-leaf-numbers		0129-sum-root-to-leaf-numbers
0131-palindrome-partitioning		0131-palindrome-partitioning
0138-copy-list-with-random-pointer		0138-copy-list-with-random-pointer
0141-linked-list-cycle		0141-linked-list-cycle
0142-linked-list-cycle-ii		0142-linked-list-cycle-ii
0143-reorder-list		0143-reorder-list
0144-binary-tree-preorder-traversal		0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal		0145-binary-tree-postorder-traversal
0150-evaluate-reverse-polish-notation		0150-evaluate-reverse-polish-notation
0152-maximum-product-subarray		0152-maximum-product-subarray
0155-min-stack		0155-min-stack
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
0189-rotate-array		0189-rotate-array
0190-reverse-bits		0190-reverse-bits
0191-number-of-1-bits		0191-number-of-1-bits
0196-delete-duplicate-emails		0196-delete-duplicate-emails
0197-rising-temperature		0197-rising-temperature
0198-house-robber		0198-house-robber
0202-happy-number		0202-happy-number
0203-remove-linked-list-elements		0203-remove-linked-list-elements
0204-count-primes		0204-count-primes
0205-isomorphic-strings		0205-isomorphic-strings
0206-reverse-linked-list		0206-reverse-linked-list
0208-implement-trie-prefix-tree		0208-implement-trie-prefix-tree
0215-kth-largest-element-in-an-array		0215-kth-largest-element-in-an-array
0217-contains-duplicate		0217-contains-duplicate
0226-invert-binary-tree		0226-invert-binary-tree
0228-summary-ranges		0228-summary-ranges
0230-kth-smallest-element-in-a-bst		0230-kth-smallest-element-in-a-bst
0231-power-of-two		0231-power-of-two
0232-implement-queue-using-stacks		0232-implement-queue-using-stacks
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
0239-sliding-window-maximum		0239-sliding-window-maximum
0240-search-a-2d-matrix-ii		0240-search-a-2d-matrix-ii
0242-valid-anagram		0242-valid-anagram
0257-binary-tree-paths		0257-binary-tree-paths
0258-add-digits		0258-add-digits
0263-ugly-number		0263-ugly-number
0268-missing-number		0268-missing-number
0278-first-bad-version		0278-first-bad-version
0279-perfect-squares		0279-perfect-squares
0283-move-zeroes		0283-move-zeroes
0287-find-the-duplicate-number		0287-find-the-duplicate-number
0290-word-pattern		0290-word-pattern
0295-find-median-from-data-stream		0295-find-median-from-data-stream
0300-longest-increasing-subsequence		0300-longest-increasing-subsequence

Repository files navigation

LeetCode

Collection of LeetCode questions with solutions to ace the coding interview!
Both questions and solutions are updated in this repository.
CPP and SQL (Database) Solutions

How to find your question ?

You can easily find the solution for your question, just press CTRL+F and search either using the question number or you can enter the topic of your question from LeetCode.
For Example : Question Number 1 - Two Sum can be found either by searching 1, or if it is difficult, you should try CTRL+F and than by typing "1-TWO-SUM"

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Repository files navigation

LeetCode

How to find your question ?

THANK YOU!!

Hope you like this!

About

Releases

Packages

Languages

Puneetpotter/LeetCode

Folders and files

Latest commit

History

Repository files navigation

LeetCode

How to find your question ?

THANK YOU!!

Hope you like this!

About

Topics

Resources

Stars

Watchers

Forks

Releases

Packages 0

Languages

Packages