• hobovskycommented on "Closest pair of points in linearithmic time" kata

There should be no need to use decimals in this particular challenge, and floats should work. I tried to build the tests in the way to make them resistant to precision issues, and if you have such problems, then i believe its something not exactly right with your code.
I can double check if you post your code bere.

• Tenebracreated a question for "Closest pair of points in linearithmic time" kata

When using Python 3, is it recommended to use the decimal module? Is the floating-point precision so bad for doing its kata?

• trashy_incelcreated an issue for "Simple min heap implementation" kata

the initial code should be a class

• Abd1Mal1K_AMcommented on "Closest pair of points in linearithmic time" kata

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

• ejini战神created an issue for "Find match row and column position in a given string" kata

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

• ejini战神created an issue for "Find match row and column position in a given string" kata

Description also does not explain whether the match string will take the \n character into account or not. Initally I was thinking of cases like (abc\ndefc\nhu, chu)

• 3au4onokcreated an issue for "Closest pair of points" kata

More test examples are needed, the link to the article does not work

• solaropticcommented on "Tic-Tac-Toe Checker" javascript solution

I had to work that one out myself. Excellent

• VeganAircommented on "Tic-Tac-Toe Checker" javascript solution

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

• ejini战神resolved a question on "Calculate number of inversions in array" kata

OP has posted the wrong code to the wrong kata, should've posted it to Boggle Word Checker

• Russxyzcommented on "Tic-Tac-Toe Checker" javascript solution

No doubt it is clever, never knew you could do it like this. Thans

• Fargys1879commented on "Closest pair of points in linearithmic time" kata

I can't pass the test 09. I measured the slow solution(N^2) on test 08 and got an average time of 430 ms.My solution, as I believe for (logN), takes an average of 80-90ms.However, this is not enough to pass test09

KataTest
test01_Example
test02_TwoPoints
test03_DuplicatedPoint
test04_Tiny
test05_Small
test06_TwoPoints
test07_DuplicatedPoint
test08_Medium
Log
Прошло времени, мс: 103
Прошло времени, мс: 92
Прошло времени, мс: 57
Прошло времени, мс: 92
Прошло времени, мс: 67
Прошло времени, мс: 75
Прошло времени, мс: 99
Прошло времени, мс: 73
Прошло времени, мс: 62
Прошло времени, мс: 72
Test Passed
Completed in 811ms
test09_Large
STDERR
Execution Timed Out (16000 ms)

• Sir Umbraresolved a question on "Closest pair of points in linearithmic time" kata

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

• Sir Umbracreated a question for "Closest pair of points in linearithmic time" kata

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

nice