diff --git a/AreaOfCircle.java b/AreaOfCircle.java
new file mode 100644
index 0000000..898b38e
--- /dev/null
+++ b/AreaOfCircle.java
@@ -0,0 +1,22 @@
+import java.util.Scanner;
+
+class AreaOfCircle 
+{
+	public static void main(String[] args) 
+	{
+		Scanner s = new Scanner(System.in);
+		System.out.print("Enter the radius of circle: ");
+		int r = s.nextInt();
+		s.close();
+		
+		System.out.println("The Area of Circle is = "+ area(r));
+		
+	}
+
+     public static float area(int r)
+	{
+		 return 3.14f*(r*r);
+	}
+
+
+}
diff --git a/Armstrong.java b/Armstrong.java
new file mode 100644
index 0000000..1ec6efd
--- /dev/null
+++ b/Armstrong.java
@@ -0,0 +1,50 @@
+import java.util.Scanner;
+
+
+class Armstrong
+{
+	public static void main(String[] args) 
+	{
+		Scanner s = new Scanner(System.in);
+
+		// System.out.println("Enter the number of digits: ");
+		// int len = s.nextInt();
+
+		System.out.println("Enter a Number to check: ");
+		int n = s.nextInt();
+		int str = n;
+		int str1 = n;
+		//len = String.valueOf(str).length();
+		int   sum = 0, count=0;
+		s.close();
+
+		while(str1!=0){
+			count++;
+			str1/=10;
+		}
+		// System.out.println(count);
+		
+		while(n!=0){
+			
+			int rem = n%10;
+
+			//int cube = rem*rem*rem;
+			int pow = 1;
+			for(int i = 1; i<=count; i++)
+			{
+				pow = pow * rem;
+			}
+
+			 sum = sum + pow;
+			//  sum = sum + (Math.pow(rem,count));
+
+			 n/=10;
+		}			
+		if(str == sum)
+			System.out.println(str+ " is an ArmStrong Number");
+		else
+			System.out.println(str + " is Not a ArmStrong Number");
+
+
+	}
+}
diff --git a/Double.java b/Double.java
new file mode 100644
index 0000000..3be81d1
--- /dev/null
+++ b/Double.java
@@ -0,0 +1,21 @@
+class Double
+{
+public static void main(String[] args)
+{
+	System.out.println("Hello Sarwesh");
+
+	//byte to all
+	double i = 1.3;
+	byte a = (byte)i;
+	short b = (short)i;
+	int c = (int)i;
+	long d = (long)i;
+	float e = (float)i;
+	System.out.println(a);
+	System.out.println(b);
+	System.out.println(c);
+	System.out.println(d);
+	System.out.println(e);
+		
+}
+}
diff --git a/EvenOdd.java b/EvenOdd.java
new file mode 100644
index 0000000..3467e88
--- /dev/null
+++ b/EvenOdd.java
@@ -0,0 +1,28 @@
+import java.util.Scanner;
+
+class StrongNumber 
+{
+	public static void main(String[] args) 
+	{
+		Scanner s = new Scanner(System.in);
+		System.out.println("Enter a value: ");
+		int n = s.nextInt();
+		int rem, res=1, sum=0;
+		s.close();
+		
+		while(n!=0){
+
+			rem = n%10;
+
+			while(rem!=0){
+
+				res = res*rem;
+				rem--;
+				sum = sum + res;
+			}
+			n = n/10;
+
+		
+		}
+	}
+}
diff --git a/Float.java b/Float.java
new file mode 100644
index 0000000..560ca78
--- /dev/null
+++ b/Float.java
@@ -0,0 +1,21 @@
+class Float
+{
+public static void main(String[] args)
+{
+	System.out.println("Hello Sarwesh");
+
+	//byte to all
+	float i = 1.0f;
+	byte a = (byte)i;
+	short b = (short)i;
+	int c = (int)i;
+	long d = (long)i;
+	double e = (double)i;
+	System.out.println(a);
+	System.out.println(b);
+	System.out.println(c);
+	System.out.println(d);
+	System.out.println(e);
+		
+}
+}
diff --git a/FunctionCall.java b/FunctionCall.java
new file mode 100644
index 0000000..e88b187
--- /dev/null
+++ b/FunctionCall.java
@@ -0,0 +1,18 @@
+class FunctionCall 
+{
+	public static void main(String[] args) 
+	{
+
+		int a = 10;
+		int b = 12, c=(int)display(a,b) ;
+		System.out.println(c);
+		
+	}
+	public static double display(int c, int d)
+	{
+		System.out.println("Addition is");
+		return (c+d);
+	}
+
+
+}
diff --git a/Hello.java b/Hello.java
new file mode 100644
index 0000000..116e040
--- /dev/null
+++ b/Hello.java
@@ -0,0 +1,21 @@
+class Hello
+{
+public static void main(String[] args)
+{
+	System.out.println("Hello Sarwesh");
+
+	//byte to all
+	byte i = 1;
+	short a = (short)i;
+	int b = (int)i;
+	long c = (long)i;
+	float d = (float)i;
+	double e = (double)i;
+	System.out.println(a);
+	System.out.println(b);
+	System.out.println(c);
+	System.out.println(d);
+	System.out.println(e);
+		
+}
+}
diff --git a/Int.java b/Int.java
new file mode 100644
index 0000000..c134002
--- /dev/null
+++ b/Int.java
@@ -0,0 +1,21 @@
+class Int
+{
+public static void main(String[] args)
+{
+	System.out.println("Hello Sarwesh");
+
+	//byte to all
+	int i = 1;
+	byte a = (byte)i;
+	short b = (short)i;
+	long c = (long)i;
+	float d = (float)i;
+	double e = (double)i;
+	System.out.println(a);
+	System.out.println(b);
+	System.out.println(c);
+	System.out.println(d);
+	System.out.println(e);
+		
+}
+}
diff --git a/LL_inbuilt.java b/LL_inbuilt.java
new file mode 100644
index 0000000..2619828
--- /dev/null
+++ b/LL_inbuilt.java
@@ -0,0 +1,32 @@
+import java.util.LinkedList;
+// import java.util.Stack;
+
+
+
+
+public class LL_inbuilt {
+    public static void main(String[] args) {
+        LinkedList<Integer> l = new LinkedList<>();
+     
+        l.add(4);
+        l.add(5);
+        l.add(6);
+        l.add(7);
+        l.add(8);
+        l.add(0, 1);
+        System.out.println(l.element()); 
+        int i;
+        for( i = 0; i<l.size()-1;i++)
+        {
+            System.out.print(l.get(i)+"->");
+        }
+        System.out.println(l.get(i));
+        // int x = l.size(),i=0;
+        //     while(x-- !=0)
+        //     {
+        //         System.out.print(l.get(i++)+"->");
+                
+        //     }
+
+    }
+}
diff --git a/LinkedList.java b/LinkedList.java
new file mode 100644
index 0000000..fb3b78a
--- /dev/null
+++ b/LinkedList.java
@@ -0,0 +1,123 @@
+class Node
+{
+    int data;
+    Node next;
+}
+
+class Data{
+    
+    Node head;
+   
+
+    public void insert(int data)
+    {
+
+       Node node = new Node();
+
+       node.data = data;
+       node.next = null;
+
+
+
+        if(head == null)
+        {
+            head = node; 
+        }
+        else
+        {
+            Node temp = head;
+
+            while(temp.next!=null)
+            {
+                temp = temp.next;
+            }
+            temp.next = node;
+        }
+    }
+
+    public void insertBeg(int data)
+    {
+        Node node = new Node();
+        node.data = data;
+        // node.next = null;
+
+        node.next = head;
+        head = node;
+    }
+
+    public void insertAfter(int data, int loc)
+    {
+        Node node = new Node();
+        node.data = data; 
+
+        Node temp = head;
+
+        if(loc == 0)
+        {
+            insertBeg(data);
+        }
+        else{
+        for (int i = 0; i <loc-1; i++) {
+            temp = temp.next;
+        }
+        node.next = temp.next;
+        temp.next = node;
+    }
+    }
+
+    public void deleteAt(int index)
+    {
+        Node n = head;
+        if(index == 0)
+        {
+            head = head.next;
+        }
+        else{
+            for (int i = 1; i <index; i++) {
+                n = n.next;
+            }
+            Node n1 = null;
+            n1 = n.next;
+            n.next = n1.next;
+        }
+    }
+
+
+    public void show(){
+        Node node = head;
+
+        while(node.next!=null)
+        {
+            System.out.print(node.data+"->");
+            node = node.next;
+        }
+        System.out.println(node.data); 
+    }
+}
+
+
+public class LinkedList {
+
+    public static void main(String[] args) {
+        Data d = new Data();
+
+        d.insert(1);
+        d.insert(2);
+        d.insert(3);
+        d.insert(4);
+        d.insert(5);
+        d.insert(6);
+        d.insert(7);
+        // d.insertBeg(12);
+        // d.insertBeg(13);
+        // d.insertAfter(14, 2);
+        // d.insertAfter(15, 0);
+        // d.insertAfter(155, 4);
+        d.deleteAt(2);
+        d.deleteAt(0);
+
+
+        d.show();
+    }
+    
+}
diff --git a/LocalVariables.java b/LocalVariables.java
new file mode 100644
index 0000000..fa03e84
--- /dev/null
+++ b/LocalVariables.java
@@ -0,0 +1,22 @@
+class LocalVariables 
+{
+	static int i;
+	static double d = 20.98;
+	public static void main(String[] args) 
+	{
+		int a = 20; //local variable doesn't have a default value
+		
+			System.out.println(i);
+			System.out.println(a);
+			System.out.println(d);
+			demo(a);
+
+	}
+
+	public static void demo(int a)
+	{
+		System.out.println(a);
+		System.out.println(d);
+	}
+
+}
diff --git a/Long.java b/Long.java
new file mode 100644
index 0000000..a7bed98
--- /dev/null
+++ b/Long.java
@@ -0,0 +1,21 @@
+class Long
+{
+public static void main(String[] args)
+{
+	System.out.println("Hello Sarwesh");
+
+	//byte to all
+	long i = 1;
+	byte a = (byte)i;
+	short b = (short)i;
+	int c = (int)i;
+	float d = (float)i;
+	double e = (double)i;
+	System.out.println(a);
+	System.out.println(b);
+	System.out.println(c);
+	System.out.println(d);
+	System.out.println(e);
+		
+}
+}
diff --git a/MChain.java b/MChain.java
new file mode 100644
index 0000000..28bb49d
--- /dev/null
+++ b/MChain.java
@@ -0,0 +1,25 @@
+class MChain 
+{
+	public static void main(String[] args) 
+	{
+		System.out.println("main 1");
+		sundra();
+		System.out.println("main end");
+	}
+
+	public static void sundra()
+	{
+		System.out.println("sundra 1");
+		sundri();
+		System.out.println("sundra end");
+	}
+	public static void sundri()
+	{
+		System.out.println("sundri 1");
+		
+		System.out.println("sundri end");
+	}
+
+
+
+}
diff --git a/Palindrome.java b/Palindrome.java
new file mode 100644
index 0000000..b282941
--- /dev/null
+++ b/Palindrome.java
@@ -0,0 +1,25 @@
+import java.util.Scanner;
+
+class Palindrome
+{
+	public static void main(String[] args) 
+	{
+		Scanner s = new Scanner(System.in);
+		System.out.println("Enter a value: ");
+		int n = s.nextInt();
+		int str = n;
+		int   sum = 0;
+		s.close();
+		
+		while(n!=0){
+			
+			int rem = n%10;
+			sum = (sum*10)+rem;
+			 n/=10;
+		}			
+		if(str == sum)
+			System.out.println("Palindrome Number");
+		else
+			System.out.println("Not a Palindrome Number");
+		}
+}
diff --git a/ParanthesisChecker.java b/ParanthesisChecker.java
new file mode 100644
index 0000000..0c05f59
--- /dev/null
+++ b/ParanthesisChecker.java
@@ -0,0 +1,43 @@
+
+import java.util.Stack;
+
+
+
+public class ParanthesisChecker {
+    public static void main(String[] args) {
+        Stack<Character> st = new Stack<>();
+
+        String str = "{}}";
+
+        for(int i = 0; i<str.length();i++)
+        {
+            if(str.charAt(i) == '[' || str.charAt(i) == '{'|| str.charAt(i) == '(' )
+            {
+                st.push(str.charAt(i));
+            }
+
+            else if( !st.isEmpty() &&
+                    ((str.charAt(i) == ')' && st.peek() == '(') ||
+                
+                    (str.charAt(i) == ']' && st.peek() == '[') ||
+
+                    (str.charAt(i) == '}' && st.peek() == '{') ))
+                    {
+                        st.pop();
+                    }
+
+            else{
+                st.push(str.charAt(i));
+            }
+        }
+        System.out.println();
+        if(st.isEmpty()){
+            System.out.println();
+            System.out.println(str + " is balanced");}
+        else
+            System.out.println(str + " is not balanced");
+
+            System.out.println();
+            System.out.println();
+    }
+}
diff --git a/RepEle.java b/RepEle.java
new file mode 100644
index 0000000..f019414
--- /dev/null
+++ b/RepEle.java
@@ -0,0 +1,29 @@
+// import jdk.javadoc.internal.doclets.formats.html.SourceToHTMLConverter;
+
+public class RepEle {
+
+    static void findcommon(int a[])
+    {
+        int b[] = {-1,-1,-1,-1,-1,-1,-1};
+        for(int i = 0; i < a.length; i++)
+        {
+            b[a[i]] += i;  
+        }
+                                                                //WRONG PROGRAM
+        for(int ele:b)
+        {
+            System.out.print(ele+" ");
+
+            if(ele == 2)
+            {
+                System.out.println(" "+a[ele]+" ");
+                System.out.println("ele");
+                System.out.println("========================");
+            }
+        }
+    }
+    public static void main(String[] args) {
+        int a[] = {1,3,5,4,3,5,6};
+        findcommon(a);
+    }
+}
diff --git a/ReverseLL.java b/ReverseLL.java
new file mode 100644
index 0000000..0040083
--- /dev/null
+++ b/ReverseLL.java
@@ -0,0 +1,95 @@
+public class ReverseLL
+{
+    static Node Head;
+
+    static class Node{
+        int data;
+        Node next;
+
+        Node(int data)
+        {
+            this.data = data;
+            next = null;
+        }
+    }
+
+    Node reverse(Node node)
+    {
+        Node current = node;
+        Node prev = null;
+        Node next = null;
+
+        while(current!=null)
+        {
+            next = current.next;
+            current.next = prev;
+            prev = current;
+            current = next;
+
+        }
+        node = prev;
+        return node;
+    }
+
+    void print_recursive(Node Head)
+    {
+        if(Head == null)
+            return;
+        else{
+            System.out.print(Head.data+"->");
+            print_recursive(Head.next);
+        }
+    }
+
+    void printRev_recursive(Node Head)
+    {
+        if(Head == null)
+            return;
+        else{
+            printRev_recursive(Head.next);
+            System.out.print(Head.data+"->");
+        }
+    }
+
+    void printNode(Node node){
+        
+        while(node!=null)
+        {
+            System.out.print(node.data +"->");
+            node = node.next;
+        }
+    }
+
+    public static void main(String[] args) {
+        ReverseLL l = new ReverseLL();
+
+        Head = new Node(85);
+        Head.next = new Node(1);
+        Head.next.next = new Node(2);
+        Head.next.next.next = new Node(3);
+        Head.next.next.next.next = new Node(4);
+
+        System.out.println("Before reversing");
+        l.printNode(Head);
+        // Head = l.reverse(Head);
+        // Head = l.reverse(Head);
+        System.out.println();
+        // System.out.println("After reversing");
+        // l.printNode(Head); 
+
+
+        System.out.println();
+        System.out.println("using recursion printing");
+        l.print_recursive(Head);
+        System.out.println();
+        System.out.println("using recursion revesrse printing");
+        l.printRev_recursive(Head);
+        
+
+    }
+}
+
+
+
+
+
diff --git a/Reverse_LL_using_recursion.java b/Reverse_LL_using_recursion.java
new file mode 100644
index 0000000..1b55bcd
--- /dev/null
+++ b/Reverse_LL_using_recursion.java
@@ -0,0 +1,67 @@
+
+
+public class Reverse_LL_using_recursion {
+
+    static Node head;
+
+    static class Node
+    {
+        int data;
+        Node next;
+
+        Node(int data)
+        {
+            this.data = data;
+            next = null;
+        }
+    }
+
+
+    public void Reverse_rec(Node p)
+    {
+        if(p.next == null)
+        {
+            head = p;
+            return;
+        }
+        Reverse_rec(p.next);
+        Node q = p.next;
+        q.next = p;
+        p.next = null;
+    }
+
+    public void print(Node n)
+    {
+        while(n.next != null)
+        {
+            System.out.print(n.data+"->");
+            n = n.next;
+        }
+        System.out.println(n.data);
+    }
+    public static void main(String[] args) {
+        Reverse_LL_using_recursion rll = new Reverse_LL_using_recursion();
+
+        head = new Node(85);
+        head.next = new Node(1);
+        head.next.next = new Node(2);
+        head.next.next.next = new Node(3);
+        head.next.next.next.next = new Node(4);
+
+        System.out.println("Before reversing");
+        rll.print(head);
+
+        System.out.println();
+
+        rll.Reverse_rec(head);
+
+        System.out.println("After reversing");
+
+        rll.print(head);
+
+        
+
+
+
+    }
+}
diff --git a/Short.java b/Short.java
new file mode 100644
index 0000000..130c675
--- /dev/null
+++ b/Short.java
@@ -0,0 +1,21 @@
+class Short
+{
+public static void main(String[] args)
+{
+	System.out.println("Hello Sarwesh");
+
+	//byte to all
+	short i = 1;
+	byte a = (byte)i;
+	int b = (int)i;
+	long c = (long)i;
+	float d = (float)i;
+	double e = (double)i;
+	System.out.println(a);
+	System.out.println(b);
+	System.out.println(c);
+	System.out.println(d);
+	System.out.println(e);
+		
+}
+}
diff --git a/Static.java b/Static.java
new file mode 100644
index 0000000..1e9429b
--- /dev/null
+++ b/Static.java
@@ -0,0 +1,23 @@
+class Static {
+
+    static int a;
+    static double b;
+    static String s;
+    
+
+    public static void main(String[] args) {
+        
+                System.out.println(a);
+                System.out.println(b);
+                System.out.println(s);
+               
+                
+    }
+    static {
+        System.out.println(a);
+        a = 20;
+    }
+
+    
+
+}
\ No newline at end of file
diff --git a/StringReverseUsingArrays.java b/StringReverseUsingArrays.java
new file mode 100644
index 0000000..86683a8
--- /dev/null
+++ b/StringReverseUsingArrays.java
@@ -0,0 +1,25 @@
+import java.util.Scanner;
+
+public class StringReverseUsingArrays {
+    public static void main(String[] args) {
+
+        Scanner sc = new Scanner(System.in);
+        System.out.println("Enter a word");
+        String s = sc.nextLine();
+        char arr[] = s.toCharArray();
+        // System.out.println(s);
+
+        sc.close();
+
+        for (int i = 0; i < arr.length/2; i++) {
+            char temp = arr[i];
+            arr[i] = arr[arr.length-1-i];
+            arr[arr.length-1-i] = temp;
+        }
+
+        for (char c : arr) {
+            System.out.print(c);
+        }
+    }
+    
+}
diff --git a/StringReverseUsingStack.java b/StringReverseUsingStack.java
new file mode 100644
index 0000000..222a1bd
--- /dev/null
+++ b/StringReverseUsingStack.java
@@ -0,0 +1,33 @@
+import java.util.Stack;
+
+public class StringReverseUsingStack {
+
+
+    public void reverseS(String q, int n)
+    {
+        Stack<Character> s = new Stack<>();
+
+        for (int i = 0; i < n; i++) {
+            s.push(q.charAt(i));            
+        }
+        System.out.print(q);
+        System.out.println();
+
+       while(!s.empty())
+       {
+           System.out.print(s.pop());
+       }
+
+    }
+    public static void main(String[] args) {
+
+        String st = "HelloWorld my name is gabbar";
+
+        StringReverseUsingStack sss = new StringReverseUsingStack();
+        sss.reverseS(st, st.length());
+
+
+
+    }
+    
+}
diff --git a/Strong.java b/Strong.java
new file mode 100644
index 0000000..15e4c7b
--- /dev/null
+++ b/Strong.java
@@ -0,0 +1,35 @@
+import java.util.Scanner;
+
+class Strong
+{
+	public static void main(String[] args) 
+	{
+		Scanner s = new Scanner(System.in);
+		System.out.println("Enter a value: ");
+		int n = s.nextInt();
+		int rem = 0, res=1, sum = 0;
+		s.close();
+		
+		while(n!=0){
+
+			rem = n%10;
+
+			while(rem!=0){
+
+				res = res*rem;
+				rem--;
+				sum = sum + res;
+			}
+			n = n/10;
+
+		
+		}
+
+		if(sum == n)
+			System.out.println("Strong Number");
+		else
+			System.out.println("Not a Strong Number");
+
+
+	}
+}
diff --git a/StrongNumber1.java b/StrongNumber1.java
new file mode 100644
index 0000000..8a2e812
--- /dev/null
+++ b/StrongNumber1.java
@@ -0,0 +1,43 @@
+import java.util.Scanner;
+
+class StrongNumber1 
+{
+	public static void main(String[] args) 
+	{
+		Scanner s = new Scanner(System.in);
+		System.out.println("Enter a value: ");
+		int n = s.nextInt();
+		int str = n;
+		int   sum = 0;
+		s.close();
+		
+		while(n!=0){
+			int fact=1;
+			int rem = n%10;
+
+			while(rem!=0){
+
+				fact = fact*rem;
+				--rem;
+				
+			}
+
+//			for(int i = 1; i<=rem;i++)
+//			{
+//				fact = fact*i;
+//			}
+
+			sum = sum + fact;
+			n /= 10;
+
+		
+		}
+
+		if(str == sum)
+			System.out.println("Strong Number");
+		else
+			System.out.println("Not a Strong Number");
+
+
+	}
+}
diff --git a/TC.java b/TC.java
new file mode 100644
index 0000000..2bf7a42
--- /dev/null
+++ b/TC.java
@@ -0,0 +1,14 @@
+class TC
+{
+public static void main(String[] args)
+{
+	
+	int a=122;
+	float b=122f;
+	
+	System.out.println(a==b);
+
+
+	
+}
+}
\ No newline at end of file
diff --git a/arrays.java b/arrays.java
new file mode 100644
index 0000000..ef5906f
--- /dev/null
+++ b/arrays.java
@@ -0,0 +1,45 @@
+// import java.util.Scanner;
+
+public class arrays {
+
+    public static void main(String[] args) {
+        // int [] marks = new int[5];
+
+        // int [] marks;
+        // marks = new int[5];
+
+        // 3rd method
+        // Scanner sc = new Scanner(System.in);
+        
+        // for(int i =0; i<5; i++){
+            
+            //     marks[i] = sc.nextInt();
+            
+            
+            // }
+            // sc.close();
+            
+            // for(int i =0; i<5; i++){
+                
+                
+                //     System.out.print(marks[i]);
+                
+                
+                // }
+                int [] marks = {1,2,3,4,5};
+                System.out.println(marks[4]);
+                System.out.println(marks.length);
+
+                for(int i =marks.length-1; i>-1; i--){              
+                        System.out.print(marks[i]+" ");                    
+                    }
+                    System.out.println();
+                for (int element : marks) {
+                    
+                    System.out.print(element+" ");
+
+                    
+                }
+            }
+            
+}
diff --git a/descision.java b/descision.java
new file mode 100644
index 0000000..e7fcc62
--- /dev/null
+++ b/descision.java
@@ -0,0 +1,17 @@
+class Descision
+{
+public static void main(String[] args)
+{
+	int i = 10;
+	if(i == 10)
+	{
+		System.out.println(i+" Matching ");
+	}
+	else
+	{
+		 
+		System.out.println(i+ " NotMatching ");
+	}
+}
+
+}
\ No newline at end of file
diff --git a/firstclass.java b/firstclass.java
new file mode 100644
index 0000000..6018ff4
--- /dev/null
+++ b/firstclass.java
@@ -0,0 +1,49 @@
+
+class Employee{
+    int id;
+    String name;
+    double salary;
+
+    public double getsalary()
+    {
+        return salary;
+    }
+
+    public void getdetails(){
+        System.out.println("id is " +id);
+        System.out.println("Name is "+ name);
+
+    }
+
+    public void setdetails(String n){
+        name = n;
+    }
+}
+
+
+public class firstclass {
+
+    public static void main(String[] args){
+
+        Employee Sarwesh = new Employee();
+        Employee Suresh = new Employee();
+
+        Sarwesh.id = 1;
+        Sarwesh.name = "Sarwesh Shenvi";
+        Sarwesh.setdetails("Stunner59");
+        Sarwesh.salary = 89000;
+        Sarwesh.getdetails();
+        System.out.println(Sarwesh.name + " salary is " +Sarwesh.getsalary());
+        System.out.println();
+        
+
+
+        Suresh.id = 2;
+        Suresh.name = "Suresh Bhagath";
+        Suresh.salary = 8000;
+        Suresh.getdetails();
+        System.out.println(Suresh.name + " salary is " +Suresh.getsalary());          
+
+    }
+    
+}
diff --git a/guessingGame.java b/guessingGame.java
new file mode 100644
index 0000000..149f449
--- /dev/null
+++ b/guessingGame.java
@@ -0,0 +1,66 @@
+import java.util.Scanner;
+import java.util.Random;
+
+class Game {
+
+    int number;
+    int inputNumber;
+    int numcount = 0;
+
+    Game() {
+        Random rand = new Random();
+        number = rand.nextInt(100);
+        // System.out.println(number);
+    }
+
+    Scanner sc = new Scanner(System.in);
+    int input() {
+        System.out.println("Guess a Number!!");
+        inputNumber = sc.nextInt();
+        return inputNumber;
+
+    }
+
+    boolean checkNumber() {
+
+        numcount++;
+        if (number == inputNumber) {
+            System.out.println("Congratulations you guessed it right in " + numcount + " attempts!!");
+
+            return true;
+        } else if ((inputNumber < (number + 5) && inputNumber > (number - 5))) {
+            System.out.println("Number is near");
+        } else if (inputNumber > number) {
+            System.out.println("Number too High!!");
+
+        } else if (inputNumber < number) {
+            System.out.println("Number too Low!!");
+
+        }
+        return false;
+
+    }
+    void Close(){
+
+        sc.close();
+    }
+
+}
+
+public class guessingGame {
+    public static void main(String[] args) {
+
+        boolean b = false;
+        Game G = new Game();
+
+        while (!b) {
+            G.input();
+            b = G.checkNumber();            
+        }
+        System.out.println("Good Bye!!, See you Next Time!!");
+
+    G.Close();
+
+    }
+
+}
diff --git a/inheritance.java b/inheritance.java
new file mode 100644
index 0000000..61acc79
--- /dev/null
+++ b/inheritance.java
@@ -0,0 +1,103 @@
+import java.util.Scanner;
+
+class Vehicle
+{
+    String carName;
+    int seater;
+    String carNo;
+     
+
+    Vehicle(){
+        System.out.println("Constructor of parent class 'Vehicle' ");
+        seater = 4;
+        carName = "Mercedes";
+        carNo = "KA-30-A-1987";
+    }
+}
+
+class car extends Vehicle
+{
+
+    String ModelNumber;
+    static String Steering_type = "Normal";
+
+    car(){
+        System.out.println("Constrictor of child class 'Car'");
+        ModelNumber = "2019-Phantom";
+    }
+
+
+}
+
+class SuperCar extends car
+{
+    // static String Steering_type = "Electric";
+    // int seater = 2;
+     Scanner sc = new Scanner(System.in);
+    String Steering_type;
+    int seater = 2;
+    SuperCar(){
+
+        Steering_type = "Electric";
+        System.out.println("Constructor of child class of child class Car");
+
+        System.out.println("Do you want to print car details?");
+        if(sc.nextInt() == 1)
+        {
+            
+            display_properties();
+        }
+        else{
+            System.out.println("Visit Again!!");
+        }
+
+    }
+
+
+    void display_properties()
+    {
+            System.out.println("Car Name is "+carName);
+            System.out.println("Car Number is "+carNo);
+            System.out.println("Car has total seating capacity of "+ seater);
+            System.out.println("Car Model Number is "+ ModelNumber);
+            System.out.println("Car Steering type is "+ Steering_type);
+    }
+} 
+
+
+abstract class Animal{
+
+    public void Hello(){
+        System.out.println("My hello");
+    }
+    public abstract void bark();
+    public abstract void swim();
+}
+
+abstract class Dog extends Animal{
+    public void bark(){
+        System.out.println("This normal dog is barking");
+    }
+
+    
+}
+
+class Labrodor extends Dog{
+    
+
+    public void swim()
+    {
+        System.out.println("This dog swims");
+    }
+}
+
+public class inheritance {
+    public static void main(String[] args) {
+        // SuperCar SC = new SuperCar();
+
+        Labrodor l = new Labrodor();
+        l.bark();
+        l.swim();
+        l.Hello();
+    }
+}
diff --git a/marks.java b/marks.java
new file mode 100644
index 0000000..ee1ea55
--- /dev/null
+++ b/marks.java
@@ -0,0 +1,77 @@
+import java.util.Scanner;
+
+
+class Student{
+    static String clg_name = "NIT";
+    String sname;
+    String usn;
+    double average = 0;
+    static int count = 1;
+
+    double SE1, SE2, SE3, SE4, SE5, SE6, SE7, SE8;
+    static int passout = 2022;
+
+    Scanner sc = new Scanner(System.in);
+    Student(){
+        System.out.println();
+        System.out.println("Enter the Student "+count+" Name");
+        sname = sc.nextLine();
+        System.out.println("Enter the USN");
+        usn = sc.nextLine();
+
+
+        System.out.println("Enter sem 1 percent");
+        SE1 = sc.nextDouble();
+        System.out.println("Enter sem 2 percent");
+        SE2 = sc.nextDouble();
+        System.out.println("Enter sem 3 percent");
+        SE3 = sc.nextDouble();
+        System.out.println("Enter sem 4 percent");
+        SE4 = sc.nextDouble();
+        System.out.println("Enter sem 5 percent");
+        SE5 = sc.nextDouble();
+        System.out.println("Enter sem 6 percent");
+        SE6 = sc.nextDouble();
+        System.out.println("Enter sem 7 percent");
+        SE7 = sc.nextDouble();
+        System.out.println("Enter sem 8 percent");
+        SE8 = sc.nextDouble();
+
+        average = (SE1+ SE2+ SE3+ SE4+ SE5+ SE6+ SE7+ SE8)/8;
+
+        student_details();
+
+
+
+    }
+
+    void student_details(){
+        System.out.println("The average of "+ sname +" with USN "+ usn + " is " + average);
+        count++;
+    }
+    void none(){
+        
+    }
+
+}
+
+public class marks {
+    
+    public static void main(String[] args) {
+        //Scanner sc = new Scanner(System.in);
+        System.out.println("How many students");
+        Scanner i = new Scanner(System.in);
+        int det = i.nextInt();
+        i.close();
+
+        while(det>0){
+            Student s = new Student();
+            s.none();
+            det--;
+        }
+        
+
+       
+        
+    }
+}
diff --git a/multidarray.java b/multidarray.java
new file mode 100644
index 0000000..bebb3cf
--- /dev/null
+++ b/multidarray.java
@@ -0,0 +1,72 @@
+import java.util.Scanner;
+// import java.util.Arrays;
+
+
+class multidarray {
+
+    public static void main(String[] args) {
+
+        Scanner in = new Scanner(System.in);
+
+        System.out.println("Enter the size of array");
+        int n = in.nextInt();
+
+        int [] a = new int [n];
+
+        for(int i = 0; i<a.length; i++)
+        {
+            // System.out.println("Enter "+i+"th Element");
+            a[i] = in.nextInt();
+        }
+        
+        int first;
+        int  count;
+
+        System.out.println("Enter the kth value");
+        count = in.nextInt();
+        in.close();
+
+        first = a[0];
+
+
+
+        for(int i = 0; i<a.length; i++){
+           if(a[i]<first)
+           {
+               first = a[i];
+               
+           }
+           
+        }
+       
+        
+
+
+
+        // for (int ele : a) {
+        //     if(ele > first)
+        //    {
+        //        first = ele;
+        //    }
+        //    if(ele<last)
+        //    {
+        //        last = ele;
+        //    }
+        // }
+
+        // System.out.println("The greatest element in an array is "+first);
+        // System.out.println("The smallest element in an array is "+last);
+
+
+
+        System.out.println("The "+ count+ " largest element in an array is "+first);
+        
+
+       
+
+
+        
+    }
+    
+    
+}
diff --git a/reverseStringUsingLinkedlist.java b/reverseStringUsingLinkedlist.java
new file mode 100644
index 0000000..5a79af5
--- /dev/null
+++ b/reverseStringUsingLinkedlist.java
@@ -0,0 +1,43 @@
+import java.util.LinkedList;
+import java.util.Stack;
+
+public class reverseStringUsingLinkedlist {
+    static LinkedList<Character> ll = new LinkedList<>();
+    static Stack<Character> stack = new Stack<>();
+
+
+
+
+    public static void main(String[] args) {
+        input();
+        for (char string : ll) {
+            System.out.print(string);
+            
+        }
+System.out.println();
+        while(!ll.isEmpty())
+        {
+            stack.push(ll.get(0));
+            ll.remove(0);
+        }
+
+        while(!stack.isEmpty()){
+            ll.add(stack.pop());
+        }
+
+        for (char ele : ll) {
+            System.out.print(ele);
+            
+        }
+    }
+
+    static void input()
+    {
+        ll.add('H');
+        ll.add('e');
+        ll.add('l');
+        ll.add('l');
+        ll.add('o');
+    }
+    
+}
diff --git a/strings.java b/strings.java
new file mode 100644
index 0000000..e153b2f
--- /dev/null
+++ b/strings.java
@@ -0,0 +1,27 @@
+import java.util.Scanner;
+
+public class strings {
+
+    public static void main(String[] args) {
+        Scanner sc = new Scanner(System.in);
+        System.out.println("Enter a String");
+        String s = sc.nextLine();
+        // System.out.println(s);
+        sc.close();
+
+        // System.out.println(s.toLowerCase());
+        // System.out.println(s.toUpperCase());
+        // System.out.println(s.substring(1,4));
+        // System.out.println(s.replace('s', 'r'));
+
+        System.out.println(s.startsWith("sa"));
+
+        System.out.println(s.charAt(3));
+        System.out.println(s.indexOf("esh"));
+        System.out.println(s.equals("sarwesh"));
+
+
+        
+    
+}
+}