I know this kata was published before Ranking Poker Hands, but unfortunately, the other one got approved and gained some traction already, effectively making this one a duplicate. It's not an ideal situation, but unfortunately it's not possible to unpublish an approved kata.

I am going to unpublish this one as a duplicate, but I am aware how unfair it might be and I hope we avoid similar problems in the future.

I personnaly get TypeError: 'Guess_Bot' object is not callable when trying to call it. Description says You are only to interact with guess_bot by its method: guess_number(num) which returns a string.. Am I wrong or is it broken?

This comment is hidden because it contains spoiler information about the solution

Oh ok, thanks... Well, resolved :)

It's very unclear int the description but you have to use the following method

`guess_bot.guess_number(x)`

to test if`x`

is the correct number. (Python)LOL sorting is way too overbuilt.

I knowthis kata was published before Ranking Poker Hands, but unfortunately, the other one got approved and gained some traction already, effectively making this one a duplicate. It's not an ideal situation, but unfortunately it's not possible to unpublish an approved kata.I am going to unpublish this one as a duplicate, but I am aware how unfair it might be and I hope we avoid similar problems in the future.

The author cares ;-/ Anyway, it's bad luck that the duplicate of an original kata got approved.

I personnaly get

TypeError: 'Guess_Bot' object is not callablewhen trying to call it. Description saysYou are only to interact with guess_bot by its method: guess_number(num) which returns a string.. Am I wrong or is it broken?Please use new python test framework.

Looks like u solved it

Looks like u solved it

looks like u alr solved it

Sure, it is, I just mean that to find the first two min of the list, (2n) in enough instead of (n^2) or (n log n)

There is no such thing as O(2n). The 2 drops out since it's a constant, so it's actually O(n).

Yes, if they are implemented in quick-sort or heap-sort or... .Also O(n log n) > O(2n)

sorting is

`O(n log n)`

, not`O(n²)`

(out of special considerations, and assuming you're using a builtin to do it)## Loading more items...