DSA-hacktoberfest

Add your Solutions of leetcode and gfg Practice with Proper problem descrition in Readmi.md file and each problem in separate folder for reference look other folder once

How to Contribute (Updated)

For contributions in this repository, please read CONTRIBUTING.md first. (Please pull the changes from this repo if you have already forked the repository and are facing conflicts)
If you like the repository, please star it.
Try to add more and more Files 📂

Learning Resources

Creating a pull request

Learn the Git basics

Note: Add your Solutions of leetcode and gfg Practice with Proper problem description in Redmi.md file and each problem in separate folder

Current Solutions count: 700+

Name		Name	Last commit message	Last commit date
Latest commit History 179 Commits
01-matrix		01-matrix
1's Complement - GFG		1's Complement - GFG
1-two-sum		1-two-sum
100-same-tree		100-same-tree
1009-complement-of-base-10-integer		1009-complement-of-base-10-integer
1010-pairs-of-songs-with-total-durations-divisible-by-60		1010-pairs-of-songs-with-total-durations-divisible-by-60
1011-capacity-to-ship-packages-within-d-days		1011-capacity-to-ship-packages-within-d-days
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
1021-remove-outermost-parentheses		1021-remove-outermost-parentheses
1022-sum-of-root-to-leaf-binary-numbers		1022-sum-of-root-to-leaf-binary-numbers
1027. Longest Arithmetic Subsequence		1027. Longest Arithmetic Subsequence
1029-two-city-scheduling		1029-two-city-scheduling
103-binary-tree-zigzag-level-order-traversal		103-binary-tree-zigzag-level-order-traversal
104-maximum-depth-of-binary-tree		104-maximum-depth-of-binary-tree
1041-robot-bounded-in-circle		1041-robot-bounded-in-circle
1049-last-stone-weight-ii		1049-last-stone-weight-ii
105-construct-binary-tree-from-preorder-and-inorder-traversal		105-construct-binary-tree-from-preorder-and-inorder-traversal
108-convert-sorted-array-to-binary-search-tree		108-convert-sorted-array-to-binary-search-tree
1089-duplicate-zeros		1089-duplicate-zeros
1094-car-pooling		1094-car-pooling
11-container-with-most-water		11-container-with-most-water
110-balanced-binary-tree		110-balanced-binary-tree
1111-maximum-nesting-depth-of-two-valid-parentheses-strings		1111-maximum-nesting-depth-of-two-valid-parentheses-strings
112-path-sum		112-path-sum
113-path-sum-ii		113-path-sum-ii
114-flatten-binary-tree-to-linked-list		114-flatten-binary-tree-to-linked-list
1143-longest-common-subsequence		1143-longest-common-subsequence
115-distinct-subsequences		115-distinct-subsequences
1155-number-of-dice-rolls-with-target-sum		1155-number-of-dice-rolls-with-target-sum
116-populating-next-right-pointers-in-each-node		116-populating-next-right-pointers-in-each-node
118-pascals-triangle		118-pascals-triangle
120-triangle		120-triangle
1202-smallest-string-with-swaps		1202-smallest-string-with-swaps
121-best-time-to-buy-and-sell-stock		121-best-time-to-buy-and-sell-stock
1217. Minimum Cost to Move Chips to The Same Position		1217. Minimum Cost to Move Chips to The Same Position
122-best-time-to-buy-and-sell-stock-ii		122-best-time-to-buy-and-sell-stock-ii
1220-count-vowels-permutation		1220-count-vowels-permutation
123-best-time-to-buy-and-sell-stock-iii		123-best-time-to-buy-and-sell-stock-iii
1249-minimum-remove-to-make-valid-parentheses		1249-minimum-remove-to-make-valid-parentheses
126-word-ladder-ii		126-word-ladder-ii
127-word-ladder		127-word-ladder
1283-find-the-smallest-divisor-given-a-threshold		1283-find-the-smallest-divisor-given-a-threshold
1288-remove-covered-intervals		1288-remove-covered-intervals
1291-sequential-digits		1291-sequential-digits
13-Roman-to-Integer		13-Roman-to-Integer
1305-all-elements-in-two-binary-search-trees		1305-all-elements-in-two-binary-search-trees
131-palindrome-partitioning		131-palindrome-partitioning
1328-break-a-palindrome		1328-break-a-palindrome
1329-sort-the-matrix-diagonally		1329-sort-the-matrix-diagonally
133-clone-graph		133-clone-graph
1337-the-k-weakest-rows-in-a-matrix		1337-the-k-weakest-rows-in-a-matrix
134-gas-station		134-gas-station
1342-number-of-steps-to-reduce-a-number-to-zero		1342-number-of-steps-to-reduce-a-number-to-zero
1359-count-all-valid-pickup-and-delivery-options		1359-count-all-valid-pickup-and-delivery-options
136-single-number		136-single-number
1363-largest-multiple-of-three		1363-largest-multiple-of-three
1365-how-many-numbers-are-smaller-than-the-current-number		1365-how-many-numbers-are-smaller-than-the-current-number
138-copy-list-with-random-pointer		138-copy-list-with-random-pointer
1381-design-a-stack-with-increment-operation		1381-design-a-stack-with-increment-operation
1383-maximum-performance-of-a-team		1383-maximum-performance-of-a-team
139-word-break		139-word-break
14-longest-common-prefix		14-longest-common-prefix
141-linked-list-cycle		141-linked-list-cycle
142-linked-list-cycle-ii		142-linked-list-cycle-ii
1423-maximum-points-you-can-obtain-from-cards		1423-maximum-points-you-can-obtain-from-cards
144-binary-tree-preorder-traversal		144-binary-tree-preorder-traversal
1448-count-good-nodes-in-binary-tree		1448-count-good-nodes-in-binary-tree
1457-pseudo-palindromic-paths-in-a-binary-tree		1457-pseudo-palindromic-paths-in-a-binary-tree
146-lru-cache		146-lru-cache
1461-check-if-a-string-contains-all-binary-codes-of-size-k		1461-check-if-a-string-contains-all-binary-codes-of-size-k
1463-Cherry-Pickup-II		1463-Cherry-Pickup-II
1465-maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts		1465-maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts
1470-shuffle-the-array		1470-shuffle-the-array
1472-design-browser-history		1472-design-browser-history
148-sort-list		148-sort-list
1480. Running Sum of 1d Array		1480. Running Sum of 1d Array
1510-stone-game-iv		1510-stone-game-iv
153-find-minimum-in-rotated-sorted-array		153-find-minimum-in-rotated-sorted-array
154-find-minimum-in-rotated-sorted-array-ii		154-find-minimum-in-rotated-sorted-array-ii
155-min-stack		155-min-stack
1552-magnetic-force-between-two-balls		1552-magnetic-force-between-two-balls
1578-minimum-time-to-make-rope-colorful		1578-minimum-time-to-make-rope-colorful
16-3sum-closest		16-3sum-closest
160-intersection-of-two-linked-lists		160-intersection-of-two-linked-lists
162-find-peak-element		162-find-peak-element
165-compare-version-numbers		165-compare-version-numbers
1656-design-an-ordered-stream		1656-design-an-ordered-stream
1672-richest-customer-wealth		1672-richest-customer-wealth
1675-minimize-deviation-in-array		1675-minimize-deviation-in-array
1680-concatenation-of-consecutive-binary-numbers		1680-concatenation-of-consecutive-binary-numbers
169-majority-element		169-majority-element
171-excel-sheet-column-number		171-excel-sheet-column-number
1760-minimum-limit-of-balls-in-a-bag		1760-minimum-limit-of-balls-in-a-bag
1770-maximum-score-from-performing-multiplication-operations		1770-maximum-score-from-performing-multiplication-operations
179-largest-number		179-largest-number
18-4sum		18-4sum
1814-count-nice-pairs-in-an-array		1814-count-nice-pairs-in-an-array
1823-find-the-winner-of-the-circular-game		1823-find-the-winner-of-the-circular-game
1859-sorting-the-sentence		1859-sorting-the-sentence

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Repository files navigation

DSA-hacktoberfest

DSA-hacktoberfest

How to Contribute (Updated)

Learning Resources

About

Releases

Packages

Languages

Priti-7/DSA-hacktoberfest

Folders and files

Latest commit

History

Repository files navigation

DSA-hacktoberfest

DSA-hacktoberfest

How to Contribute (Updated)

Learning Resources

About

Resources

Stars

Watchers

Forks

Releases

Packages 0

Languages

Packages