Skip to content

geekyprawins/leetcode-practice

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

739 Commits
0002-add-two-numbers
0002-add-two-numbers
 
 
0004-median-of-two-sorted-arrays
0004-median-of-two-sorted-arrays
 
 
0005-longest-palindromic-substring
0005-longest-palindromic-substring
 
 
0011-container-with-most-water
0011-container-with-most-water
 
 
0014-longest-common-prefix
0014-longest-common-prefix
 
 
0015-3sum
0015-3sum
 
 
0019-remove-nth-node-from-end-of-list
0019-remove-nth-node-from-end-of-list
 
 
0020-valid-parentheses
0020-valid-parentheses
 
 
0026-remove-duplicates-from-sorted-array
0026-remove-duplicates-from-sorted-array
 
 
0039-combination-sum
0039-combination-sum
 
 
0042-trapping-rain-water
0042-trapping-rain-water
 
 
0046-permutations
0046-permutations
 
 
0051-n-queens
0051-n-queens
 
 
0060-permutation-sequence
0060-permutation-sequence
 
 
0061-rotate-list
0061-rotate-list
 
 
0069-sqrtx
0069-sqrtx
 
 
0070-climbing-stairs
0070-climbing-stairs
 
 
0072-edit-distance
0072-edit-distance
 
 
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
 
 
0101-symmetric-tree
0101-symmetric-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
 
 
0110-balanced-binary-tree
0110-balanced-binary-tree
 
 
0120-triangle
0120-triangle
 
 
0124-binary-tree-maximum-path-sum
0124-binary-tree-maximum-path-sum
 
 
0131-palindrome-partitioning
0131-palindrome-partitioning
 
 
0134-gas-station
0134-gas-station
 
 
0141-linked-list-cycle
0141-linked-list-cycle
 
 
0142-linked-list-cycle-ii
0142-linked-list-cycle-ii
 
 
0144-binary-tree-preorder-traversal
0144-binary-tree-preorder-traversal
 
 
0145-binary-tree-postorder-traversal
0145-binary-tree-postorder-traversal
 
 
0146-lru-cache
0146-lru-cache
 
 
0151-reverse-words-in-a-string
0151-reverse-words-in-a-string
 
 
0155-min-stack
0155-min-stack
 
 
0160-intersection-of-two-linked-lists
0160-intersection-of-two-linked-lists
 
 
0165-compare-version-numbers
0165-compare-version-numbers
 
 
0167-two-sum-ii-input-array-is-sorted
0167-two-sum-ii-input-array-is-sorted
 
 
0173-binary-search-tree-iterator
0173-binary-search-tree-iterator
 
 
0198-house-robber
0198-house-robber
 
 
0199-binary-tree-right-side-view
0199-binary-tree-right-side-view
 
 
0202-happy-number
0202-happy-number
 
 
0207-course-schedule
0207-course-schedule
 
 
0208-implement-trie-prefix-tree
0208-implement-trie-prefix-tree
 
 
0213-house-robber-ii
0213-house-robber-ii
 
 
0215-kth-largest-element-in-an-array
0215-kth-largest-element-in-an-array
 
 
0225-implement-stack-using-queues
0225-implement-stack-using-queues
 
 
0230-kth-smallest-element-in-a-bst
0230-kth-smallest-element-in-a-bst
 
 
0232-implement-queue-using-stacks
0232-implement-queue-using-stacks
 
 
0234-palindrome-linked-list
0234-palindrome-linked-list
 
 
0235-lowest-common-ancestor-of-a-binary-search-tree
0235-lowest-common-ancestor-of-a-binary-search-tree
 
 
0237-delete-node-in-a-linked-list
0237-delete-node-in-a-linked-list
 
 
0242-valid-anagram
0242-valid-anagram
 
 
0303-range-sum-query-immutable
0303-range-sum-query-immutable
 
 
0455-assign-cookies
0455-assign-cookies
 
 
0460-lfu-cache
0460-lfu-cache
 
 
0485-max-consecutive-ones
0485-max-consecutive-ones
 
 
0496-next-greater-element-i
0496-next-greater-element-i
 
 
0525-contiguous-array
0525-contiguous-array
 
 
0540-single-element-in-a-sorted-array
0540-single-element-in-a-sorted-array
 
 
0543-diameter-of-binary-tree
0543-diameter-of-binary-tree
 
 
0560-subarray-sum-equals-k
0560-subarray-sum-equals-k
 
 
0643-maximum-average-subarray-i
0643-maximum-average-subarray-i
 
 
0653-two-sum-iv-input-is-a-bst
0653-two-sum-iv-input-is-a-bst
 
 
0662-maximum-width-of-binary-tree
0662-maximum-width-of-binary-tree
 
 
0700-search-in-a-binary-search-tree
0700-search-in-a-binary-search-tree
 
 
0733-flood-fill
0733-flood-fill
 
 
0785-is-graph-bipartite
0785-is-graph-bipartite
 
 
0981-time-based-key-value-store
0981-time-based-key-value-store
 
 
1-two-sum
1-two-sum
 
 
104-maximum-depth-of-binary-tree
104-maximum-depth-of-binary-tree
 
 
108-convert-sorted-array-to-binary-search-tree
108-convert-sorted-array-to-binary-search-tree
 
 
1154-day-of-the-year
1154-day-of-the-year
 
 
119-pascals-triangle-ii
119-pascals-triangle-ii
 
 
122-best-time-to-buy-and-sell-stock-ii
122-best-time-to-buy-and-sell-stock-ii
 
 
1249-minimum-remove-to-make-valid-parentheses
1249-minimum-remove-to-make-valid-parentheses
 
 
125-valid-palindrome
125-valid-palindrome
 
 
13-roman-to-integer
13-roman-to-integer
 
 
136-single-number
136-single-number
 
 
14-longest-common-prefix
14-longest-common-prefix
 
 
142-linked-list-cycle-ii
142-linked-list-cycle-ii
 
 
143-reorder-list
143-reorder-list
 
 
15-3sum
15-3sum
 
 
155-min-stack
155-min-stack
 
 
16-3sum-closest
16-3sum-closest
 
 
160-intersection-of-two-linked-lists
160-intersection-of-two-linked-lists
 
 
167-two-sum-ii-input-array-is-sorted
167-two-sum-ii-input-array-is-sorted
 
 
169-majority-element
169-majority-element
 
 
1706-where-will-the-ball-fall
1706-where-will-the-ball-fall
 
 
187-repeated-dna-sequences
187-repeated-dna-sequences
 
 
189-rotate-array
189-rotate-array
 
 
19-remove-nth-node-from-end-of-list
19-remove-nth-node-from-end-of-list
 
 
198-house-robber
198-house-robber
 
 
2-add-two-numbers
2-add-two-numbers
 
 
20-valid-parentheses
20-valid-parentheses
 
 
202-happy-number
202-happy-number
 
 
206-reverse-linked-list
206-reverse-linked-list
 
 
209-minimum-size-subarray-sum
209-minimum-size-subarray-sum
 
 

