Hi

No indications about the number of random tests : timed out with 100 passed tests ?

python new test frameworks

Please use the issue tag only to point out problems with kata that you can demonstrate/prove, as that tag is used to keep track of things to fix.

It seems to me like a closer look at the description will answer your question.

how that possible in test case [[1,0,1],[1,1,0],[0,0,2]]: expected [ +0, 4 ] to deeply equal [ 1, 3 ]
as there two large groups of [0,4] , [1,4] and the lowest value of the two large groups is 0 so it should return [0 , 4] however it return [1 , 3]
i tried to solve that kata with javascript

not in the title.

Good Kata)

Python version needs an update to new framework

fixed

Done

Really nice kata, but I agree with @Voile 's 4 year old Issue; the description could be a bit clearer - something like:

• Find the size, s, of the largest group of adjacent integers that all have the same value v. Return these 2 results as a tuple (s,v).

• If there are several largest groups corresponding to the same size s, return the tuple with the lowest possible value of v.

• Integers in the grid are considered part of an adjacent group if they can be reached by moving through other integers of the same value horizontally or vertically, but not diagonally.

Also include a 2nd example that illustrates the expected tie-breaker behaviour e.g.:

# Input
example_grid_2 = [
     [ 7, 2, 5, 1],
     [ 7, 2, 5, 8],
     [ 7, 2, 5, 8],
     [ 7, 2, 5, 1]
]
# Output - there are 3 groups of size s=4:
# One group uses integer value 7, one uses 2, and one uses 5.
# Since 2 is the lowest of these values, you should return (v = 2,s = 4)
(2 ,4)

If you slice sequences by specifying out of bound index, it will slice the sequence to nearest index

most adjacent integers of the same value does not mean what you think you means. most adjacent means the closest. What you mean is the biggest group of adjacent integers of the same value.

Approved! The both averages were on 5 kyu.

o_O