Fibonacci number
public class Solution{
public int Fibonacci(int n){
int []arr=new int[40];
arr[0]=0;
arr[1]=1;
for(int i=2;i<40;i++){
arr[i]=arr[i-1]+arr[i-2];
}
return arr[n];
}
}
Cattle off the Internet to do, platform test n <39, so that's it.