New Relic interview question
Write a recursive b-tree traversal algorithm counting every Nth number in the Fibinacci sequence. I did not succeed.
Write a recursive b-tree traversal algorithm counting every Nth number in the Fibinacci sequence. I did not succeed.
Check out your Company Bowl for anonymous work chats.