I understand. I better check some books on efficient Python as my Python only brought me to 5 kyu. It seems like anything
above that will require different thinking.
yes, that's it. It could. The only thing making it finite is the available amount of time for solving, but you should aim for a solution that could go at any "depth" in the sequence.
Sorry, but IMO your talking complete rubbish! No offence intended. The clarity of the instructions should not be related to the difficulty of the challenge. Authors and translators should take responsibility for ensuring that their instructions are understandable particularly when English may not be the first language of many members.
The test is parsing an array [ 6, 0, 1, 10, 10 ] and it expects to get returned 17. 10 is undoubtedly the hightest
number there so my code removes both instances and the test won't pass.
It should be noted in the description of the challenge that the tests check for
order of the your words in the list. I've got a solution but need to redo it
because I've got the words in different order and it won't pass some of the tests.
Either make a note in the description saying the resulting list needs to be
in specified order or make the test order-insensitive.
This is funny. So how one supposed to come up with number of trailing zeros of a number if you can't have the number to begin with ? Duh ! Leaving this one.
Your logic is wrong.
You are checking on
xinstead ofn. Therefore,xwould eventually become zero. You also did not consider cases for powers beyond 3.it's not about python but rather about algorithms and data structures (related to big O notations and time complexity of implementations)
I understand. I better check some books on efficient Python as my Python only brought me to 5 kyu. It seems like anything
above that will require different thinking.
yes, that's it. It could. The only thing making it finite is the available amount of time for solving, but you should aim for a solution that could go at any "depth" in the sequence.
The description doesn't say how many numbers the
list should consist of. As it is it could be infinite.
Sorry, but IMO your talking complete rubbish! No offence intended. The clarity of the instructions should not be related to the difficulty of the challenge. Authors and translators should take responsibility for ensuring that their instructions are understandable particularly when English may not be the first language of many members.
This comment is hidden because it contains spoiler information about the solution
Wait what.. That's pretty clever there. 👀
The test is parsing an array [ 6, 0, 1, 10, 10 ] and it expects to get returned 17. 10 is undoubtedly the hightest
number there so my code removes both instances and the test won't pass.
It should be noted in the description of the challenge that the tests check for
order of the your words in the list. I've got a solution but need to redo it
because I've got the words in different order and it won't pass some of the tests.
Either make a note in the description saying the resulting list needs to be
in specified order or make the test order-insensitive.
This comment is hidden because it contains spoiler information about the solution
Prolog translation kumited. Please review.
This is funny. So how one supposed to come up with number of trailing zeros of a number if you can't have the number to begin with ? Duh ! Leaving this one.
Which part of the sentence "You're not meant to calculate the factorial" do you not understand? You'll never solve the task this way.
Loading more items...