Repository files navigation

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

LeetCode Topics

Linked List
0002-add-two-numbers
0061-rotate-list
0141-linked-list-cycle
0142-linked-list-cycle-ii
0146-lru-cache
0160-intersection-of-two-linked-lists
0234-palindrome-linked-list
0237-delete-node-in-a-linked-list
0460-lfu-cache

Math
0002-add-two-numbers
0060-permutation-sequence
0069-sqrtx
0070-climbing-stairs
0202-happy-number

Recursion
0002-add-two-numbers
0060-permutation-sequence
0234-palindrome-linked-list

Hash Table
0141-linked-list-cycle
0142-linked-list-cycle-ii
0146-lru-cache
0160-intersection-of-two-linked-lists
0202-happy-number
0208-implement-trie-prefix-tree
0242-valid-anagram
0460-lfu-cache
0496-next-greater-element-i
0525-contiguous-array
0560-subarray-sum-equals-k
0653-two-sum-iv-input-is-a-bst
0981-time-based-key-value-store

Two Pointers
0005-longest-palindromic-substring
0011-container-with-most-water
0015-3sum
0026-remove-duplicates-from-sorted-array
0042-trapping-rain-water
0061-rotate-list
0141-linked-list-cycle
0142-linked-list-cycle-ii
0151-reverse-words-in-a-string
0160-intersection-of-two-linked-lists
0165-compare-version-numbers
0167-two-sum-ii-input-array-is-sorted
0202-happy-number
0234-palindrome-linked-list
0455-assign-cookies
0653-two-sum-iv-input-is-a-bst

Stack
0020-valid-parentheses
0042-trapping-rain-water
0094-binary-tree-inorder-traversal
0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal
0155-min-stack
0173-binary-search-tree-iterator
0225-implement-stack-using-queues
0232-implement-queue-using-stacks
0234-palindrome-linked-list
0496-next-greater-element-i

Array
0004-median-of-two-sorted-arrays
0011-container-with-most-water
0014-longest-common-prefix
0015-3sum
0026-remove-duplicates-from-sorted-array
0039-combination-sum
0042-trapping-rain-water
0046-permutations
0051-n-queens
0120-triangle
0134-gas-station
0167-two-sum-ii-input-array-is-sorted
0198-house-robber
0213-house-robber-ii
0215-kth-largest-element-in-an-array
0303-range-sum-query-immutable
0455-assign-cookies
0485-max-consecutive-ones
0496-next-greater-element-i
0525-contiguous-array
0540-single-element-in-a-sorted-array
0560-subarray-sum-equals-k
0643-maximum-average-subarray-i
0733-flood-fill

Sorting
0015-3sum
0215-kth-largest-element-in-an-array
0242-valid-anagram
0455-assign-cookies

Dynamic Programming
0005-longest-palindromic-substring
0042-trapping-rain-water
0070-climbing-stairs
0072-edit-distance
0120-triangle
0124-binary-tree-maximum-path-sum
0131-palindrome-partitioning
0198-house-robber
0213-house-robber-ii

