Name		Name	Last commit message	Last commit date
Latest commit History 312 Commits
0001-two-sum		0001-two-sum
0009-palindrome-number		0009-palindrome-number
0051-n-queens		0051-n-queens
0164-maximum-gap		0164-maximum-gap
0995-minimum-number-of-k-consecutive-bit-flips		0995-minimum-number-of-k-consecutive-bit-flips
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
106-Construct Binary Tree from Inorder and Postorder Traversal		106-Construct Binary Tree from Inorder and Postorder Traversal
110-balanced-binary-tree		110-balanced-binary-tree
113-path-sum-ii		113-path-sum-ii
1143-longest-common-subsequence		1143-longest-common-subsequence
121-best-time-to-buy-and-sell-stock		121-best-time-to-buy-and-sell-stock
122-best-time-to-buy-and-sell-stock-ii		122-best-time-to-buy-and-sell-stock-ii
13-roman-to-integer		13-roman-to-integer
1302-deepest-leaves-sum		1302-deepest-leaves-sum
1328 Break a Palindrome		1328 Break a Palindrome
1332-remove-palindromic-subsequences		1332-remove-palindromic-subsequences
1342-number-of-steps-to-reduce-a-number-to-zero		1342-number-of-steps-to-reduce-a-number-to-zero
1343-number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold		1343-number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold
1379-find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree		1379-find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree
1396-design-underground-system		1396-design-underground-system
1457-pseudo-palindromic-paths-in-a-binary-tree		1457-pseudo-palindromic-paths-in-a-binary-tree
1470-shuffle-the-array		1470-shuffle-the-array
1480-running-sum-of-1d-array		1480-running-sum-of-1d-array
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
1679-max-number-of-k-sum-pairs		1679-max-number-of-k-sum-pairs
1680-concatenation-of-consecutive-binary-numbers		1680-concatenation-of-consecutive-binary-numbers
169-majority-element		169-majority-element
1695-maximum-erasure-value		1695-maximum-erasure-value
1757-recyclable-and-low-fat-products		1757-recyclable-and-low-fat-products
1770-maximum-score-from-performing-multiplication-operations		1770-maximum-score-from-performing-multiplication-operations
1795-rearrange-products-table		1795-rearrange-products-table
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
1929-concatenation-of-array		1929-concatenation-of-array
199-binary-tree-right-side-view		199-binary-tree-right-side-view
1996-the-number-of-weak-characters-in-the-game		1996-the-number-of-weak-characters-in-the-game
1998.GCD-Sort-of-an-Array		1998.GCD-Sort-of-an-Array
2007-find-original-array-from-doubled-array		2007-find-original-array-from-doubled-array
217-contains-duplicate		217-contains-duplicate
219-contains-duplicate-ii		219-contains-duplicate-ii
2235-add-two-integers		2235-add-two-integers
2236-root-equals-sum-of-children		2236-root-equals-sum-of-children
229-majority-element-ii		229-majority-element-ii
230-kth-smallest-element-in-a-bst		230-kth-smallest-element-in-a-bst
2309-GreatestEnglish Letter in Upper and Lower Case		2309-GreatestEnglish Letter in Upper and Lower Case
231-power-of-two		231-power-of-two
2336-smallest-number-in-infinite-set		2336-smallest-number-in-infinite-set
2351-first-letter-to-appear-twice		2351-first-letter-to-appear-twice
2358-maximum-number-of-groups-entering-a-competition		2358-maximum-number-of-groups-entering-a-competition
2359-find-closest-node-to-given-two-nodes		2359-find-closest-node-to-given-two-nodes
236-lowest-common-ancestor-of-a-binary-tree		236-lowest-common-ancestor-of-a-binary-tree
2363-merge-similar-items		2363-merge-similar-items
2365-Task-scheduler-ii		2365-Task-scheduler-ii
2368-reachable-nodes-with-restrictions		2368-reachable-nodes-with-restrictions
2373-largest-local-values-in-a-matrix		2373-largest-local-values-in-a-matrix
2374-node-with-highest-edge-score		2374-node-with-highest-edge-score
2375-construct-smallest-number-from-di-string		2375-construct-smallest-number-from-di-string
2380-time-needed-to-rearrange-a-binary-string		2380-time-needed-to-rearrange-a-binary-string
2396-strictly-palindromic-number		2396-strictly-palindromic-number
2434-using-a-robot-to-print-the-lexicographically-smallest-string		2434-using-a-robot-to-print-the-lexicographically-smallest-string
26-remove-duplicates-from-sorted-array		26-remove-duplicates-from-sorted-array
264-ugly-number-ii		264-ugly-number-ii
268-missing-number		268-missing-number
287-find-the-duplicate-number		287-find-the-duplicate-number
3-longest-substring-without-repeating-characters		3-longest-substring-without-repeating-characters
326-power-of-three		326-power-of-three
331-verify-preorder-serialization-of-a-binary-tree		331-verify-preorder-serialization-of-a-binary-tree
337-house-robber-iii		337-house-robber-iii
342-power-of-four		342-power-of-four
343-integer-break		343-integer-break
344-reverse-string		344-reverse-string
347-top-k-frequent-elements		347-top-k-frequent-elements
354-russian-doll-envelopes		354-russian-doll-envelopes
357-count-numbers-with-unique-digits		357-count-numbers-with-unique-digits
363-max-sum-of-rectangle-no-larger-than-k		363-max-sum-of-rectangle-no-larger-than-k
365-water-and-jug-problem		365-water-and-jug-problem
368-largest-divisible-subset		368-largest-divisible-subset
373-find-k-pairs-with-smallest-sums		373-find-k-pairs-with-smallest-sums
374-guess-number-higher-or-lower		374-guess-number-higher-or-lower
376-wiggle-subsequence		376-wiggle-subsequence
377-combination-sum-iv		377-combination-sum-iv
378-kth-smallest-element-in-a-sorted-matrix		378-kth-smallest-element-in-a-sorted-matrix
380-insert-delete-getrandom-o1		380-insert-delete-getrandom-o1
383-ransom-note		383-ransom-note
387-first-unique-character-in-a-string		387-first-unique-character-in-a-string
389-find-the-difference		389-find-the-difference
392-is-subsequence		392-is-subsequence
393-utf-8-validation		393-utf-8-validation
395-longest-substring-with-at-least-k-repeating-characters		395-longest-substring-with-at-least-k-repeating-characters
402-remove-k-digits		402-remove-k-digits
403-frog-jump		403-frog-jump
406-queue-reconstruction-by-height		406-queue-reconstruction-by-height
409-longest-palindrome		409-longest-palindrome
412-fizz-buzz		412-fizz-buzz
413-arithmetic-slices		413-arithmetic-slices

