GitHub - Shunpoco/leetcode: Solutions for leetcode

leetcode

Count ways to build good strings

https://leetcode.com/problems/count-ways-to-build-good-strings/description/

Word subsets

https://leetcode.com/problems/word-subsets/description/

Minimum number of operations to make elements in array distinct

https://leetcode.com/problems/minimum-number-of-operations-to-make-elements-in-array-distinct

Name		Name	Last commit message	Last commit date
Latest commit History 1,546 Commits
01-matrix		01-matrix
132-pattern		132-pattern
2-keys-keyboard		2-keys-keyboard
3sum-closest		3sum-closest
add-binary		add-binary
add-digits		add-digits
add-one-row-to-tree		add-one-row-to-tree
add-strings		add-strings
add-to-array-form-of-integer		add-to-array-form-of-integer
add-two-integers		add-two-integers
add-two-numbers-ii		add-two-numbers-ii
add-two-numbers		add-two-numbers
adding-spaces-to-a-string		adding-spaces-to-a-string
all-paths-from-source-to-target		all-paths-from-source-to-target
alternating-groups-ii		alternating-groups-ii
amount-of-time-for-binary-tree-to-be-infected		amount-of-time-for-binary-tree-to-be-infected
append-characters-to-string-to-make-subsequence		append-characters-to-string-to-make-subsequence
apply-operations-to-an-array		apply-operations-to-an-array
apply-operations-to-maximize-score		apply-operations-to-maximize-score
april2021/week2/beautiful-arrangement2		april2021/week2/beautiful-arrangement2
arithmetic-subarrays		arithmetic-subarrays
arranging-coins		arranging-coins
array-partition-i		array-partition-i
array101		array101
assign-cookie		assign-cookie
assign-cookies		assign-cookies
asteroid-collision		asteroid-collision
average-of-levels-in-binary-tree		average-of-levels-in-binary-tree
average-salary-excluding-the-minimum-and-maximum-salary		average-salary-excluding-the-minimum-and-maximum-salary
average-waiting-time		average-waiting-time
backspace-string-compare		backspace-string-compare
bag-of-tokens		bag-of-tokens
balance-a-binary-search-tree		balance-a-binary-search-tree
balanced-binary-tree		balanced-binary-tree
basic-calculator		basic-calculator
best-sightseeing-pair		best-sightseeing-pair
best-time-to-buy-and-sell-stock-IV		best-time-to-buy-and-sell-stock-IV
best-time-to-buy-and-sell-stock-ii		best-time-to-buy-and-sell-stock-ii
best-time-to-buy-and-sell-stock-with-cooldown		best-time-to-buy-and-sell-stock-with-cooldown
best-time-to-buy-and-sell-stock-with-transaction-fee		best-time-to-buy-and-sell-stock-with-transaction-fee
best-time-to-buy-and-sell-stock		best-time-to-buy-and-sell-stock
binary-search-tree-iterator		binary-search-tree-iterator
binary-search-tree-to-greater-sum-tree		binary-search-tree-to-greater-sum-tree
binary-search		binary-search
binary-tree-cameras		binary-tree-cameras
binary-tree-inorder-traversal		binary-tree-inorder-traversal
binary-tree-level-order-traversal		binary-tree-level-order-traversal
binary-tree-level-order-traversal2		binary-tree-level-order-traversal2
binary-tree-paths		binary-tree-paths
binary-tree-postorder-traversal		binary-tree-postorder-traversal
binary-tree-preorder-traversal		binary-tree-preorder-traversal
binary-tree-prunnig		binary-tree-prunnig
binary-tree-right-side-view		binary-tree-right-side-view
binary-tree-zigzag		binary-tree-zigzag
binary-trees-with-factors		binary-trees-with-factors
binary-watch		binary-watch
bitwise-and-of-numbers-range		bitwise-and-of-numbers-range
bitwise-xor-of-all-pairings		bitwise-xor-of-all-pairings
boats-to-save-people		boats-to-save-people
break-a-palindrome		break-a-palindrome
buddy-strings		buddy-strings
build-a-matrix-with-conditions		build-a-matrix-with-conditions
build-array-from-permutation		build-array-from-permutation
bulb-switcher		bulb-switcher
bus-routes		bus-routes
buy-two-chocolates		buy-two-chocolates
calculate-digit-sum-of-a-string		calculate-digit-sum-of-a-string
calculate-money-in-leetcode-bank		calculate-money-in-leetcode-bank
can-make-arithmetic-progression-from-sequence		can-make-arithmetic-progression-from-sequence
can-place-flowers		can-place-flowers
candy		candy
capacity-to-ship-packages-within-d-days		capacity-to-ship-packages-within-d-days
cheapest-flights-within-k-steps		cheapest-flights-within-k-steps
cheapest-flights-within-k-stops		cheapest-flights-within-k-stops
check-completeness-of-a-binary-tree		check-completeness-of-a-binary-tree
check-if-a-string-contains-all-binary-codes-of-size-k		check-if-a-string-contains-all-binary-codes-of-size-k
check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence		check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence
check-if-array-is-sorted-and-rotated		check-if-array-is-sorted-and-rotated
check-if-array-pairs-are-divisible-by-k		check-if-array-pairs-are-divisible-by-k
check-if-every-row-and-column-contains-all-numbers		check-if-every-row-and-column-contains-all-numbers
check-if-grid-can-be-cut-into-sections		check-if-grid-can-be-cut-into-sections
check-if-it-is-a-straight-line		check-if-it-is-a-straight-line
check-if-n-and-its-double-exist		check-if-n-and-its-double-exist
check-if-number-is-a-sum-of-powers-of-three		check-if-number-is-a-sum-of-powers-of-three
check-if-one-string-swap-can-make-strings-equal		check-if-one-string-swap-can-make-strings-equal
check-if-the-sentence-is-pangram		check-if-the-sentence-is-pangram
check-if-there-is-a-valid-partition-for-the-array		check-if-there-is-a-valid-partition-for-the-array
check-if-two-arrays-are-equivalent		check-if-two-arrays-are-equivalent
cherry-pickup-ii		cherry-pickup-ii
circular-sentence		circular-sentence
clear-digits		clear-digits
climbing-stairs		climbing-stairs
clone-graph		clone-graph
closest-prime-numbers-in-range		closest-prime-numbers-in-range
coin-change-ii		coin-change-ii
coin-change		coin-change
combination-sum-2		combination-sum-2
combination-sum-iii		combination-sum-iii
combination-sum-iv		combination-sum-iv
combination-sum		combination-sum

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Uh oh!

Repository files navigation

leetcode

Count ways to build good strings

Word subsets

Minimum number of operations to make elements in array distinct

About

Uh oh!

Releases

Packages

Uh oh!

Languages

Shunpoco/leetcode

Folders and files

Latest commit

History

Repository files navigation

leetcode

Count ways to build good strings

Word subsets

Minimum number of operations to make elements in array distinct

About

Resources

Uh oh!

Stars

Watchers

Forks

Releases

Packages 0

Uh oh!

Languages

Packages