Python Challenge - Stairmaster

This community-built FAQ covers the “Stairmaster” code challenge in Python. You can find that challenge here, or pick any challenge you like from our list.

Top Discussions on the Python challenge Stairmaster

There are currently no frequently asked questions or top answers associated with this challenge – that’s where you come in! You can contribute to this section by offering your own questions, answers, or clarifications on this challenge. Ask a question or post a solution by clicking reply (reply) below.

If you’ve had an “aha” moment about the concepts, formatting, syntax, or anything else with this challenge, consider sharing those insights! Teaching others and answering their questions is one of the best ways to learn and stay sharp.

Join the Discussion. Help a fellow learner on their journey.

Ask or answer a question about this exercise by clicking reply (reply) below!
You can also find further discussion and get answers to your questions over in #get-help.

Agree with a comment or answer? Like (like) to up-vote the contribution!

Need broader help or resources? Head to #get-help and #community:tips-and-resources. If you are wanting feedback or inspiration for a project, check out #project.

Looking for motivation to keep learning? Join our wider discussions in #community

Learn more about how to use this guide.

Found a bug? Report it online, or post in #community:Codecademy-Bug-Reporting

Have a question about your account or billing? Reach out to our customer support team!

None of the above? Find out where to ask other questions here!

This one has me stuck. I have a working solution, but it is so inefficient that Codecademy can’t even run it. Running stairmaster(8) takes a few seconds on my desktop computer. I am currently finding the permutations of steps that lead to the top and then getting rid of the duplicates. Finding the permutations is easy and fast, since you can do that with a generator. However, the ridiculous amount of time comes when you have to reduce all of the permutations to the unique permutations. I’ve done this in a few ways, and none of them are efficient.

I might be tunnel-visioning on the approach I’ve started with, so would appreciate any insights from those more experienced than myself.

Thanks.


On a lot of these challenges, you have to find permutations, and thats had me stuck for a while so I kinda cheated by using itertools. it gives you all the combinations but won’t give repititions like 3,1 and 1,3. thats what the bottom bit is for. This probably didn’t help with you’re method but thought id share anyway!

import itertools def stairmaster(n): ans = 0 all_permutations = [] add_to_4 = [] list_to_3 = [1,2,3] for num in range(1,n+1): all_permutations.append((itertools.combinations_with_replacement(list_to_3,num))) for num in all_permutations: for permutation in num : if sum(permutation) == n: add_to_4.append(permutation) for permutation in add_to_4: alist = [] count = -1 for value in permutation: if not value in alist: count+=1 alist.append(value) ans+= len(permutation) ** (count) return ans print(stairmaster(10))

I’m pretty sure of the math and code so I’m not sure why I’ve failed some tests.