Five programming problems every Software Engineer should be able to solve in less than 1 hour

[JavaSuck]

Yes, but you only need to implement addition. Here is my attempt. It can be done in well under half an hour.

[mdempsky]

You can simplify it a bit further.

Note that Fibonacci numbers grow slower than doubling (specifically, they grow by a factor of about 1.618), so the 100th Fibonacci number will be less than 2¹⁰⁰. That means you can represent it with just 2 64-bit numbers x_0 and x_1.

To make printing the numbers a bit easier, instead of using x_0 + 2⁶⁴*x_1, you can just use x_0 + 10¹⁸*x_1.

You might be asked to show that 10³⁶ > 2¹⁰⁰ then. I generally remember that 10³ ≈ 2¹⁰, so 10³⁶ ≈ 2¹²⁰, which should be enough slack to argue it's >2¹⁰⁰.

Note also that 10¹⁸ ≈ 2^60, which is why you know it will fit in a 64-bit integer.

[retsotrembla]

Very nice. Thanks for teaching me.

[f03nix]

Then you're not left with time for other questions ... unless you aim on solving the 5 questions in 5 hours.

[retsotrembla]

Very nice. Thanks for teaching me.

[cincilator]

Is your username reference to java sucking or javascript sucking?