100 Days of Code Day 31
I never seem to have enough time to do this on Saturday’s and or Sundays. I am thinking of having some sort of different projects for the weekends. Maybe just reading or something. Not sure yet.
All I had time for today was an exercise about calculating the best possible discount for a book store that gives discounts for buying books in a series. I got the right answers …. eventually, but I don’t know if I actually did it right. To me it seems like I needed to calculate every possible permutation of books. Then for each supported permutation pair the cost of that permutation with the best cost of the remainder of any more books purchased (found recursively).
If Javascript has a permutations function I missed it. The community solutions look nothing like mine. I had a bug that was making things take forever so I memoized it too. So it might be on the overkill side. Even exercism told me to come back and try again later when I learned more (wow that’s condescending).
Anyway that’s all for today.