well done

first solution that came to mind

was like my code is clean untile i saw this

nice one love this

The count method is called for each unique character in the text, leading to an overall time complexity of 𝑂(𝑛⋅𝑚)
O(n⋅m), where n is the length of the text and 𝑚 is the number of unique characters. This can be inefficient for large texts.

nice but using the count method inside a loop can be inefficient for large lists because count iterates through the list each time it is called, leading to an overall time complexity
also the method is straightforward and easy to implement but may not be optimal for very large datasets.

feels good my solution is the same as the fist ranking solution

because we need to return an integer for the code to pass the test. In python using the / will return a float for example 10/2 will give you 5.0 which is a float number but 10//2 will give you 5 which is an integer