GitHub - Emma003/leetcode-patterns: grokking solutions (python) - will populate as i go through the course

Emma003 / leetcode-patterns Public

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

grokking solutions (python) - will populate as i go through the course

Notifications

Name		Name	Last commit message	Last commit date
Latest commit History 774 Commits
0001-two-sum		0001-two-sum
0003-longest-substring-without-repeating-characters		0003-longest-substring-without-repeating-characters
0009-palindrome-number		0009-palindrome-number
000n-th-tribonacci-number		000n-th-tribonacci-number
0020-valid-parentheses		0020-valid-parentheses
0021-merge-two-sorted-lists		0021-merge-two-sorted-lists
0070-climbing-stairs		0070-climbing-stairs
0098-validate-binary-search-tree		0098-validate-binary-search-tree
0100-same-tree		0100-same-tree
0101-symmetric-tree		0101-symmetric-tree
0102-binary-tree-level-order-traversal		0102-binary-tree-level-order-traversal
0104-maximum-depth-of-binary-tree		0104-maximum-depth-of-binary-tree
0110-balanced-binary-tree		0110-balanced-binary-tree
0121-best-time-to-buy-and-sell-stock		0121-best-time-to-buy-and-sell-stock
0125-valid-palindrome		0125-valid-palindrome
0141-linked-list-cycle		0141-linked-list-cycle
0142-linked-list-cycle-ii		0142-linked-list-cycle-ii
0170-two-sum-iii-data-structure-design		0170-two-sum-iii-data-structure-design
0202-happy-number		0202-happy-number
0226-invert-binary-tree		0226-invert-binary-tree
0234-palindrome-linked-list		0234-palindrome-linked-list
0242-valid-anagram		0242-valid-anagram
0258-add-digits		0258-add-digits
0278-first-bad-version		0278-first-bad-version
0409-longest-palindrome		0409-longest-palindrome
0448-find-all-numbers-disappeared-in-an-array		0448-find-all-numbers-disappeared-in-an-array
0543-diameter-of-binary-tree		0543-diameter-of-binary-tree
0559-maximum-depth-of-n-ary-tree		0559-maximum-depth-of-n-ary-tree
0653-two-sum-iv-input-is-a-bst		0653-two-sum-iv-input-is-a-bst
0704-binary-search		0704-binary-search
0733-flood-fill		0733-flood-fill
0876-middle-of-the-linked-list		0876-middle-of-the-linked-list
1-two-sum		1-two-sum
100-same-tree		100-same-tree
1004-max-consecutive-ones-iii		1004-max-consecutive-ones-iii
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
104-maximum-depth-of-binary-tree		104-maximum-depth-of-binary-tree
1041-robot-bounded-in-circle		1041-robot-bounded-in-circle
1046-last-stone-weight		1046-last-stone-weight
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
108-convert-sorted-array-to-binary-search-tree		108-convert-sorted-array-to-binary-search-tree
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
112-path-sum		112-path-sum
113-path-sum-ii		113-path-sum-ii
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
121-best-time-to-buy-and-sell-stock		121-best-time-to-buy-and-sell-stock
125-valid-palindrome		125-valid-palindrome
128-longest-consecutive-sequence		128-longest-consecutive-sequence
129-sum-root-to-leaf-numbers		129-sum-root-to-leaf-numbers
1304-find-n-unique-integers-sum-up-to-zero		1304-find-n-unique-integers-sum-up-to-zero
133-clone-graph		133-clone-graph
138-copy-list-with-random-pointer		138-copy-list-with-random-pointer
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
1448-count-good-nodes-in-binary-tree		1448-count-good-nodes-in-binary-tree
146-lru-cache		146-lru-cache
148-sort-list		148-sort-list
15-3sum		15-3sum
150-evaluate-reverse-polish-notation		150-evaluate-reverse-polish-notation
1512-number-of-good-pairs		1512-number-of-good-pairs
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
167-two-sum-ii-input-array-is-sorted		167-two-sum-ii-input-array-is-sorted
169-majority-element		169-majority-element
1710-maximum-units-on-a-truck		1710-maximum-units-on-a-truck
18-4sum		18-4sum
189-rotate-array		189-rotate-array
19-remove-nth-node-from-end-of-list		19-remove-nth-node-from-end-of-list
1941-check-if-all-characters-have-equal-number-of-occurrences		1941-check-if-all-characters-have-equal-number-of-occurrences
1971-find-if-path-exists-in-graph		1971-find-if-path-exists-in-graph
199-binary-tree-right-side-view		199-binary-tree-right-side-view
2-add-two-numbers		2-add-two-numbers
20-valid-parentheses		20-valid-parentheses
200-number-of-islands		200-number-of-islands
202-happy-number		202-happy-number
203-remove-linked-list-elements		203-remove-linked-list-elements
206-reverse-linked-list		206-reverse-linked-list
207-course-schedule		207-course-schedule
209-minimum-size-subarray-sum		209-minimum-size-subarray-sum
21-merge-two-sorted-lists		21-merge-two-sorted-lists
215-kth-largest-element-in-an-array		215-kth-largest-element-in-an-array
217-contains-duplicate		217-contains-duplicate
22-generate-parentheses		22-generate-parentheses
226-invert-binary-tree		226-invert-binary-tree
23-merge-k-sorted-lists		23-merge-k-sorted-lists
230-kth-smallest-element-in-a-bst		230-kth-smallest-element-in-a-bst
234-palindrome-linked-list		234-palindrome-linked-list
235-lowest-common-ancestor-of-a-binary-search-tree		235-lowest-common-ancestor-of-a-binary-search-tree
238-product-of-array-except-self		238-product-of-array-except-self
242-valid-anagram		242-valid-anagram