Name: Anonymous 2020-04-22 15:51
Amazingly, I had a technical interview yesterday via webex, which featured a question for calculating the nth term of fibs in a curly-bracket language. Being both an ENTERPRISE CUDDER and a long-time prog-rider and who has implemented fibs is a number of both popular and esoteric languages (including some of my own creation), this was an easy task , and I rattled off a solution as follows:
Afterwards we discussed that the flaws of this approach, and alternate solutions (where I described a standard iterative solution). I was then probed for a further 90 minutes on various topics.
Today I found out that my application won't be progressing further, and one piece of feedback was that my fibs looked like it had been googled. It seems like my fibs-fu was too strong for these plebs!
int Fibonacci(int n)
{
switch(n)
{
case 0:
throw new InvalidFibonacciTermException();
case 1:
case 2:
return 1;
default:
return Fibonacci(n-1) + Fibonacci(n-2);
}
}Afterwards we discussed that the flaws of this approach, and alternate solutions (where I described a standard iterative solution). I was then probed for a further 90 minutes on various topics.
Today I found out that my application won't be progressing further, and one piece of feedback was that my fibs looked like it had been googled. It seems like my fibs-fu was too strong for these plebs!