GitHub - maomao905/algo: My solution to algorithm problems (mainly LeetCode problems) (アルゴリズムの問題を解いたときの解答)

maomao905 / algo Public

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

My solution to algorithm problems (mainly LeetCode problems) (アルゴリズムの問題を解いたときの解答)

Notifications

Name		Name	Last commit message	Last commit date
Latest commit History 1 Commit
AtCoder_Problems		AtCoder_Problems
AtCoder_abc181		AtCoder_abc181
AtCoder_abc182		AtCoder_abc182
AtCorder_abc184		AtCorder_abc184
AtCorder_arc108		AtCorder_arc108
LeeetCode_WC216		LeeetCode_WC216
LeetCode_WC215		LeetCode_WC215
geekforgeeks		geekforgeeks
lib		lib
mock		mock
pramp		pramp
.gitignore		.gitignore
0-1knapsack.py		0-1knapsack.py
01-matrix.py		01-matrix.py
132-pattern.py		132-pattern.py
3-sum-with-multiplicity.py		3-sum-with-multiplicity.py
3sum-closest.py		3sum-closest.py
3sum-smaller.py		3sum-smaller.py
3sum.py		3sum.py
4sum-2.py		4sum-2.py
4sum.py		4sum.py
LRU-cache.py		LRU-cache.py
accounts-merge.py		accounts-merge.py
add-binary.py		add-binary.py
add-bold-tag-in-string.py		add-bold-tag-in-string.py
add-one-row-to-tree.py		add-one-row-to-tree.py
add-two-numbers.py		add-two-numbers.py
advantage-shuffle.py		advantage-shuffle.py
all-elements-in-two-binary-search-trees.py		all-elements-in-two-binary-search-trees.py
all-paths-for-sum.py		all-paths-for-sum.py
all-paths-from-source-to-target.py		all-paths-from-source-to-target.py
all-possible-full-binary-trees.py		all-possible-full-binary-trees.py
all-tasks-scheduling-orders.py		all-tasks-scheduling-orders.py
allocate-mailboxes.py		allocate-mailboxes.py
alphabet-board-path.py		alphabet-board-path.py
arithmetic-slices-2-subsequence.py		arithmetic-slices-2-subsequence.py
arithmetic-slices.py		arithmetic-slices.py
as-far-from-land-as-possible.py		as-far-from-land-as-possible.py
average-of-levels-in-binary-tree.py		average-of-levels-in-binary-tree.py
balance-a-binary-search-tree.py		balance-a-binary-search-tree.py
balanced-binary-tree.py		balanced-binary-tree.py
basic-calculator-2.py		basic-calculator-2.py
basic-calculator.py		basic-calculator.py
basic-regular-expression.py		basic-regular-expression.py
beautiful-arrangement.py		beautiful-arrangement.py
best-time-to-buy-and-sell-stock-2.py		best-time-to-buy-and-sell-stock-2.py
best-time-to-buy-and-sell-stock-3.py		best-time-to-buy-and-sell-stock-3.py
best-time-to-buy-and-sell-stock-with-cooldown.py		best-time-to-buy-and-sell-stock-with-cooldown.py
best-time-to-buy-and-sell-stock-with-transaction-fee.py		best-time-to-buy-and-sell-stock-with-transaction-fee.py
best-time-to-buy-and-sell-stock.py		best-time-to-buy-and-sell-stock.py
binary-search-tree-iterator.py		binary-search-tree-iterator.py
binary-search-tree-to-greater-sum-tree.py		binary-search-tree-to-greater-sum-tree.py
binary-search.py		binary-search.py
binary-subarrays-with-sum.py		binary-subarrays-with-sum.py
binary-tree-coloring-game.py		binary-tree-coloring-game.py
binary-tree-inorder-traversal.py		binary-tree-inorder-traversal.py
binary-tree-level-order-traversal.py		binary-tree-level-order-traversal.py
binary-tree-maximum-path-sum.py		binary-tree-maximum-path-sum.py
binary-tree-postorder-traversal.py		binary-tree-postorder-traversal.py
binary-tree-preorder-traversal.py		binary-tree-preorder-traversal.py
binary-tree-right-side-view.py		binary-tree-right-side-view.py
binary-tree-vertical-order-traversal.py		binary-tree-vertical-order-traversal.py
binary-tree-with-factors.py		binary-tree-with-factors.py
bitwise-and-of-numbers-range.py		bitwise-and-of-numbers-range.py
bitwise-intro.py		bitwise-intro.py
bitwise-ors-of-subarrays.py		bitwise-ors-of-subarrays.py
boats-to-save-people.py		boats-to-save-people.py
bomb-enemy.py		bomb-enemy.py
brace-expansion.py		brace-expansion.py
broken-calculator.py		broken-calculator.py
campus-bikes.py		campus-bikes.py
can-i-win.py		can-i-win.py
can-make-palindrome-from-substring.py		can-make-palindrome-from-substring.py
candy.py		candy.py
capacity-to-ship-packages-within-d-days.py		capacity-to-ship-packages-within-d-days.py
card-game-for-two.py		card-game-for-two.py
ceiling-of-number.py		ceiling-of-number.py
cheapest-flights-within-k-stops.py		cheapest-flights-within-k-stops.py
check-array-formation-through-concatenation.py		check-array-formation-through-concatenation.py
check-completeness-of-a-binary-tree.py		check-completeness-of-a-binary-tree.py
check-if-a-string-can-break-another-string.py		check-if-a-string-can-break-another-string.py
check-if-a-string-contains-all-binary-codes-of-size-k.py		check-if-a-string-contains-all-binary-codes-of-size-k.py
check-if-all-1s-are-at-least-length-k-places-away.py		check-if-all-1s-are-at-least-length-k-places-away.py
check-if-there-is-a-valid-path-in-a-grid.py		check-if-there-is-a-valid-path-in-a-grid.py
check-if-two-string-arrays-are-equivalent.py		check-if-two-string-arrays-are-equivalent.py
climbing-stairs.py		climbing-stairs.py
clone-n-ary-tree.py		clone-n-ary-tree.py
closest-binary-search-tree-value-2.py		closest-binary-search-tree-value-2.py
coin-change.py		coin-change.py
coins.py		coins.py
combination-sum-2.py		combination-sum-2.py
combination-sum-3.py		combination-sum-3.py
combination-sum.py		combination-sum.py
combinations.py		combinations.py
concatenation-of-consecutive-binary-numbers.py		concatenation-of-consecutive-binary-numbers.py
connect-ropes.py		connect-ropes.py
construct-binary-search-tree-from-preorder-traversal.py		construct-binary-search-tree-from-preorder-traversal.py
construct-binary-tree-from-inorder-and-postorder-traversal.py		construct-binary-tree-from-inorder-and-postorder-traversal.py
construct-binary-tree-from-preorder-and-inorder-traversal.py		construct-binary-tree-from-preorder-and-inorder-traversal.py
construct-binary-tree-from-string.py		construct-binary-tree-from-string.py

About

My solution to algorithm problems (mainly LeetCode problems) (アルゴリズムの問題を解いたときの解答)

Activity

0 stars

2 watching

0 forks

Report repository

Languages

Python 100.0%

maomao905/algo

Folders and files

Latest commit

History