TransUnion interview question
WAP to do Fibonacci in recursion
Interview Answer
Anonymous
Aug 23, 2023
int fib(int n) { if (n <= 1) return n; return fib(n - 1) + fib(n - 2); }
WAP to do Fibonacci in recursion
Anonymous
int fib(int n) { if (n <= 1) return n; return fib(n - 1) + fib(n - 2); }
Check out your Company Bowl for anonymous work chats.