Same is as if blank isn't true, except no value is valid too. Saying more would probably spoil the kata, but you might be overthinking it.

how did you know that Peter is Mr. Right? Why cannot all of them be liar so we return 'null'?

What should validate method do when field is blank?

just to be safe? i think in order to find closest points in a O(nlogn) time complexity, we need a sorted array, because array could be in any order.

As always, analyzing input data is important.

I guess your solution only works for words without repetition and most of the large words have repeating characters.

Nice kata. I had to look through the "list" to find the actual solution.

Duplicate.

Python:

• Function name should be snake_case
• No sample tests
• No random tests

General:

• dummy javascript version
• duplicate?

it is not even a program. you just compressed your code into a few lines to make it look cleverer, instead it became unreadable and messed

fib(n)=fib(n-1)+fib(n-2) =>
fib(1)=fib(0)+fib(-1) =>
fib(-1)=fib(1)-fib(0)=1-0=1

the language here is ambiguous, but it is assumed that we are talking about an entire window, hence if it goes above the window it will go down for a second viewing.

That can happen if your algorithm isn't efficient. Any method that relies on finding the depth of each pixel separately will likely be too slow on the large images.

running big test, my program always runs out of time...

its a library function https://man7.org/linux/man-pages/man3/toupper.3.html