GitHub - nryadav18/LeetCode: This Repository contains my Solutions for various LeetCode Problem Solving Questions on difficulty levels like EASY, MEDIUM and HARD. Do check out my Profile by clicking on the Below Link

nryadav18 / LeetCode Public

Notifications You must be signed in to change notification settings
Fork 0
Star 0

This Repository contains my Solutions for various LeetCode Problem Solving Questions on difficulty levels like EASY, MEDIUM and HARD. Do check out my Profile by clicking on the Below Link

leetcode.com/u/Rajeswar_2004/

0 stars 0 forks Branches Tags Activity

Star

Notifications

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 645 Commits
1-two-sum		1-two-sum
100-same-tree		100-same-tree
1005-univalued-binary-tree		1005-univalued-binary-tree
101-symmetric-tree		101-symmetric-tree
1016-subarray-sums-divisible-by-k		1016-subarray-sums-divisible-by-k
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
1034-subarrays-with-k-different-integers		1034-subarrays-with-k-different-integers
1035-cousins-in-binary-tree		1035-cousins-in-binary-tree
1039-find-the-town-judge		1039-find-the-town-judge
1046-max-consecutive-ones-iii		1046-max-consecutive-ones-iii
107-binary-tree-level-order-traversal-ii		107-binary-tree-level-order-traversal-ii
11-container-with-most-water		11-container-with-most-water
1116-maximum-level-sum-of-a-binary-tree		1116-maximum-level-sum-of-a-binary-tree
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
121-best-time-to-buy-and-sell-stock		121-best-time-to-buy-and-sell-stock
1236-n-th-tribonacci-number		1236-n-th-tribonacci-number
125-valid-palindrome		125-valid-palindrome
1254-deepest-leaves-sum		1254-deepest-leaves-sum
1256-rank-transform-of-an-array		1256-rank-transform-of-an-array
1267-remove-zero-sum-consecutive-nodes-from-linked-list		1267-remove-zero-sum-consecutive-nodes-from-linked-list
129-sum-root-to-leaf-numbers		129-sum-root-to-leaf-numbers
1293-three-consecutive-odds		1293-three-consecutive-odds
13-roman-to-integer		13-roman-to-integer
137-single-number-ii		137-single-number-ii
1371-minimum-remove-to-make-valid-parentheses		1371-minimum-remove-to-make-valid-parentheses
1396-count-servers-that-communicate		1396-count-servers-that-communicate
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
143-reorder-list		143-reorder-list
145-binary-tree-postorder-traversal		145-binary-tree-postorder-traversal
1468-check-if-n-and-its-double-exist		1468-check-if-n-and-its-double-exist
147-insertion-sort-list		147-insertion-sort-list
148-sort-list		148-sort-list
1497-design-a-stack-with-increment-operation		1497-design-a-stack-with-increment-operation
1498-find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree		1498-find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree
150-evaluate-reverse-polish-notation		150-evaluate-reverse-polish-notation
1566-check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence		1566-check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence
162-find-peak-element		162-find-peak-element
164-maximum-gap		164-maximum-gap
1666-make-the-string-great		1666-make-the-string-great
169-majority-element		169-majority-element
1737-maximum-nesting-depth-of-the-parentheses		1737-maximum-nesting-depth-of-the-parentheses
1762-furthest-building-you-can-reach		1762-furthest-building-you-can-reach
1765-merge-in-between-linked-lists		1765-merge-in-between-linked-lists
1786-count-the-number-of-consistent-strings		1786-count-the-number-of-consistent-strings
1787-sum-of-absolute-differences-in-a-sorted-array		1787-sum-of-absolute-differences-in-a-sorted-array
18-4sum		18-4sum
1802-number-of-students-unable-to-eat-lunch		1802-number-of-students-unable-to-eat-lunch
1850-minimum-length-of-string-after-deleting-similar-ends		1850-minimum-length-of-string-after-deleting-similar-ends
1876-map-of-highest-peak		1876-map-of-highest-peak
19-remove-nth-node-from-end-of-list		19-remove-nth-node-from-end-of-list
1908-recyclable-and-low-fat-products		1908-recyclable-and-low-fat-products
1993-sum-of-all-subset-xor-totals		1993-sum-of-all-subset-xor-totals
2-add-two-numbers		2-add-two-numbers
20-valid-parentheses		20-valid-parentheses
2006-find-the-student-that-will-replace-the-chalk		2006-find-the-student-that-will-replace-the-chalk
202-happy-number		202-happy-number
205-isomorphic-strings		205-isomorphic-strings
206-reverse-linked-list		206-reverse-linked-list
208-implement-trie-prefix-tree		208-implement-trie-prefix-tree
21-merge-two-sorted-lists		21-merge-two-sorted-lists
2132-convert-1d-array-into-2d-array		2132-convert-1d-array-into-2d-array
2145-grid-game		2145-grid-game
216-combination-sum-iii		216-combination-sum-iii
217-contains-duplicate		217-contains-duplicate
219-contains-duplicate-ii		219-contains-duplicate-ii
2195-time-needed-to-buy-tickets		2195-time-needed-to-buy-tickets
22-generate-parentheses		22-generate-parentheses
2216-delete-the-middle-node-of-a-linked-list		2216-delete-the-middle-node-of-a-linked-list
2232-adding-spaces-to-a-string		2232-adding-spaces-to-a-string
2236-maximum-twin-sum-of-a-linked-list		2236-maximum-twin-sum-of-a-linked-list
225-implement-stack-using-queues		225-implement-stack-using-queues
226-invert-binary-tree		226-invert-binary-tree
2271-rearrange-array-elements-by-sign		2271-rearrange-array-elements-by-sign
2299-merge-nodes-in-between-zeros		2299-merge-nodes-in-between-zeros
23-merge-k-sorted-lists		23-merge-k-sorted-lists
230-kth-smallest-element-in-a-bst		230-kth-smallest-element-in-a-bst
231-power-of-two		231-power-of-two
232-implement-queue-using-stacks		232-implement-queue-using-stacks
2323-minimum-bit-flips-to-convert-number		2323-minimum-bit-flips-to-convert-number
234-palindrome-linked-list		234-palindrome-linked-list
2358-number-of-ways-to-split-array		2358-number-of-ways-to-split-array
237-delete-node-in-a-linked-list		237-delete-node-in-a-linked-list
238-product-of-array-except-self		238-product-of-array-except-self
2384-root-equals-sum-of-children		2384-root-equals-sum-of-children
239-sliding-window-maximum		239-sliding-window-maximum
24-swap-nodes-in-pairs		24-swap-nodes-in-pairs
2493-reverse-odd-levels-of-binary-tree		2493-reverse-odd-levels-of-binary-tree
25-reverse-nodes-in-k-group		25-reverse-nodes-in-k-group
2527-count-subarrays-with-fixed-bounds		2527-count-subarrays-with-fixed-bounds
2571-find-the-pivot-integer		2571-find-the-pivot-integer
2572-append-characters-to-string-to-make-subsequence		2572-append-characters-to-string-to-make-subsequence
26-remove-duplicates-from-sorted-array		26-remove-duplicates-from-sorted-array
260-single-number-iii		260-single-number-iii
2634-minimum-common-value		2634-minimum-common-value
268-missing-number		268-missing-number

About

This Repository contains my Solutions for various LeetCode Problem Solving Questions on difficulty levels like EASY, MEDIUM and HARD. Do check out my Profile by clicking on the Below Link

leetcode.com/u/Rajeswar_2004/