Daily LeetCode and GeeksforGeeks Problems update.

Welcome to my LeetCode Daily Solutions repository! In this repository, you will find my daily solutions to various LeetCode problems.

This repository serves as a record of my progress as I learn to solve algorithmic problems from leetcode and geeksforgeeks and improve my problem-solving skills.

Name		Name	Last commit message	Last commit date
Latest commit History 586 Commits
0026-remove-duplicates-from-sorted-array		0026-remove-duplicates-from-sorted-array
0136-single-number		0136-single-number
0189-rotate-array		0189-rotate-array
0268-missing-number		0268-missing-number
0283-move-zeroes		0283-move-zeroes
0485-max-consecutive-ones		0485-max-consecutive-ones
1-two-sum		1-two-sum
100-same-tree		100-same-tree
1008-binary-tree-cameras		1008-binary-tree-cameras
101-symmetric-tree		101-symmetric-tree
102-binary-tree-level-order-traversal		102-binary-tree-level-order-traversal
1029-vertical-order-traversal-of-a-binary-tree		1029-vertical-order-traversal-of-a-binary-tree
103-binary-tree-zigzag-level-order-traversal		103-binary-tree-zigzag-level-order-traversal
1035-cousins-in-binary-tree		1035-cousins-in-binary-tree
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
1050-construct-binary-search-tree-from-preorder-traversal		1050-construct-binary-search-tree-from-preorder-traversal
1056-capacity-to-ship-packages-within-d-days		1056-capacity-to-ship-packages-within-d-days
106-construct-binary-tree-from-inorder-and-postorder-traversal		106-construct-binary-tree-from-inorder-and-postorder-traversal
108-convert-sorted-array-to-binary-search-tree		108-convert-sorted-array-to-binary-search-tree
110-balanced-binary-tree		110-balanced-binary-tree
114-flatten-binary-tree-to-linked-list		114-flatten-binary-tree-to-linked-list
116-populating-next-right-pointers-in-each-node		116-populating-next-right-pointers-in-each-node
121-best-time-to-buy-and-sell-stock		121-best-time-to-buy-and-sell-stock
124-binary-tree-maximum-path-sum		124-binary-tree-maximum-path-sum
128-longest-consecutive-sequence		128-longest-consecutive-sequence
129-sum-root-to-leaf-numbers		129-sum-root-to-leaf-numbers
136-single-number		136-single-number
1408-find-the-smallest-divisor-given-a-threshold		1408-find-the-smallest-divisor-given-a-threshold
144-binary-tree-preorder-traversal		144-binary-tree-preorder-traversal
145-binary-tree-postorder-traversal		145-binary-tree-postorder-traversal
15-3sum		15-3sum
152-maximum-product-subarray		152-maximum-product-subarray
153-find-minimum-in-rotated-sorted-array		153-find-minimum-in-rotated-sorted-array
1605-minimum-number-of-days-to-make-m-bouquets		1605-minimum-number-of-days-to-make-m-bouquets
162-find-peak-element		162-find-peak-element
1646-kth-missing-positive-number		1646-kth-missing-positive-number
1675-magnetic-force-between-two-balls		1675-magnetic-force-between-two-balls
169-majority-element		169-majority-element
173-binary-search-tree-iterator		173-binary-search-tree-iterator
1752-check-if-array-is-sorted-and-rotated		1752-check-if-array-is-sorted-and-rotated
18-4sum		18-4sum
1878-check-if-array-is-sorted-and-rotated		1878-check-if-array-is-sorted-and-rotated
189-rotate-array		189-rotate-array
199-binary-tree-right-side-view		199-binary-tree-right-side-view
222-count-complete-tree-nodes		222-count-complete-tree-nodes
226-invert-binary-tree		226-invert-binary-tree
2271-rearrange-array-elements-by-sign		2271-rearrange-array-elements-by-sign
229-majority-element-ii		229-majority-element-ii
230-kth-smallest-element-in-a-bst		230-kth-smallest-element-in-a-bst
235-lowest-common-ancestor-of-a-binary-search-tree		235-lowest-common-ancestor-of-a-binary-search-tree
236-lowest-common-ancestor-of-a-binary-tree		236-lowest-common-ancestor-of-a-binary-tree
2461-amount-of-time-for-binary-tree-to-be-infected		2461-amount-of-time-for-binary-tree-to-be-infected
283-move-zeroes		283-move-zeroes
297-serialize-and-deserialize-binary-tree		297-serialize-and-deserialize-binary-tree
3-longest-substring-without-repeating-characters		3-longest-substring-without-repeating-characters
31-next-permutation		31-next-permutation
33-search-in-rotated-sorted-array		33-search-in-rotated-sorted-array
337-house-robber-iii		337-house-robber-iii
34-find-first-and-last-position-of-element-in-sorted-array		34-find-first-and-last-position-of-element-in-sorted-array
35-search-insert-position		35-search-insert-position
410-split-array-largest-sum		410-split-array-largest-sum
449-serialize-and-deserialize-bst		449-serialize-and-deserialize-bst
450-delete-node-in-a-bst		450-delete-node-in-a-bst
48-rotate-image		48-rotate-image
485-max-consecutive-ones		485-max-consecutive-ones
493-reverse-pairs		493-reverse-pairs
501-find-mode-in-binary-search-tree		501-find-mode-in-binary-search-tree
53-maximum-subarray		53-maximum-subarray
54-spiral-matrix		54-spiral-matrix
540-single-element-in-a-sorted-array		540-single-element-in-a-sorted-array
56-merge-intervals		56-merge-intervals
560-subarray-sum-equals-k		560-subarray-sum-equals-k
617-merge-two-binary-trees		617-merge-two-binary-trees
652-find-duplicate-subtrees		652-find-duplicate-subtrees
653-two-sum-iv-input-is-a-bst		653-two-sum-iv-input-is-a-bst
662-maximum-width-of-binary-tree		662-maximum-width-of-binary-tree
669-trim-a-binary-search-tree		669-trim-a-binary-search-tree
73-set-matrix-zeroes		73-set-matrix-zeroes
75-sort-colors		75-sort-colors
783-search-in-a-binary-search-tree		783-search-in-a-binary-search-tree
784-insert-into-a-binary-search-tree		784-insert-into-a-binary-search-tree
792-binary-search		792-binary-search
81-search-in-rotated-sorted-array-ii		81-search-in-rotated-sorted-array-ii
88-merge-sorted-array		88-merge-sorted-array
893-all-nodes-distance-k-in-binary-tree		893-all-nodes-distance-k-in-binary-tree
907-koko-eating-bananas		907-koko-eating-bananas
925-construct-binary-tree-from-preorder-and-postorder-traversal		925-construct-binary-tree-from-preorder-and-postorder-traversal
94-binary-tree-inorder-traversal		94-binary-tree-inorder-traversal
975-range-sum-of-bst		975-range-sum-of-bst
98-validate-binary-search-tree		98-validate-binary-search-tree
99-recover-binary-search-tree		99-recover-binary-search-tree
Difficulty: Basic/Largest Element in Array		Difficulty: Basic/Largest Element in Array
Difficulty: Easy		Difficulty: Easy
Difficulty: Hard/Minimize Max Distance to Gas Station		Difficulty: Hard/Minimize Max Distance to Gas Station
Difficulty: Medium		Difficulty: Medium
Easy		Easy
Hard		Hard
Medium		Medium
Path-to-Given-Node		Path-to-Given-Node

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Repository files navigation

Daily LeetCode and GeeksforGeeks Problems update.

About

Releases

Packages

Languages

turjoc120/leetcoding

Folders and files

Latest commit

History

Repository files navigation

Daily LeetCode and GeeksforGeeks Problems update.

About

Resources

Stars

Watchers

Forks

Releases

Packages 0

Languages

Packages