Repository files navigation

Hacktoberfest2022

PRs Welcome Open Source Love contributions welcome Hacktoberfest-22

📌Steps to contribute.

1) Register your GitHub ID on Hackoberfest Website

2) Fork this repository.

Do the following steps back in my repository(only that will trigger a pull request) and not in your forked one

3) Add anything you want in the code so that you can create the good fronted view of the website.

4) Send a Pull request

I'll take a look at change and then merge them with master branch.

Happy coding fellas!!💕✨

Don't worry newcomers!! Everyone's PRs will be merged,just follow the steps properly!!

🙌 Make this your first step to development and open source. Get the confidence you require!!

All of your suggestions are welcome!!

📌Some tips to add your code in the repository: ✨

1) Check if your code is already present the library.

2) If it is present then please don't add your code. If you could make the existing code better, then go ahead.

3) Follow the camelCase naming convention for source files.

4) Make sure you add a folder which contains a readme file containing description of the question and another file which contains its code.

5) Add your code to the proper folder.

NOTE : After successfull submission do not forgot to add your name in CONTRIBUTING.md file.

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Repository files navigation

Hacktoberfest2022

PRs Welcome Open Source Love contributions welcome Hacktoberfest-22

📌Steps to contribute.

1) Register your GitHub ID on Hackoberfest Website

2) Fork this repository.

Do the following steps back in my repository(only that will trigger a pull request) and not in your forked one

3) Add anything you want in the code so that you can create the good fronted view of the website.

4) Send a Pull request

I'll take a look at change and then merge them with master branch.

Happy coding fellas!!💕✨

Don't worry newcomers!! Everyone's PRs will be merged,just follow the steps properly!!

🙌 Make this your first step to development and open source. Get the confidence you require!!

📌Some tips to add your code in the repository: ✨

1) Check if your code is already present the library.

2) If it is present then please don't add your code. If you could make the existing code better, then go ahead.

3) Follow the camelCase naming convention for source files.

4) Make sure you add a folder which contains a readme file containing description of the question and another file which contains its code.

5) Add your code to the proper folder.

NOTE : After successfull submission do not forgot to add your name in CONTRIBUTING.md file.

About

Releases

Packages

Languages

NopeCharon/LeetCode-Solution

Folders and files

Latest commit

History

Repository files navigation

Hacktoberfest2022

PRs Welcome Open Source Love contributions welcome Hacktoberfest-22

📌Steps to contribute.

1) Register your GitHub ID on Hackoberfest Website

2) Fork this repository.

Do the following steps back in my repository(only that will trigger a pull request) and not in your forked one

3) Add anything you want in the code so that you can create the good fronted view of the website.

4) Send a Pull request

I'll take a look at change and then merge them with master branch.

Happy coding fellas!!💕✨

Don't worry newcomers!! Everyone's PRs will be merged,just follow the steps properly!!

🙌 Make this your first step to development and open source. Get the confidence you require!!

📌Some tips to add your code in the repository: ✨

1) Check if your code is already present the library.

2) If it is present then please don't add your code. If you could make the existing code better, then go ahead.

3) Follow the camelCase naming convention for source files.

4) Make sure you add a folder which contains a readme file containing description of the question and another file which contains its code.

5) Add your code to the proper folder.

NOTE : After successfull submission do not forgot to add your name in CONTRIBUTING.md file.

About

Resources

Stars

Watchers

Forks

Releases

Packages 0

Languages

Packages