quaiks

A tree?? I can't see any tree.

Integer array. Applying the next rule, How many jumps are necessary for getting out of the array? Return -1 if never gets out.

A[K] = M -> jump to -> A[K+M] = L

I don't know If this is enough for understanding the problem.

It's not complex but my solution is going to suck. BTW they like it...

Arrays.binarySearch(...) And for a more in deep knowledge, Google. This is what I expect from a Java programmer.

Hash tables... Hashtable vs HashMap? Classic one.

Good answer. I need a week for getting all my low-level tools sharpened for this kind of job. But I don't want this kind of job so.. Done.

Yes I totally understand but I think the nature of the problems to solve in Java are not related with this complex algorithms. I mean, I have been training myself in generics, OOP, SOLID principles, Clean Code, Design Patterns, TDD, BDD and some others for the last three years.

How I am supposed to show my skills in one hour resolving a low level algorithm in a web IDE (this particular case)? All my "low level thinking" is pretty oxidized.

Maybe I am just wrong. A novel speaking.

Yeah we rocks...

Feedly!

Be careful! You have to start at the next line when you get to the vertical line dividing pages.

I am building just another AWS automation tool but hiding any AWS related concept. Integrating a lot of services like MongoDB, Redis, Cassandra and all this cool hyped stuff.

APIs, REST, distributed, fault tolerance... Loving Netflix OSS!!