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
13 changes: 10 additions & 3 deletions Sprint-2/improve_with_caches/fibonacci/fibonacci.py
Original file line number Diff line number Diff line change
@@ -1,4 +1,11 @@
cache = {
0: 0,
1: 1
}

def fibonacci(n):
if n <= 1:
return n
return fibonacci(n - 1) + fibonacci(n - 2)
if n in cache:
return cache[n]

cache[n] = fibonacci(n - 1) + fibonacci(n - 2)
return cache[n]
39 changes: 23 additions & 16 deletions Sprint-2/improve_with_caches/making_change/making_change.py
Original file line number Diff line number Diff line change
@@ -1,4 +1,5 @@
from typing import List
COINS = (200, 100, 50, 20, 10, 5, 2, 1)
cache = {}


def ways_to_make_change(total: int) -> int:
Expand All @@ -7,26 +8,32 @@ 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])
Comment on lines 1 to -11

Copy link
Copy Markdown

Choose a reason for hiding this comment

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

Why use tuple instead of list?

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.

Thank you for asking.I changed the coin denominations to a tuple because they are fixed and do not need to be modified. The main optimization was replacing list slicing with a coin index, avoiding the creation of new lists during recursive calls. The cache now uses (total, coin_index) as its key.

return ways_to_make_change_helper(total, 0)


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

if key in cache:
return cache[key]

if total == 0:
return 1

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
coin = COINS[coin_index]

# Option 1: Skip this coin and move to the next denomination.
ways = ways_to_make_change_helper(total, coin_index + 1)

# Option 2: Use this coin and consider it again.
if coin <= total:
ways += ways_to_make_change_helper(total - coin, coin_index)

cache[key] = ways
return ways
Loading