More Solutions to Problems Added

Author: architg-op

Array/Max value after m range operation.java

@@ -0,0 +1,31 @@
+import java.util.*;
+import java.lang.*;
+import java.io.*;
+class GFG
+ {
+	public static void main (String[] args)
+	 {
+	     Scanner sc = new Scanner(System.in);
+	     int t = sc.nextInt();
+	     while (t-- != 0) {
+	         int n = sc.nextInt();
+	         int arr[] = new int[n];
+	         int m = sc.nextInt();
+	         while (m-- != 0) {
+	             int a = sc.nextInt();
+	             int b = sc.nextInt();
+	             int k = sc.nextInt();
+	             for (int i = a; i <= b; i++) {
+	                 arr[i] += k;
+	             }
+	         }
+	         int max = -111;
+	         for (int i = 0; i < n; i++) {
+	             if (arr[i] > max) {
+	                 max = arr[i];
+	             }
+	         }
+	         System.out.println(max);
+	     }
+	 }
+}

Array/Segregate 0's and 1's(Count Method).java

@@ -0,0 +1,38 @@
+import java.util.*;
+import java.lang.*;
+import java.io.*;
+class GFG
+ {
+	public static void main (String[] args)
+	 {
+	     Scanner sc = new Scanner(System.in);
+	     int t = sc.nextInt();
+	     while (t-- != 0) {
+	         int n = sc.nextInt();
+	         int a[] = new int[n];
+	         for (int i = 0; i < n; i++) {
+	             a[i] = sc.nextInt();
+	         }
+	         int cnt = 0;
+	         // Counting 0's
+	         for (int i = 0; i < n; i++) {
+	             if (a[i] == 0) {
+	                 cnt++;
+	             }
+	         }
+	         // Filling 0's 
+	         for (int i = 0; i < cnt; i++) {
+	             a[i] = 0;
+	         }
+	         // Filling 1's
+	         for (int i = cnt; i < n; i++) {
+	             a[i] = 1;
+	         }
+	         // Printing the Binary Array
+	         for (int i = 0; i < n; i++) {
+	             System.out.print(a[i] + " ");
+	         }
+	         System.out.println();
+	     }
+	 }
+}

Array/Segregate 0's and 1's(Indices Method).java

@@ -0,0 +1,39 @@
+import java.util.*;
+import java.lang.*;
+import java.io.*;
+class GFG
+ {
+	public static void main (String[] args)
+	 {
+	     Scanner sc = new Scanner(System.in);
+	     int t = sc.nextInt();
+	     while (t-- != 0) {
+	         int n = sc.nextInt();
+	         int a[] = new int[n];
+	         for (int i = 0; i < n; i++) {
+	             a[i] = sc.nextInt();
+	         }
+	         int low, mid, high = n - 1;
+	         low = mid = 0;
+	         while (mid <= high) {
+	             if (a[mid] == 0) {
+	                 int temp = a[low];
+	                 a[low] = a[mid];
+	                 a[mid] = temp;
+	                 low++;
+	                 mid++;
+	             }
+	             else {
+	                 int temp = a[mid];
+	                 a[mid] = a[high];
+	                 a[high] = temp;
+	                 high--;
+	             }
+	         }
+	         for (int i = 0; i < n; i++) {
+	             System.out.print(a[i] + " ");
+	         }
+	         System.out.println();
+	     }
+	 }
+}

Array/Sum of Bit Differences(Efficient).java

@@ -0,0 +1,34 @@
+import java.util.*;
+import java.lang.*;
+import java.io.*;
+class GFG
+ {
+    static int bitDifferences(int a[], int n) {
+        int sum = 0;
+        int cnt = 0;
+        for (int i = 0; i < 32; i++) {
+            for (int j = 0; j < n; j++) {
+                if ((a[j] & 1<<i) != 0) {
+                    cnt++;
+                }
+            }
+            sum += cnt * (n - cnt) * 2;
+            cnt = 0;
+        }
+        return sum;
+    }
+    
+	public static void main (String[] args)
+	 {
+	     Scanner sc = new Scanner(System.in);
+	     int t = sc.nextInt();
+	     while (t-- != 0) {
+	         int n = sc.nextInt();
+	         int a[] = new int[n];
+	         for (int i = 0; i < n; i++) {
+	             a[i] = sc.nextInt();
+	         }
+	         System.out.println(bitDifferences(a, n));
+	     }
+	 }
+}