Skip to content

About

Here are some practice questions of all topic

Activity

Stars

0 stars

Watchers

1 watching

Forks

0 forks
Report repository
BranchesTags

Latest commit

 

History

2,033 Commits

Folders and files

NameName
Last commit message
Last commit date
0 - 1 Knapsack Problem - GFG
0 - 1 Knapsack Problem - GFG
 
 
0001-two-sum
0001-two-sum
 
 
0002-add-two-numbers
0002-add-two-numbers
 
 
0005-longest-palindromic-substring
0005-longest-palindromic-substring
 
 
0012-integer-to-roman
0012-integer-to-roman
 
 
0021-merge-two-sorted-lists
0021-merge-two-sorted-lists
 
 
0024-swap-nodes-in-pairs
0024-swap-nodes-in-pairs
 
 
0025-reverse-nodes-in-k-group
0025-reverse-nodes-in-k-group
 
 
0038-count-and-say
0038-count-and-say
 
 
0043-multiply-strings
0043-multiply-strings
 
 
0048-rotate-image
0048-rotate-image
 
 
0049-group-anagrams
0049-group-anagrams
 
 
0059-spiral-matrix-ii
0059-spiral-matrix-ii
 
 
0062-unique-paths
0062-unique-paths
 
 
0070-climbing-stairs
0070-climbing-stairs
 
 
0082-remove-duplicates-from-sorted-list-ii
0082-remove-duplicates-from-sorted-list-ii
 
 
0091-decode-ways
0091-decode-ways
 
 
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
 
 
0105-construct-binary-tree-from-preorder-and-inorder-traversal
0105-construct-binary-tree-from-preorder-and-inorder-traversal
 
 
0108-convert-sorted-array-to-binary-search-tree
0108-convert-sorted-array-to-binary-search-tree
 
 
0113-path-sum-ii
0113-path-sum-ii
 
 
0119-pascals-triangle-ii
0119-pascals-triangle-ii
 
 
0121-best-time-to-buy-and-sell-stock
0121-best-time-to-buy-and-sell-stock
 
 
0142-linked-list-cycle-ii
0142-linked-list-cycle-ii
 
 
0143-reorder-list
0143-reorder-list
 
 
0155-min-stack
0155-min-stack
 
 
0160-intersection-of-two-linked-lists
0160-intersection-of-two-linked-lists
 
 
0173-binary-search-tree-iterator
0173-binary-search-tree-iterator
 
 
0176-second-highest-salary
0176-second-highest-salary
 
 
0187-repeated-dna-sequences
0187-repeated-dna-sequences
 
 
0199-binary-tree-right-side-view
0199-binary-tree-right-side-view
 
 
0200-number-of-islands
0200-number-of-islands
 
 
0206-reverse-linked-list
0206-reverse-linked-list
 
 
0215-kth-largest-element-in-an-array
0215-kth-largest-element-in-an-array
 
 
0219-contains-duplicate-ii
0219-contains-duplicate-ii
 
 
0230-kth-smallest-element-in-a-bst
0230-kth-smallest-element-in-a-bst
 
 
0235-lowest-common-ancestor-of-a-binary-search-tree
0235-lowest-common-ancestor-of-a-binary-search-tree
 
 
0236-lowest-common-ancestor-of-a-binary-tree
0236-lowest-common-ancestor-of-a-binary-tree
 
 
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
 
 
0240-search-a-2d-matrix-ii
0240-search-a-2d-matrix-ii
 
 
0278-first-bad-version
0278-first-bad-version
 
 
0290-word-pattern
0290-word-pattern
 
 
0297-serialize-and-deserialize-binary-tree
0297-serialize-and-deserialize-binary-tree
 
 
0299-bulls-and-cows
0299-bulls-and-cows
 
 
0334-increasing-triplet-subsequence
0334-increasing-triplet-subsequence
 
 
0347-top-k-frequent-elements
0347-top-k-frequent-elements
 
 
0394-decode-string
0394-decode-string
 
 
0409-longest-palindrome
0409-longest-palindrome
 
 
0415-add-strings
0415-add-strings
 
 
0424-longest-repeating-character-replacement
0424-longest-repeating-character-replacement
 
 
0435-non-overlapping-intervals
0435-non-overlapping-intervals
 
 
0438-find-all-anagrams-in-a-string
0438-find-all-anagrams-in-a-string
 
 
0448-find-all-numbers-disappeared-in-an-array
0448-find-all-numbers-disappeared-in-an-array
 
 
0450-delete-node-in-a-bst
0450-delete-node-in-a-bst
 
 
0509-fibonacci-number
0509-fibonacci-number
 
 
0523-continuous-subarray-sum
0523-continuous-subarray-sum
 
 
0560-subarray-sum-equals-k
0560-subarray-sum-equals-k
 
 
0589-n-ary-tree-preorder-traversal
0589-n-ary-tree-preorder-traversal
 
 
0645-set-mismatch
0645-set-mismatch
 
 
0692-top-k-frequent-words
0692-top-k-frequent-words
 
 
0707-design-linked-list
0707-design-linked-list
 
 
0733-flood-fill
0733-flood-fill
 
 
0746-min-cost-climbing-stairs
0746-min-cost-climbing-stairs
 
 
0763-partition-labels
0763-partition-labels
 
 
0766-toeplitz-matrix
0766-toeplitz-matrix
 
 
0835-image-overlap
0835-image-overlap
 
 
0841-keys-and-rooms
0841-keys-and-rooms
 
 
0844-backspace-string-compare
0844-backspace-string-compare
 
 
0876-middle-of-the-linked-list
0876-middle-of-the-linked-list
 
 
0973-k-closest-points-to-origin
0973-k-closest-points-to-origin
 
 
0976-largest-perimeter-triangle
0976-largest-perimeter-triangle
 
 
0997-find-the-town-judge
0997-find-the-town-judge
 
 
1-two-sum
1-two-sum
 
 
100-same-tree
100-same-tree
 
 
1008-construct-binary-search-tree-from-preorder-traversal
1008-construct-binary-search-tree-from-preorder-traversal
 
 
101-symmetric-tree
101-symmetric-tree
 
 
1011-capacity-to-ship-packages-within-d-days
1011-capacity-to-ship-packages-within-d-days
 
 
1017-convert-to-base-2
1017-convert-to-base-2
 
 
102-binary-tree-level-order-traversal
102-binary-tree-level-order-traversal
 
 
1021-remove-outermost-parentheses
1021-remove-outermost-parentheses
 
 
1022-sum-of-root-to-leaf-binary-numbers
1022-sum-of-root-to-leaf-binary-numbers
 
 
1026-maximum-difference-between-node-and-ancestor
1026-maximum-difference-between-node-and-ancestor
 
 
103-binary-tree-zigzag-level-order-traversal
103-binary-tree-zigzag-level-order-traversal
 
 
1038-binary-search-tree-to-greater-sum-tree
1038-binary-search-tree-to-greater-sum-tree
 
 
104-maximum-depth-of-binary-tree
104-maximum-depth-of-binary-tree
 
 
1043-partition-array-for-maximum-sum
1043-partition-array-for-maximum-sum
 
 
1046-last-stone-weight
1046-last-stone-weight
 
 
1047-remove-all-adjacent-duplicates-in-string
1047-remove-all-adjacent-duplicates-in-string
 
 
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
 
 
106-construct-binary-tree-from-inorder-and-postorder-traversal
106-construct-binary-tree-from-inorder-and-postorder-traversal
 
 
107-binary-tree-level-order-traversal-ii
107-binary-tree-level-order-traversal-ii
 
 
1079-letter-tile-possibilities
1079-letter-tile-possibilities
 
 
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
 
 

About

Here are some practice questions of all topic

Activity

Stars

0 stars

Watchers

1 watching

Forks

0 forks
Report repository

Releases

Packages

Contributors

Languages