Coding-Challenge

Starting #30DaysOfCode Challenge from Jan 3. I will be solving various coding questions Daily!

Here is 30 days of code challenge

Contribute 😊 ❤️

Any suggestions are always welcomed.

Name		Name	Last commit message	Last commit date
0005-longest-palindromic-substring		0005-longest-palindromic-substring
1-two-sum		1-two-sum
10-regular-expression-matching		10-regular-expression-matching
100-same-tree		100-same-tree
1004-max-consecutive-ones-iii		1004-max-consecutive-ones-iii
1008-construct-binary-search-tree-from-preorder-traversal		1008-construct-binary-search-tree-from-preorder-traversal
101-symmetric-tree		101-symmetric-tree
1011-capacity-to-ship-packages-within-d-days		1011-capacity-to-ship-packages-within-d-days
1013-partition-array-into-three-parts-with-equal-sum		1013-partition-array-into-three-parts-with-equal-sum
102-binary-tree-level-order-traversal		102-binary-tree-level-order-traversal
1024-video-stitching		1024-video-stitching
1027-longest-arithmetic-subsequence		1027-longest-arithmetic-subsequence
103-binary-tree-zigzag-level-order-traversal		103-binary-tree-zigzag-level-order-traversal
1036-rotting-oranges		1036-rotting-oranges
105-construct-binary-tree-from-preorder-and-inorder-traversal		105-construct-binary-tree-from-preorder-and-inorder-traversal
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
1074-number-of-submatrices-that-sum-to-target		1074-number-of-submatrices-that-sum-to-target
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
1091-shortest-path-in-binary-matrix		1091-shortest-path-in-binary-matrix
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
1110-delete-nodes-and-return-forest		1110-delete-nodes-and-return-forest
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
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
1192-critical-connections-in-a-network		1192-critical-connections-in-a-network
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
122-best-time-to-buy-and-sell-stock-ii		122-best-time-to-buy-and-sell-stock-ii
123-best-time-to-buy-and-sell-stock-iii		123-best-time-to-buy-and-sell-stock-iii
124-binary-tree-maximum-path-sum		124-binary-tree-maximum-path-sum
1248-count-number-of-nice-subarrays		1248-count-number-of-nice-subarrays
125-valid-palindrome		125-valid-palindrome
1254-number-of-closed-islands		1254-number-of-closed-islands
126-word-ladder-ii		126-word-ladder-ii
1266-minimum-time-visiting-all-points		1266-minimum-time-visiting-all-points
1268-search-suggestions-system		1268-search-suggestions-system
127-word-ladder		127-word-ladder
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
1312-minimum-insertion-steps-to-make-a-string-palindrome		1312-minimum-insertion-steps-to-make-a-string-palindrome
132-palindrome-partitioning-ii		132-palindrome-partitioning-ii
1326-minimum-number-of-taps-to-open-to-water-a-garden		1326-minimum-number-of-taps-to-open-to-water-a-garden
133-clone-graph		133-clone-graph
1332-remove-palindromic-subsequences		1332-remove-palindromic-subsequences
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
1347-minimum-number-of-steps-to-make-two-strings-anagram		1347-minimum-number-of-steps-to-make-two-strings-anagram
135-candy		135-candy
1351-count-negative-numbers-in-a-sorted-matrix		1351-count-negative-numbers-in-a-sorted-matrix
1358-number-of-substrings-containing-all-three-characters		1358-number-of-substrings-containing-all-three-characters
136-single-number		136-single-number
1366-rank-teams-by-votes		1366-rank-teams-by-votes
137-single-number-ii		137-single-number-ii
1376-time-needed-to-inform-all-employees		1376-time-needed-to-inform-all-employees
138-copy-list-with-random-pointer		138-copy-list-with-random-pointer
139-word-break		139-word-break
14-longest-common-prefix		14-longest-common-prefix
140-word-break-ii		140-word-break-ii
141-linked-list-cycle		141-linked-list-cycle
1414-find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k		1414-find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k
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
1424-diagonal-traverse-ii		1424-diagonal-traverse-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
1480-running-sum-of-1d-array		1480-running-sum-of-1d-array
1482-minimum-number-of-days-to-make-m-bouquets		1482-minimum-number-of-days-to-make-m-bouquets
15-3sum		15-3sum
150-evaluate-reverse-polish-notation		150-evaluate-reverse-polish-notation
1507-reformat-date		1507-reformat-date
151-reverse-words-in-a-string		151-reverse-words-in-a-string
152-maximum-product-subarray		152-maximum-product-subarray
153-find-minimum-in-rotated-sorted-array		153-find-minimum-in-rotated-sorted-array
155-min-stack		155-min-stack
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
1636-sort-array-by-increasing-frequency		1636-sort-array-by-increasing-frequency
164-maximum-gap		164-maximum-gap
1642-furthest-building-you-can-reach		1642-furthest-building-you-can-reach
165-compare-version-numbers		165-compare-version-numbers
1658-minimum-operations-to-reduce-x-to-zero		1658-minimum-operations-to-reduce-x-to-zero

Navigation Menu

Repository files navigation

Coding-Challenge

Contribute 😊 ❤️

About

Releases

Packages

Contributors

Languages

Latest commit

History

Folders and files

Repository files navigation

Coding-Challenge

Contribute 😊 ❤️

About

Topics

Resources

Stars

Watchers

Forks

Releases

Packages

Contributors

Languages