feat: Implement Fibonacci sequence generator to find nth number

📌 Logic:
- Takes an integer `n` as input to find the nth number in the Fibonacci sequence.
- Initializes first two terms: `a = 0` and `b = 1`.
- Iteratively calculates the next Fibonacci numbers using:
  `b = a + b` and `a = previous b`
- Loop continues until the nth term is reached (starting count from 2).
- Outputs the nth Fibonacci number.

Signed-off-by: Somesh diwan <[email protected]>

Author: Someshdiwan

Section7ConditionalStatements/Practice/src/Fibo.java renamed to Section7ConditionalStatements/Practice/src/FibonacciSequence.java

@@ -1,20 +1,20 @@
 import java.util.Scanner;
 
-public class Fibo {
+public class FibonacciSequence {
     public static void main(String[] args) {
         Scanner in = new Scanner(System.in);
         int n = in.nextInt();
+
         int a = 0;
         int b = 1;
-        int count = 2;
 
+        int count = 2;
         while (count <= n) {
             int temp = b;
             b = b + a;
             a = temp;
             count++;
         }
-
         System.out.println(b);
     }
 }