Yes, it is possible, and you have to think of some more efficient way. Hint: if there is 100 ones and a single zero, your method checks that there is 100 ones a hundred times. It is enough to check that there is 100 ones only once.
Is this possible in python? The most efficient way I can think of doing this is using count() to count how many times an item appears in the array, and it's always failing at the "Very big number" test. (My code is only 4 lines long lol)
If you look closely you see that there is a little but important difference in what you both loop over.
I wrote the exact same thing as your solution (just a variable name is different)
What is going on here?
hello, yea it's possible, I just have made it
Aww no python :(
Ok, thanks
This is irrelevant.
Yes, it is possible, and you have to think of some more efficient way. Hint: if there is 100 ones and a single zero, your method checks that there is 100 ones a hundred times. It is enough to check that there is 100 ones only once.
Is this possible in python? The most efficient way I can think of doing this is using count() to count how many times an item appears in the array, and it's always failing at the "Very big number" test. (My code is only 4 lines long lol)
How???
Bro what 💀