GitHub - devfinwiz/LeetCode-Feeder: A repository designed for novice developers to make open-source contributions with just a few clicks. Get your pull request merged in under 12 hours!

Steps to Get Started with Contributing

Fork this repository: 🍴 Fork this repository. Don't change the name of the repository while forking it to avoid confusion.
Add LeetSync extension to Chrome: 🛠️ Install LeetSync extension in Chrome.
Open LeetSync extension: 🌐 Open the LeetSync extension you just added in step 2.
Complete Setup: ✔️ Click on 'Complete Setup', then 'Login with GitHub', and finally 'Authorize' to authenticate LeetSync with your GitHub account.
Re-open LeetSync extension: 🔄 Re-open the LeetSync extension window.
Copy Repository URL: 📋 Copy the URL of the forked repository (the one visible on your profile) and paste it into the LeetSync extension window.
Ready to go!: 🚀 You are now set up and ready to contribute!
Solve Leetcode Problems: 💡 Open LeetCode, select a problem, solve it, hit submit, and wait for 5 seconds upon successful submission before moving on to the next problem.
Commit to Forked Repository: 💾 The problem you just solved will be committed to your forked repository automatically.
Raise Pull Request: 🎉 Click on 'Contribute' from the forked repository and raise a pull request with the LeetCode problem number as the title of the pull request.

Follow these steps to seamlessly contribute to this repository using LeetSync! Happy coding! 😊

