nope its python... idk c#, in any case are those functions in c#?
Did you tried PadLeft and PadRight?
This comment is hidden because it contains spoiler information about the solution
Most of solutions (or even all) do bruteforce of k-element subsets (this is O(n^k)). Does the better solution exist? The problem looks similar to knapsack problem, is it possible to use dynamic programming here?
already did check but i puted an intiger of 3 floors ?????
So, your code returns 1; where it should return an array (see the description and the test cases).
Please say which language you're using when posting in discourse, since tests may depend on it (moreover in this kata the format of the result is also different in some of them). A priori it means that you return something like 1 where tests expect ['*']...
Your code returned 1 instead of [ '*' ]
[ '*' ]
expected 1 to deeply equal [ '*' ] what does it mean i have wrote it bt doesnt work
No problem, glad you solved it eventually ;)
Thank you for your "heads up".
use "\t" certainly not, one can see in test cases these are spaces.
I did not solve this kata in C# and I'm quite bad in this language, however if I run your code on basic tests, I get this: Expected: "*" But was: " *"
Expected: "*" But was: " *"
You see there's one extra space in your result. Check your code...