Senior Software Engineer

The n-th term of Fibonacci series F(n), where F(n) is a function, is calculated using the following formula -

    F(n) = F(n - 1) + F(n - 2), 
    Where, F(1) = 1, F(2) = 1

Provided 'n' you have to find out the n-th Fibonacci Number. Handle edges cases like when 'n' = 1 or 'n' = 2 by using conditionals like if else and return what's expected.

"Indexing is start from 1"

Example :

Input: 6

Output: 8

Explanation: The number is ‘6’ so we have to find the “6th” Fibonacci number.
So by using the given formula of the Fibonacci series, we get the series:    
[ 1, 1, 2, 3, 5, 8, 13, 21]
So the “6th” element is “8” hence we get the output.

public class MyFirst {  
     public static void main(String[] args) {  
        MyFirst obj = new MyFirst(n);  
}  
static int a = 10;  
static int n;  
int b = 5;  
int c;  
public MyFirst(int m) {  
      System.out.println(a + ", " + b + ", " + c + ", " + n + ", " + m);  
  }  
// Instance Block  
 {  
    b = 30;  
    n = 20;  
 }   
// Static Block  
 static   
{  
         a = 60;  
    }   
}

He asked from me one puzzle.3 Ants and Triangle.There are 3 ants sitting on three corners of a triangle. All ants randomly pick a direction and start moving along edge of the triangle. What is the probability that any two ants collide?