Name		Name	Last commit message	Last commit date
Latest commit History 985 Commits
0397-integer-replacement		0397-integer-replacement
1-two-sum		1-two-sum
100-same-tree		100-same-tree
101-symmetric-tree		101-symmetric-tree
102-binary-tree-level-order-traversal		102-binary-tree-level-order-traversal
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
105-construct-binary-tree-from-preorder-and-inorder-traversal		105-construct-binary-tree-from-preorder-and-inorder-traversal
1051-height-checker		1051-height-checker
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
108-convert-sorted-array-to-binary-search-tree		108-convert-sorted-array-to-binary-search-tree
109-convert-sorted-list-to-binary-search-tree		109-convert-sorted-list-to-binary-search-tree
11-container-with-most-water		11-container-with-most-water
110-balanced-binary-tree		110-balanced-binary-tree
111-minimum-depth-of-binary-tree		111-minimum-depth-of-binary-tree
112-path-sum		112-path-sum
1122-relative-sort-array		1122-relative-sort-array
113-path-sum-ii		113-path-sum-ii
1148-article-views-i		1148-article-views-i
116-populating-next-right-pointers-in-each-node		116-populating-next-right-pointers-in-each-node
117-populating-next-right-pointers-in-each-node-ii		117-populating-next-right-pointers-in-each-node-ii
118-pascals-triangle		118-pascals-triangle
119-pascals-triangle-ii		119-pascals-triangle-ii
12-integer-to-roman		12-integer-to-roman
120-triangle		120-triangle
121-best-time-to-buy-and-sell-stock		121-best-time-to-buy-and-sell-stock
125-valid-palindrome		125-valid-palindrome
128-longest-consecutive-sequence		128-longest-consecutive-sequence
129-sum-root-to-leaf-numbers		129-sum-root-to-leaf-numbers
13-roman-to-integer		13-roman-to-integer
130-surrounded-regions		130-surrounded-regions
131-palindrome-partitioning		131-palindrome-partitioning
133-clone-graph		133-clone-graph
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
136-single-number		136-single-number
137-single-number-ii		137-single-number-ii
138-copy-list-with-random-pointer		138-copy-list-with-random-pointer
14-longest-common-prefix		14-longest-common-prefix
1407-top-travellers		1407-top-travellers
141-linked-list-cycle		141-linked-list-cycle
142-linked-list-cycle-ii		142-linked-list-cycle-ii
143-reorder-list		143-reorder-list
144-binary-tree-preorder-traversal		144-binary-tree-preorder-traversal
145-binary-tree-postorder-traversal		145-binary-tree-postorder-traversal
146-lru-cache		146-lru-cache
147-insertion-sort-list		147-insertion-sort-list
148-sort-list		148-sort-list
1484-group-sold-products-by-the-date		1484-group-sold-products-by-the-date
15-3sum		15-3sum
151-reverse-words-in-a-string		151-reverse-words-in-a-string
152-maximum-product-subarray		152-maximum-product-subarray
1527-patients-with-a-condition		1527-patients-with-a-condition
1528-shuffle-string		1528-shuffle-string
153-find-minimum-in-rotated-sorted-array		153-find-minimum-in-rotated-sorted-array
1581-customer-who-visited-but-did-not-make-any-transactions		1581-customer-who-visited-but-did-not-make-any-transactions
16-3sum-closest		16-3sum-closest
162-find-peak-element		162-find-peak-element
166-fraction-to-recurring-decimal		166-fraction-to-recurring-decimal
1667-fix-names-in-a-table		1667-fix-names-in-a-table
168-excel-sheet-column-title		168-excel-sheet-column-title
169-majority-element		169-majority-element
17-letter-combinations-of-a-phone-number		17-letter-combinations-of-a-phone-number
171-excel-sheet-column-number		171-excel-sheet-column-number
1757-recyclable-and-low-fat-products		1757-recyclable-and-low-fat-products
176-second-highest-salary		176-second-highest-salary
178-rank-scores		178-rank-scores
179-largest-number		179-largest-number
1790-check-if-one-string-swap-can-make-strings-equal		1790-check-if-one-string-swap-can-make-strings-equal
18-4sum		18-4sum
181-employees-earning-more-than-their-managers		181-employees-earning-more-than-their-managers
182-duplicate-emails		182-duplicate-emails
183-customers-who-never-order		183-customers-who-never-order
184-department-highest-salary		184-department-highest-salary
187-repeated-dna-sequences		187-repeated-dna-sequences
1873-calculate-special-bonus		1873-calculate-special-bonus
19-remove-nth-node-from-end-of-list		19-remove-nth-node-from-end-of-list
191-number-of-1-bits		191-number-of-1-bits
1945-sum-of-digits-of-string-after-convert		1945-sum-of-digits-of-string-after-convert
196-delete-duplicate-emails		196-delete-duplicate-emails
1965-employees-with-missing-information		1965-employees-with-missing-information
197-rising-temperature		197-rising-temperature
2-add-two-numbers		2-add-two-numbers
20-valid-parentheses		20-valid-parentheses
200-number-of-islands		200-number-of-islands
202-happy-number		202-happy-number
206-reverse-linked-list		206-reverse-linked-list
2068-check-whether-two-strings-are-almost-equivalent		2068-check-whether-two-strings-are-almost-equivalent
209-minimum-size-subarray-sum		209-minimum-size-subarray-sum
21-merge-two-sorted-lists		21-merge-two-sorted-lists
2108-find-first-palindromic-string-in-the-array		2108-find-first-palindromic-string-in-the-array
2119-a-number-after-a-double-reversal		2119-a-number-after-a-double-reversal
213-house-robber-ii		213-house-robber-ii
215-kth-largest-element-in-an-array		215-kth-largest-element-in-an-array
2164-sort-even-and-odd-indices-independently		2164-sort-even-and-odd-indices-independently
2169-count-operations-to-obtain-zero		2169-count-operations-to-obtain-zero
217-contains-duplicate		217-contains-duplicate
2177-find-three-consecutive-integers-that-sum-to-a-given-number		2177-find-three-consecutive-integers-that-sum-to-a-given-number
2180-count-integers-with-even-digit-sum		2180-count-integers-with-even-digit-sum

License

devfinwiz/LeetCode-Feeder

Folders and files

Latest commit

History