Skip to content
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
11 changes: 8 additions & 3 deletions Sprint-2/improve_with_caches/fibonacci/fibonacci.py
Original file line number Diff line number Diff line change
@@ -1,4 +1,9 @@
def fibonacci(n):
if n <= 1:
return n
return fibonacci(n - 1) + fibonacci(n - 2)
if n in fibonacci.cache:
return fibonacci.cache[n]
else:
value = fibonacci(n - 1) + fibonacci(n - 2)
fibonacci.cache[n] = value
return value

fibonacci.cache={0:0, 1:1}
40 changes: 26 additions & 14 deletions Sprint-2/improve_with_caches/making_change/making_change.py

Copy link
Copy Markdown

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Your implementation looks good.

Note: there is a much faster way to figure out how many ways we could make change when there is only 1 coin left to consider.

Copy link
Copy Markdown
Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

So, when coin_index hits 7, which leads to coin value 1, we can simply return 1, right? No matter what the total is left, with coin value 1, it always gets 1 way.

@cjyuan cjyuan Jun 22, 2026

Copy link
Copy Markdown

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Correct.

I see that you have also figured out how to compute number of ways to make change when there is one coin left using %. Nice!

Original file line number Diff line number Diff line change
Expand Up @@ -7,26 +7,38 @@ def ways_to_make_change(total: int) -> int:

For instance, there are two ways to make a value of 3: with 3x 1 coins, or with 1x 1 coin and 1x 2 coin.
"""
return ways_to_make_change_helper(total, [200, 100, 50, 20, 10, 5, 2, 1])
return ways_to_make_change_helper(total, [200, 100, 50, 20, 10, 5, 2, 1], coin_index = 0, cache = None)


def ways_to_make_change_helper(total: int, coins: List[int]) -> int:
def ways_to_make_change_helper(total: int, coins: List[int], coin_index: int = 0, cache: dict = None) -> int:
"""
Helper function for ways_to_make_change to avoid exposing the coins parameter to callers.
"""
if total == 0 or len(coins) == 0:
if cache == None:
cache = {}

current_key = (total, coin_index)
if current_key in cache:
return cache[current_key]

if total == 0:
return 1

if coin_index == len(coins) - 1:
return 1 if total % coins[coin_index] == 0 else 0

if total < 0 or coin_index >= len(coins):
return 0

ways = 0
for coin_index in range(len(coins)):
coin = coins[coin_index]
count_of_coin = 1
while coin * count_of_coin <= total:
total_from_coins = coin * count_of_coin
if total_from_coins == total:
ways += 1
else:
intermediate = ways_to_make_change_helper(total - total_from_coins, coins=coins[coin_index+1:])
ways += intermediate
count_of_coin += 1

remaining_value = total - coins[coin_index]

taken_the_coin = ways_to_make_change_helper(remaining_value, coins, coin_index, cache)

left_the_coin = ways_to_make_change_helper(total, coins, coin_index + 1, cache)

ways = taken_the_coin + left_the_coin

cache[current_key] = ways
return ways
Loading