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.

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

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

it is the best 'wasted my time' moment

where is 'toupper()' declared?

i use C, and i passed all tests but the last one. i think it is a kata problem because it is the only one, function failed. also program worked very well in my pc locally.

it gives execution timed out error every time