File tree Expand file tree Collapse file tree
src/number_Programming/core/day_01 Expand file tree Collapse file tree Original file line number Diff line number Diff line change 1+ README.md
2+ # Java Programming Practice
3+
4+ A structured Java practice repository focused on building strong programming fundamentals
5+ through day-wise problem solving.
6+
7+ ---
8+
9+ ## 📁 Core Level – Number Programming
10+
11+ - ** Day 01: Core Number Programs**
12+ 👉 [ View Day 01 Programs] ( src/number_Programming/core/day_01 )
13+
14+ ---
15+
16+ ## Repository Structure
17+
18+
19+ Each day contains:
20+ - Separate Java files for each problem
21+ - A README explaining the problem set and objectives
22+
23+ ---
24+
25+ ## Goal
26+
27+ - Strengthen logical thinking
28+ - Improve control flow understanding
29+ - Build clean and reusable Java code
30+ - Prepare for interviews and advanced Java topics
Original file line number Diff line number Diff line change 11package number_Programming .core .day_01 ;
22import java .util .Scanner ;
33//12.write a program to produce the fibonacci series
4- public class FibonacciSeries
4+ public class FibonacciSeires
55{
6- public static void main (String [] args ) {
7- Scanner sc = new Scanner (System .in );
8- System .out .println ("Enter n value : " );
9- int n = sc .nextInt ();
10- int a = 0 ;
11- int b = 1 ;
12- for (int i = 1 ;i <=n ;i ++)
13- {
14- System .out .println (a );
15- int c = a +b ;
16- a =b ;
17- b =c ;
6+ public static void main (String [] args ) {
7+ Scanner sc = new Scanner (System .in );
8+ System .out .println ("Enter n value : " );
9+ int n = sc .nextInt ();
10+ int a = 0 ;
11+ int b = 1 ;
12+ for (int i = 1 ;i <=n ;i ++)
13+ {
14+ System .out .println (a );
15+ int c = a +b ;
16+ a =b ;
17+ b =c ;
18+ }
1819 }
1920}
20- }
You can’t perform that action at this time.
0 commit comments