diff --git a/README.md b/README.md
index 39a62d0..d2e896a 100644
--- a/README.md
+++ b/README.md
@@ -1,6 +1,45 @@
-## DSA + Interview preparation bootcamp
+
+ DSA + Interview preparation bootcamp
+
+
+Make sure to :star: my DSA repo so you can keep up to date on any daily progress!
+
+
+
+ 
+
+
+
+
+ Welcome to the Complete DSA Preparation Course - Java! This repository is your comprehensive guide to mastering Data Structures and Algorithms (DSA) using Java. Whether you're a beginner or looking to sharpen your skills, this course covers all the essential topics needed to excel in coding interviews and software development.
+
+
+
+
### Contents:
- [**Lectures**](https://github.com/Developer-RONNIE/DSA-Bootcamp-Java/tree/main/assignments)
-- [**Assignments** (solutions can be found on LeetCode until I update the repo)](https://github.com/Developer-RONNIE/DSA-Bootcamp-Java/tree/main/lectures)
-- [**Connect with me** ](https://github.com/Developer-RONNIE)
\ No newline at end of file
+- [**Assignments** (List of Question to Practise)](https://github.com/Developer-RONNIE/DSA-Bootcamp-Java/tree/main/lectures)
+- [**Solutions** (Solutions to Assignments questions Can be found here)](https://github.com/Developer-RONNIE/DSA-Bootcamp-Java/tree/main/solutions)
+
+### Bonus:
+Enhance your LeetCode problem-solving experience with this organized collection of solutions. Find everything you need in one place, saving you valuable time.
+
+
+ 
+
+
+
+
+
+
+ Connect With Me
+
+
+
+ 
+ 
+ 
+
+
+
diff --git a/SYLLABUS.md b/SYLLABUS.md
index e9c72d5..766f6b0 100644
--- a/SYLLABUS.md
+++ b/SYLLABUS.md
@@ -1,3 +1,5 @@
+# TOPICS
+
- [Complete Git & GitHub Course](https://youtu.be/apGV9Kg7ics)
- [Introduction to Programming](https://youtu.be/wn49bJOYAZM)
- [Types of languages](https://youtu.be/wn49bJOYAZM?t=171)
diff --git a/assignments/01-flow-of-program.md b/assignments/01-flow-of-program.md
index 2f7d14f..1a5de6c 100644
--- a/assignments/01-flow-of-program.md
+++ b/assignments/01-flow-of-program.md
@@ -7,3 +7,6 @@
3. Take a number as input and print the multiplication table for it.
4. Take 2 numbers as inputs and find their HCF and LCM.
5. Keep taking numbers as inputs till the user enters ‘x’, after that print sum of all.
+
+## Solutions to the question
+[LINK](https://github.com/Developer-RONNIE/DSA-Bootcamp-Java/tree/main/solutions/01-flow-of-program)
diff --git a/assignments/02-first-java.md b/assignments/02-first-java.md
index dbf7309..1905d8f 100644
--- a/assignments/02-first-java.md
+++ b/assignments/02-first-java.md
@@ -15,3 +15,8 @@ find Simple Interest.
8. To find out whether the given String is Palindrome or not.
9. To find Armstrong Number between two given number.
+## Solutions to the question
+[LINK](https://github.com/Developer-RONNIE/DSA-Bootcamp-Java/tree/main/solutions/02-first-java)
+
+
+
diff --git a/lectures/08-arrays/.gitignore b/lectures/08-arrays/.gitignore
index f68d109..8fcee8a 100644
--- a/lectures/08-arrays/.gitignore
+++ b/lectures/08-arrays/.gitignore
@@ -3,6 +3,7 @@ out/
!**/src/main/**/out/
!**/src/test/**/out/
+
### Eclipse ###
.apt_generated
.classpath
diff --git a/lectures/08-arrays/src/com/Ron/Main.java b/lectures/08-arrays/src/com/Ron/Main.java
index 0f171d1..f0441e8 100644
--- a/lectures/08-arrays/src/com/Ron/Main.java
+++ b/lectures/08-arrays/src/com/Ron/Main.java
@@ -1,7 +1,38 @@
package com.Ron;
public class Main {
+
public static void main(String[] args) {
- System.out.println("Hello world!");
+ // Q: store a roll number
+ int a = 19;
+
+ // Q: store a person's name
+ String name = "Ronnie";
+
+ // Q: store 3 roll numbers
+ int rno1 = 23;
+ int rno2 = 55;
+ int rno3 = 18;
+
+ // * Syntax Of Array *
+ // datatype[] variable_name = new datatype[size];
+
+ // Q: store 5 roll numbers:
+// int[] rnos = new int[5];
+// // or directly
+// int[] rnos2 = {23, 12, 45, 32, 15};
+
+ int[] ros; // declaration of array: ros is getting defined in the stack
+ ros = new int[5]; // initialisation: actually here object is being created in the memory (heap)
+
+// System.out.println(ros[1]);
+
+ String[] arr = new String[4];
+ System.out.println(arr[0]);
+
+// for (String element : arr) {
+// System.out.println(element);
+// }
+
}
}
\ No newline at end of file