Skip to content
/ LeetCode_Solutions Public

This is a collection of my leetcode solutions to help me improve my problem solving skills.

4 stars 0 forks Branches Tags Activity
Star
Notifications You must be signed in to change notification settings

devanshukd04/LeetCode_Solutions

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

3,353 Commits
0004-median-of-two-sorted-arrays
0004-median-of-two-sorted-arrays
 
 
0005-longest-palindromic-substring
0005-longest-palindromic-substring
 
 
0006-zigzag-conversion
0006-zigzag-conversion
 
 
0012-integer-to-roman
0012-integer-to-roman
 
 
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
 
 
0038-count-and-say
0038-count-and-say
 
 
0041-first-missing-positive
0041-first-missing-positive
 
 
0045-jump-game-ii
0045-jump-game-ii
 
 
0049-group-anagrams
0049-group-anagrams
 
 
0057-insert-interval
0057-insert-interval
 
 
0062-unique-paths
0062-unique-paths
 
 
0068-text-justification
0068-text-justification
 
 
0076-minimum-window-substring
0076-minimum-window-substring
 
 
0086-partition-list
0086-partition-list
 
 
0092-reverse-linked-list-ii
0092-reverse-linked-list-ii
 
 
0093-restore-ip-addresses
0093-restore-ip-addresses
 
 
0095-unique-binary-search-trees-ii
0095-unique-binary-search-trees-ii
 
 
0096-unique-binary-search-trees
0096-unique-binary-search-trees
 
 
0097-interleaving-string
0097-interleaving-string
 
 
0104-maximum-depth-of-binary-tree
0104-maximum-depth-of-binary-tree
 
 
0116-populating-next-right-pointers-in-each-node
0116-populating-next-right-pointers-in-each-node
 
 
0118-pascals-triangle
0118-pascals-triangle
 
 
0119-pascals-triangle-ii
0119-pascals-triangle-ii
 
 
0131-palindrome-partitioning
0131-palindrome-partitioning
 
 
0132-palindrome-partitioning-ii
0132-palindrome-partitioning-ii
 
 
0133-clone-graph
0133-clone-graph
 
 
0135-candy
0135-candy
 
 
0138-copy-list-with-random-pointer
0138-copy-list-with-random-pointer
 
 
0139-word-break
0139-word-break
 
 
0141-linked-list-cycle
0141-linked-list-cycle
 
 
0219-contains-duplicate-ii
0219-contains-duplicate-ii
 
 
0225-implement-stack-using-queues
0225-implement-stack-using-queues
 
 
0226-invert-binary-tree
0226-invert-binary-tree
 
 
0287-find-the-duplicate-number
0287-find-the-duplicate-number
 
 
0316-remove-duplicate-letters
0316-remove-duplicate-letters
 
 
0332-reconstruct-itinerary
0332-reconstruct-itinerary
 
 
0334-increasing-triplet-subsequence
0334-increasing-triplet-subsequence
 
 
0338-counting-bits
0338-counting-bits
 
 
0341-flatten-nested-list-iterator
0341-flatten-nested-list-iterator
 
 
0342-power-of-four
0342-power-of-four
 
 
0343-integer-break
0343-integer-break
 
 
0352-data-stream-as-disjoint-intervals
0352-data-stream-as-disjoint-intervals
 
 
0377-combination-sum-iv
0377-combination-sum-iv
 
 
0389-find-the-difference
0389-find-the-difference
 
 
0392-is-subsequence
0392-is-subsequence
 
 
0396-rotate-function
0396-rotate-function
 
 
0403-frog-jump
0403-frog-jump
 
 
0427-construct-quad-tree
0427-construct-quad-tree
 
 
0433-minimum-genetic-mutation
0433-minimum-genetic-mutation
 
 
0456-132-pattern
0456-132-pattern
 
 
0458-poor-pigs
0458-poor-pigs
 
 
0459-repeated-substring-pattern
0459-repeated-substring-pattern
 
 
0460-lfu-cache
0460-lfu-cache
 
 
0472-concatenated-words
0472-concatenated-words
 
 
0491-non-decreasing-subsequences
0491-non-decreasing-subsequences
 
 
0501-find-mode-in-binary-search-tree
0501-find-mode-in-binary-search-tree
 
 
0502-ipo
0502-ipo
 
 
0515-find-largest-value-in-each-tree-row
0515-find-largest-value-in-each-tree-row
 
 
0523-continuous-subarray-sum
0523-continuous-subarray-sum
 
 
0540-single-element-in-a-sorted-array
0540-single-element-in-a-sorted-array
 
 
0557-reverse-words-in-a-string-iii
0557-reverse-words-in-a-string-iii
 
 
0567-permutation-in-string
0567-permutation-in-string
 
 
0584-find-customer-referee
0584-find-customer-referee
 
 
0595-big-countries
0595-big-countries
 
 
0620-not-boring-movies
0620-not-boring-movies
 
 
0626-exchange-seats
0626-exchange-seats
 
 
0645-set-mismatch
0645-set-mismatch
 
 
0646-maximum-length-of-pair-chain
0646-maximum-length-of-pair-chain
 
 
0662-maximum-width-of-binary-tree
0662-maximum-width-of-binary-tree
 
 
0692-top-k-frequent-words
0692-top-k-frequent-words
 
 
0706-design-hashmap
0706-design-hashmap
 
 
0725-split-linked-list-in-parts
0725-split-linked-list-in-parts
 
 
0746-min-cost-climbing-stairs
0746-min-cost-climbing-stairs
 
 
0766-toeplitz-matrix
0766-toeplitz-matrix
 
 
0767-reorganize-string
0767-reorganize-string
 
 
0783-minimum-distance-between-bst-nodes
0783-minimum-distance-between-bst-nodes
 
 
0787-cheapest-flights-within-k-stops
0787-cheapest-flights-within-k-stops
 
 
0799-champagne-tower
0799-champagne-tower
 
 
0835-image-overlap
0835-image-overlap
 
 
0844-backspace-string-compare
0844-backspace-string-compare
 
 
0847-shortest-path-visiting-all-nodes
0847-shortest-path-visiting-all-nodes
 
 
0875-koko-eating-bananas
0875-koko-eating-bananas
 
 
0879-profitable-schemes
0879-profitable-schemes
 
 
0880-decoded-string-at-index
0880-decoded-string-at-index
 
 
0896-monotonic-array
0896-monotonic-array
 
 
0905-sort-array-by-parity
0905-sort-array-by-parity
 
 
0926-flip-string-to-monotone-increasing
0926-flip-string-to-monotone-increasing
 
 
0953-verifying-an-alien-dictionary
0953-verifying-an-alien-dictionary
 
 
0976-largest-perimeter-triangle
0976-largest-perimeter-triangle
 
 
0989-add-to-array-form-of-integer
0989-add-to-array-form-of-integer
 
 
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
 
 
1014-best-sightseeing-pair
1014-best-sightseeing-pair
 
 
1019-next-greater-node-in-linked-list
1019-next-greater-node-in-linked-list
 
 
102-binary-tree-level-order-traversal
102-binary-tree-level-order-traversal
 
 

Repository files navigation

LeetCode_Solutions

  • Data Structures is very important to crack any interview.
  • This repository consist of my solutions in leetcode questions in Java.
  • I have made this repository to to save my solutions in structured way.
  • This repository could be really helpful for fresheres who want to learn DSA as they could have a look at it for reference.

About

This is a collection of my leetcode solutions to help me improve my problem solving skills.

Resources

Readme
Activity

Stars

4 stars

Watchers

1 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

No packages published

Languages