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
12 changes: 11 additions & 1 deletion Sprint-2/improve_with_caches/fibonacci/fibonacci.py
Original file line number Diff line number Diff line change
@@ -1,4 +1,14 @@

cache = {}

def fibonacci(n):
Comment on lines +2 to 4

Copy link
Copy Markdown

Choose a reason for hiding this comment

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

Could you look into an approach that doesn't require keeping the cache in the global scope?

Change is optional.


if n in cache:
return cache[n]

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

return cache[n]
40 changes: 25 additions & 15 deletions Sprint-2/improve_with_caches/making_change/making_change.py
Original file line number Diff line number Diff line change
@@ -1,32 +1,42 @@
from typing import List

cache = {}

def ways_to_make_change(total: int) -> int:
"""
Given access to coins with the values 1, 2, 5, 10, 20, 50, 100, 200, returns a count of all of the ways to make the passed total value.

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])
coins = [200, 100, 50, 20, 10, 5, 2, 1]
ways = [0] * (total + 1)
ways[0] = 1

for coin in coins:
for amount in range(coin, total + 1):
ways[amount] += ways[amount - coin]
Comment on lines +11 to +17

Copy link
Copy Markdown

Choose a reason for hiding this comment

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

This iterative approach is quicker but it would beat the purpose of using cache to improve an existing recursive solution.



return ways[total]


def ways_to_make_change_helper(total: int, coins: List[int]) -> int:
def ways_to_make_change_helper(total: int, coins: List[int], coin_start_index: int = 0) -> int:

Copy link
Copy Markdown

Choose a reason for hiding this comment

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

Even though you didn't use this helper function, you correctly implemented it to use a cache to improve the original implementation.

"""
Helper function for ways_to_make_change to avoid exposing the coins parameter to callers.
"""
if total == 0 or len(coins) == 0:
if total == 0:
return 1
if total < 0 or coin_start_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
memo_key = (total, coin_start_index)
if memo_key in cache:
return cache[memo_key]

coin = coins[coin_start_index]
ways = ways_to_make_change_helper(total, coins, coin_start_index + 1)
if coin <= total:
ways += ways_to_make_change_helper(total - coin, coins, coin_start_index)

cache[memo_key] = ways
return ways
Loading