#Modification 28 Array Completed

Author: amangit1314

arrays/Array_Problem_25.java

@@ -1,5 +1,93 @@
 package arrays;
 /* Problem Title :-> Given an array of size n and a number k, fin all elements that appear more than " n/k " times.
  */
-public class Array_Problem_25 {
+import java.util.*;
+
+class Array_Problem_25 {
+	
+	static class eleCount{
+		int e, c;
+	}
+	
+	static void moreThanNdk(int[] a, int n, int k) {
+		
+		if(k < 2)	return;
+		
+		eleCount[] temp = new eleCount[k-1];
+		
+		for(int i = 0; i < k-1; i++) {
+			temp[i] = new eleCount();
+		}
+		
+		for(int i = 0; i < k-1; i++) {
+			temp[i].c = 0;
+		}
+		
+		for(int i = 0; i < n; i++) {
+			
+			int j;
+			
+			for(j = 0; j < k - 1; j++) {
+				if(temp[j].e == a[i]) {
+					temp[j].c += 1;
+					break;
+				}
+			}
+			
+			if(j == k - 1) {
+				int l;
+				for(l = 0; l < k - 1; l++) {
+					if(temp[1].c == 0) {
+						temp[l].e = a[i];
+						temp[l].c = 1;
+						break;
+					}
+				}
+			
+				if(l == k - 1) 
+					for(l = 0; l < k-1; l++)
+						temp[l].c -= 1;
+			}
+		}
+			for(int i = 0; i < k -1; i++) {
+			
+			int ac = 0;
+			
+			for(int j = 0; j < n; j++) {
+				if(a[j] == temp[i].e)
+					ac++;
+			}
+			
+			if(ac > n/k)
+				System.out.println("Number:" + temp[i].e + " Count:" + ac + "\n");
+		}
+	}
+	
+	// Driver Code
+	public static void main(String[] args) {
+		
+		System.out.println("First Test\n");
+		int[] a1 = {4,5,6,7,8,4,4};
+		int size = a1.length;
+		int k = 3;
+		moreThanNdk(a1, size, k);
+		
+		System.out.println("\nSecond Test\n");
+		int[] a2 = {4,5,6,7,8,4,4};
+		size = a2.length;
+		k = 3;
+		moreThanNdk(a2, size, k);
+		
+		System.out.println("\nThird Test\n");
+		int[] a3 = {4,5,6,7,8,4,4};
+		size = a3.length;
+		k = 3;
+		moreThanNdk(a3, size, k);
+		
+		System.out.println("\nFourth Test\n");
+		int[] a4 = {4,5,6,7,8,4,4};
+		size = a4.length;
+		k = 3;
+		moreThanNdk(a4, size, k);
+	}
 }

arrays/Array_Problem_26.java

@@ -2,4 +2,41 @@
 /* Problem Title :->  Maximum profit by buying and selling a share atmost twice
 */
 public class Array_Problem_26 {
+	static int maxProfit(int[] price, int n) {
+		
+		int[] profit = new int[n];
+		
+		for(int i =0; i < n; i++) {
+			profit[i] = 0;
+		}
+		
+		int max_price = price[n-1];
+		
+		for(int i = n -2; i >= 0; i--) {
+			if(price[i] > max_price)
+				max_price = price[i];
+			
+			profit[i] = Math.max(profit[i + 1], max_price - price[i]);
+		}
+		
+		int min_price = price[0];
+		
+		for(int i = 1; i < n; i++) {
+			
+			if(price[i] < min_price)
+				min_price = price[i];
+			
+			profit[i]= Math.max(
+					profit[i-1],
+					profit[i] + (price[i] - min_price)
+			);
+		}
+		int result = profit[n - 1];
+		return result;
+	}
+	public static void main(String[] args) {
+		int[] price = {2, 30, 15, 10, 8, 25, 80};
+		int n = price.length;
+		System.out.println("Maximum Profit = " + maxProfit(price, n));
+	}
 }

arrays/Array_Problem_27.java

@@ -4,5 +4,26 @@
  */
 public class Array_Problem_27 {
 
-
+	static boolean isSubSet(int[] a1, int[] a2, int m, int n) {
+		int i = 0, j = 0;
+		for(i = 0; i < n; i++) {
+			for(j = 0; j < m; j++) {
+				if(a2[i] == a1[j])	break;
+				if(j == m)	return false;
+			}
+		}
+		return true;
+	}
+	
+	public static void main(String args[]) {
+		int[] a1 = {11, 1, 13, 21, 3, 7};
+		int[] a2 = {11, 3, 7, 1};
+		int m = a1.length;
+		int n = a2.length;
+		
+		if(isSubSet(a1, a2, m, n))
+			System.out.println("a2[] is " + "subset of a1[] ");
+		else
+			System.out.println("a2 is " + "not a subset of a1[]");
+	}
 }

arrays/Array_Problem_29.java

@@ -2,4 +2,25 @@
 /* Problem Title :-> Find the triplet that sum to a given value
  */
 public class Array_Problem_29 {
+	boolean find3Numbers(int[] A, int a_size, int sum) {
+		int l, r;
+		for(int i = 0; i < a_size - 2; i++) {
+			for(int j = i + 1; j < a_size - 1; j++) {
+				for(int k = j + 1; k < a_size; k++) {
+					if(A[i] + A[j] + A[k] == sum) {
+						System.out.println("Triplet is " + A[i] + ", " + A[j] + ", " + A[k]);
+						return true;
+					}
+				}
+			}
+		}
+		return false;
+	}
+	public static void main(String[] args) {
+		Array_Problem_29 triplet = new Array_Problem_29();
+		int[] A = {1, 4, 45, 6, 10, 8};
+		int sum = 22;
+		int a_size = A.length;
+		triplet.find3Numbers(A, a_size, sum);
+	}
 }