Monotonic Stack
0042-trapping-rain-water
0496-next-greater-element-i

Design
0146-lru-cache
0155-min-stack
0173-binary-search-tree-iterator
0208-implement-trie-prefix-tree
0225-implement-stack-using-queues
0232-implement-queue-using-stacks
0303-range-sum-query-immutable
0460-lfu-cache
0981-time-based-key-value-store

Queue
0225-implement-stack-using-queues
0232-implement-queue-using-stacks

String
0005-longest-palindromic-substring
0014-longest-common-prefix
0020-valid-parentheses
0072-edit-distance
0131-palindrome-partitioning
0151-reverse-words-in-a-string
0165-compare-version-numbers
0208-implement-trie-prefix-tree
0242-valid-anagram
0981-time-based-key-value-store

Doubly-Linked List
0146-lru-cache
0460-lfu-cache

Trie
0014-longest-common-prefix
0208-implement-trie-prefix-tree

Tree
0094-binary-tree-inorder-traversal
0098-validate-binary-search-tree
0100-same-tree
0101-symmetric-tree
0102-binary-tree-level-order-traversal
0103-binary-tree-zigzag-level-order-traversal
0104-maximum-depth-of-binary-tree
0110-balanced-binary-tree
0124-binary-tree-maximum-path-sum
0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal
0173-binary-search-tree-iterator
0199-binary-tree-right-side-view
0230-kth-smallest-element-in-a-bst
0235-lowest-common-ancestor-of-a-binary-search-tree
0543-diameter-of-binary-tree
0653-two-sum-iv-input-is-a-bst
0662-maximum-width-of-binary-tree
0700-search-in-a-binary-search-tree

Depth-First Search
0094-binary-tree-inorder-traversal
0098-validate-binary-search-tree
0100-same-tree
0101-symmetric-tree
0104-maximum-depth-of-binary-tree
0110-balanced-binary-tree
0124-binary-tree-maximum-path-sum
0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal
0199-binary-tree-right-side-view
0207-course-schedule
0230-kth-smallest-element-in-a-bst
0235-lowest-common-ancestor-of-a-binary-search-tree
0543-diameter-of-binary-tree
0653-two-sum-iv-input-is-a-bst
0662-maximum-width-of-binary-tree
0733-flood-fill
0785-is-graph-bipartite

Binary Tree
0094-binary-tree-inorder-traversal
0098-validate-binary-search-tree
0100-same-tree
0101-symmetric-tree
0102-binary-tree-level-order-traversal
0103-binary-tree-zigzag-level-order-traversal
0104-maximum-depth-of-binary-tree
0110-balanced-binary-tree
0124-binary-tree-maximum-path-sum
0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal
0173-binary-search-tree-iterator
0199-binary-tree-right-side-view
0230-kth-smallest-element-in-a-bst
0235-lowest-common-ancestor-of-a-binary-search-tree
0543-diameter-of-binary-tree
0653-two-sum-iv-input-is-a-bst
0662-maximum-width-of-binary-tree
0700-search-in-a-binary-search-tree

Greedy
0011-container-with-most-water
0134-gas-station
0455-assign-cookies

Breadth-First Search
0100-same-tree
0101-symmetric-tree
0102-binary-tree-level-order-traversal
0103-binary-tree-zigzag-level-order-traversal
0104-maximum-depth-of-binary-tree
0199-binary-tree-right-side-view
0207-course-schedule
0653-two-sum-iv-input-is-a-bst
0662-maximum-width-of-binary-tree
0733-flood-fill
0785-is-graph-bipartite

Binary Search Tree
0004-median-of-two-sorted-arrays
0069-sqrtx
0098-validate-binary-search-tree
0167-two-sum-ii-input-array-is-sorted
0173-binary-search-tree-iterator
0230-kth-smallest-element-in-a-bst
0235-lowest-common-ancestor-of-a-binary-search-tree
0540-single-element-in-a-sorted-array
0653-two-sum-iv-input-is-a-bst
0700-search-in-a-binary-search-tree
0981-time-based-key-value-store

Iterator
0173-binary-search-tree-iterator

Backtracking
0039-combination-sum
0046-permutations
0051-n-queens
0131-palindrome-partitioning

Prefix Sum
0303-range-sum-query-immutable
0525-contiguous-array
0560-subarray-sum-equals-k

Sliding Window
0643-maximum-average-subarray-i

Divide and Conquer
0004-median-of-two-sorted-arrays
0215-kth-largest-element-in-an-array

Heap (Priority Queue)
0215-kth-largest-element-in-an-array

Quickselect
0215-kth-largest-element-in-an-array

Matrix
0733-flood-fill

Union Find
0785-is-graph-bipartite

Graph
0207-course-schedule
0785-is-graph-bipartite

Topological Sort
0207-course-schedule

Memoization
0070-climbing-stairs

About

Solutions to leetcode problems that I solve.

leetcode.com/problemset/all/

Resources

Readme
Activity

Stars

4 stars

Watchers

1 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

 
 
 

Contributors

Languages