main

Author: nanawarevishal

.vscode/settings.json

@@ -0,0 +1,9 @@
+{
+    "java.project.sourcePaths": [
+        "3.Array/ClassCodes",
+        "3.Array",
+        "2.Loop",
+        "1.DataType",
+        "4.Operators/ClassCodes"
+    ]
+}

1.DataType/Program1.java renamed to 1.DataType/PractiseCodes/Program1.java

@@ -1,3 +1,4 @@
+package PractiseCodes;
 class Datatype{
 
 	public static void main(String[] args){

1.DataType/Program3.java renamed to 1.DataType/PractiseCodes/Program3.java

@@ -1,3 +1,4 @@
+package PractiseCodes;
 class Demo{
 
 	public void main(String[] args){

3.Array/LeetCode/program1.java

@@ -0,0 +1,67 @@
+/* 
+34. Find First and Last Position of Element in Sorted Array
+Medium
+
+Given an array of integers nums sorted in non-decreasing order, find the starting and ending position of a given target value.
+
+If target is not found in the array, return [-1, -1].
+
+You must write an algorithm with O(log n) runtime complexity.
+
+*/
+
+package LeetCode;
+
+
+public class program1 {
+
+    public static void main(String[] args) {
+         
+        int nums[]={5,7,7,8,8,10};
+
+        int target =8;
+
+        int left =0;
+        int right = nums.length-1;
+
+        int output[] = new int[2];
+
+        while(left<=right){
+
+            if(nums[left]==target){
+
+                output[0] = left;
+
+                while(left<right){
+
+                    if(nums[right]==target){
+
+                        output[1] = right;
+                        System.out.println(output[0]+" "+output[1]);
+                        break;
+                    }
+
+                    else{
+
+                        right -=1;
+                    }
+                }
+
+                output[1] = left;
+                System.out.println(output[0]+" "+output[1]);
+                break;
+
+            }
+            else if(nums[left]<target){
+
+                left +=1;
+            }
+            else if(nums[right]>target){
+                right -=1;
+            }
+        }
+        
+        
+    }
+    
+}

3.Array/PracticeCodes/Program18.java

@@ -1,7 +1,7 @@
 
 /*
  Program 33 : #LeetCode - Easy
- 	      Given a non-empty array of integers nums, every element appears twice except for one. Find that single one.
+ 	      Given a non-empty aay of integers nums, every element appears twice except for one. Find that single one.
 
 	      You must implement a solution with a linear runtime complexity and use only constant extra space.
 
@@ -20,42 +20,69 @@
 	      Constraints:
 			1 <= nums.length <= 3 * 104
 			-3 * 104 <= nums[i] <= 3 * 104
-			Each element in the array appears twice except for one element which appears only once.
+			Each element in the aay appears twice except for one element which appears only once.
  */
 
 
 package PracticeCodes;
+import java.io.*;
 
 
 public class Program18 {
+    static int singleNumber(int a[]){
+		
+		for(int i = 0 ; i < a.length; i++){
 
-    public static void main(String[] args) {
-        
-        int a[] = {4,1,2,1,2};
-        int j=0;
-
-        boolean flag = false;
-        for(int i=0;i<a.length-1;i++){
-
-            for(j=i+1;j<a.length;j++){
-
-                if(a[i]!=a[j] && i!=j){
+            for(int j=i+1;j<a.length;j++){
 
-                    flag = true;
-                    System.out.println(a[i]);
-                    break;
-                }
+                if(a[i]>a[j]){
 
-                else{
-                    continue;
+                    int temp = a[i];
+                    a[i] = a[j];
+                    a[j] = temp; 
                 }
-                
-            }
-            if(flag){
-                break;
             }
-            
+			
+		}
+
+        for(int i=0;i<a.length;i++){
+
+            System.out.print(a[i]+" ");
         }
-    }
-    
-}
+
+	
+		if(a[0] != a[1]){
+			return a[0];
+		}
+		for(int i = 1; i < a.length - 1 ; i++){
+
+			if(a[i] != a[i + 1] && a[i] != a[ i - 1]){
+				
+				return a[i];
+			}
+		}
+		if(a[a.length - 2] != a[a.length - 1]){
+			return a[a.length - 1];
+		}
+		return 0;
+	}
+
+	public static void main(String[] args)throws IOException{
+
+		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+
+		System.out.println("Enter the size of aay : ");
+		int size = Integer.parseInt(br.readLine());
+
+		int[] a = new int[size];
+
+		System.out.println("Enter the aay Elements : ");
+		for(int i = 0 ; i < size; i++){
+			
+			a[i] = Integer.parseInt(br.readLine());
+		}
+
+		int single = singleNumber(a);
+		System.out.println("Single Element : " + single);
+	}
+}

4.Operators/ClassCodes/Program1.java

@@ -0,0 +1,17 @@
+
+public class Program1 {
+    public static void main(String[] args) {
+       
+        int x = 10;
+        int y =20;
+
+        System.out.println(x+y);
+        System.out.println(x-y);
+        System.out.println(x*y);
+        System.out.println(x/y);
+        System.out.println(x%y);
+
+        
+        
+    }
+}

4.Operators/ClassCodes/Program2.java

@@ -0,0 +1,14 @@
+public class Program2 {
+    public static void main(String[] args) {
+       
+        int x = 4;
+        int y =5;
+
+        int z =6;
+
+        int ans = x+y*z+(x-y);
+
+        System.out.println(ans);
+        
+    }
+}

4.Operators/ClassCodes/Program3.java

@@ -0,0 +1,13 @@
+public class Program3 {
+    public static void main(String[] args) {
+        
+        int x =10;
+        int y =20;
+
+        System.out.println(x<y);
+        System.out.println(x>y);
+        System.out.println(x!=y);
+        System.out.println(x==y);
+
+    }
+}

4.Operators/ClassCodes/Program4.java

@@ -0,0 +1,16 @@
+public class Program4 {
+    public static void main(String[] args) {
+        
+        int x =10;
+        int y=20;
+
+        if(x<y){
+            System.out.println("Hello");
+        }
+
+        else{
+
+            System.out.println("Hii...!");
+        }
+    }
+}

4.Operators/ClassCodes/Program5.java

@@ -0,0 +1,32 @@
+public class Program5 {
+    public static void main(String[] args) {
+        
+        // int x =10;
+        // int y=20;
+
+        // if(true){
+
+        //     System.out.println("Hello..!");
+        // }
+        
+        // else{
+
+        //     System.out.println("hi..!");
+        // }
+
+
+        // if(x){
+
+        //     System.out.println("Hello..!");  //Error:Incompatible types: Int can't be converted into boolean
+        // }
+        
+        // else{
+
+        //     System.out.println("hi..!");
+        // }
+
+
+
+
+    }
+}

4.Operators/ClassCodes/Program6.java

@@ -0,0 +1,15 @@
+public class Program6 {
+    public static void main(String[] args) {
+        
+        int x =5;
+        int y =7;
+
+
+
+        System.out.println(x++);
+        System.out.println(y++);
+        System.out.println(x--);
+        System.out.println(y--);
+    
+    }
+}