daily-leetcode

Now that I have graduated and entered the work-force, I want to ensure I am still learning and staying sharp. I haven't done any competitive programming since first-year, when I set a campus record by competing at the ICPC North American Championships. The goal of this repo is to do about an hour of leetcode every day for the next year, which will help me get my edge back while reviving my old github.

If I am able to stay consistent with this goal, it would make for a pretty nice widget on a personal site. I will try to alternate between python and C++

Name		Name	Last commit message	Last commit date
Latest commit History 1,281 Commits
0-README		0-README
1-two-sum		1-two-sum
100-same-tree		100-same-tree
1002-maximum-width-ramp		1002-maximum-width-ramp
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
1025-minimum-cost-for-tickets		1025-minimum-cost-for-tickets
103-binary-tree-zigzag-level-order-traversal		103-binary-tree-zigzag-level-order-traversal
1037-minimum-number-of-k-consecutive-bit-flips		1037-minimum-number-of-k-consecutive-bit-flips
104-maximum-depth-of-binary-tree		104-maximum-depth-of-binary-tree
1044-find-common-characters		1044-find-common-characters
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
1063-best-sightseeing-pair		1063-best-sightseeing-pair
108-convert-sorted-array-to-binary-search-tree		108-convert-sorted-array-to-binary-search-tree
1093-recover-a-tree-from-preorder-traversal		1093-recover-a-tree-from-preorder-traversal
11-container-with-most-water		11-container-with-most-water
1114-binary-search-tree-to-greater-sum-tree		1114-binary-search-tree-to-greater-sum-tree
112-path-sum		112-path-sum
1137-height-checker		1137-height-checker
1138-grumpy-bookstore-owner		1138-grumpy-bookstore-owner
114-flatten-binary-tree-to-linked-list		114-flatten-binary-tree-to-linked-list
1147-flip-columns-for-maximum-number-of-equal-rows		1147-flip-columns-for-maximum-number-of-equal-rows
1160-letter-tile-possibilities		1160-letter-tile-possibilities
117-populating-next-right-pointers-in-each-node-ii		117-populating-next-right-pointers-in-each-node-ii
1196-filling-bookcase-shelves		1196-filling-bookcase-shelves
1197-parsing-a-boolean-expression		1197-parsing-a-boolean-expression
12-integer-to-roman		12-integer-to-roman
120-triangle		120-triangle
1207-delete-nodes-and-return-forest		1207-delete-nodes-and-return-forest
121-best-time-to-buy-and-sell-stock		121-best-time-to-buy-and-sell-stock
1217-relative-sort-array		1217-relative-sort-array
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
1240-stone-game-ii		1240-stone-game-ii
125-valid-palindrome		125-valid-palindrome
1256-rank-transform-of-an-array		1256-rank-transform-of-an-array
127-word-ladder		127-word-ladder
128-longest-consecutive-sequence		128-longest-consecutive-sequence
1285-balance-a-binary-search-tree		1285-balance-a-binary-search-tree
129-sum-root-to-leaf-numbers		129-sum-root-to-leaf-numbers
1293-three-consecutive-odds		1293-three-consecutive-odds
1298-reverse-substrings-between-each-pair-of-parentheses		1298-reverse-substrings-between-each-pair-of-parentheses
13-roman-to-integer		13-roman-to-integer
130-surrounded-regions		130-surrounded-regions
1302-delete-characters-to-make-fancy-string		1302-delete-characters-to-make-fancy-string
1304-longest-happy-string		1304-longest-happy-string
1325-path-with-maximum-probability		1325-path-with-maximum-probability
133-clone-graph		133-clone-graph
1333-sort-the-jumbled-numbers		1333-sort-the-jumbled-numbers
134-gas-station		134-gas-station
135-candy		135-candy
136-single-number		136-single-number
1364-tuple-with-same-product		1364-tuple-with-same-product
137-single-number-ii		137-single-number-ii
1370-count-number-of-nice-subarrays		1370-count-number-of-nice-subarrays
138-copy-list-with-random-pointer		138-copy-list-with-random-pointer
1387-find-elements-in-a-contaminated-binary-tree		1387-find-elements-in-a-contaminated-binary-tree
139-word-break		139-word-break
1396-count-servers-that-communicate		1396-count-servers-that-communicate
14-longest-common-prefix		14-longest-common-prefix
1402-count-square-submatrices-with-all-ones		1402-count-square-submatrices-with-all-ones
141-linked-list-cycle		141-linked-list-cycle
1430-find-the-k-beauty-of-a-number		1430-find-the-k-beauty-of-a-number
1431-all-ancestors-of-a-node-in-a-directed-acyclic-graph		1431-all-ancestors-of-a-node-in-a-directed-acyclic-graph
1435-xor-queries-of-a-subarray		1435-xor-queries-of-a-subarray
145-binary-tree-postorder-traversal		145-binary-tree-postorder-traversal
1456-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance		1456-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance
146-lru-cache		146-lru-cache
1468-check-if-n-and-its-double-exist		1468-check-if-n-and-its-double-exist
1473-find-the-longest-substring-containing-vowels-in-even-counts		1473-find-the-longest-substring-containing-vowels-in-even-counts
1477-product-of-the-last-k-numbers		1477-product-of-the-last-k-numbers
148-sort-list		148-sort-list
1484-linked-list-in-binary-tree		1484-linked-list-in-binary-tree
1485-minimum-cost-to-make-at-least-one-valid-path-in-a-grid		1485-minimum-cost-to-make-at-least-one-valid-path-in-a-grid
149-max-points-on-a-line		149-max-points-on-a-line
1496-lucky-numbers-in-a-matrix		1496-lucky-numbers-in-a-matrix
1497-design-a-stack-with-increment-operation		1497-design-a-stack-with-increment-operation
15-3sum		15-3sum
150-evaluate-reverse-polish-notation		150-evaluate-reverse-polish-notation
1502-construct-k-palindrome-strings		1502-construct-k-palindrome-strings
1511-count-number-of-teams		1511-count-number-of-teams
1516-the-k-th-lexicographical-string-of-all-happy-strings-of-length-n		1516-the-k-th-lexicographical-string-of-all-happy-strings-of-length-n
153-find-minimum-in-rotated-sorted-array		153-find-minimum-in-rotated-sorted-array
1537-maximum-score-after-splitting-a-string		1537-maximum-score-after-splitting-a-string
1549-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit		1549-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit
155-min-stack		155-min-stack
1556-make-two-arrays-equal-by-reversing-subarrays		1556-make-two-arrays-equal-by-reversing-subarrays
1558-course-schedule-iv		1558-course-schedule-iv
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
1605-minimum-number-of-days-to-make-m-bouquets		1605-minimum-number-of-days-to-make-m-bouquets
1615-range-sum-of-sorted-subarray-sums		1615-range-sum-of-sorted-subarray-sums
1616-minimum-difference-between-largest-and-smallest-value-in-three-moves		1616-minimum-difference-between-largest-and-smallest-value-in-three-moves
162-find-peak-element		162-find-peak-element
1620-check-if-array-pairs-are-divisible-by-k		1620-check-if-array-pairs-are-divisible-by-k
1631-number-of-sub-arrays-with-odd-sum		1631-number-of-sub-arrays-with-odd-sum
1642-water-bottles		1642-water-bottles
1653-number-of-good-leaf-nodes-pairs		1653-number-of-good-leaf-nodes-pairs

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Repository files navigation

daily-leetcode

About

Releases

Packages

Languages

Noor-Nasri/daily-leetcode

Folders and files

Latest commit

History

Repository files navigation

daily-leetcode

About

Resources

Stars

Watchers

Forks

Releases

Packages 0

Languages

Packages