What a amzing trick .

hahaha you are right but this is what codewars is about to use your brain and give your best

just beautiful

man you just end this

You just help me to solve this answer in just 2 min thanks :) amazing hint

Great :)

oh man its fcking great answer :) i miss the way

no man i did this so short .. fckk you win :( . Thats a insane approch :) gg

@natan and @dolamroth thanks for clearing my doubt

I already Checked the solution in my kata solution it's working fine. I have an issue that the output of math. float(div) and int(div) and floor division are the same in small values but it's failing in large number value so I just asked in this answer. I cant do this in forked beacuse its gonaa faill

Don't make this answer a spoiler.

so many people have the same doubt as me so from this they easily understand why these things did not work here only floor division (//) work.

This solution make my day :) awesomee work

Amzaing kata still dont figure out how to solve it still you did a great work to creating this kata

count the number of 1s in the array. Let this count be n. The Stanton measure is the number of times that n appears in the array.

Just try to understand this :)

in Simple english - whatever the occurnce of 1 come in array will be x and then find that occurnce of x in array

What a smooth ness in the answer