Varsha Jayaraman
BAN USERimport java.util.Scanner;
public class Findduplicates {
public static boolean checkRepeat(int array[][], int length, int index, int j, int k){
int i;
for(i=0;i<index;i++){
int x = array[i][j];
if(x>=k)
return true;
}
return false;
}
public static int finddup(String str, int k){
int count=0,c=0;
int length = str.length()+1;
int array[][] = new int[length][length];
int i,j;
for(i=1;i<=length-(2*k)+1;i++){
for(j=i+k;j<length;j++){
char a = str.charAt(i-1);
char b = str.charAt(j-1);
if(a==b){
array[i][j] = array[i-1][j-1]+1;
if(array[i][j] >= k){
if(checkRepeat(array, length, i, j, k)==false)
count ++;
}
}
}
}
return count;
}
public static void main(String[] args) {
// TODO Auto-generated method stub
System.out.println("\n ENter the String: ");
Scanner in = new Scanner(System.in);
String str = in.nextLine();
System.out.println("Enter pattern length: ");
int k = in.nextInt();
System.out.println("String given: "+str+" pattern length: "+k);
int count;
count = finddup(str, k);
System.out.println("count: "+count);
}
}
package findSubArray;
- Varsha Jayaraman January 13, 2018import java.util.*;
public class findSubArray {
public static int findsubArray(int arr[], int k) {
int n = arr.length, i, j;
int array[][] = new int[n][n];
for(i=0;i<n;i++) {
array[0][i] = arr[i];
}
for(i=0;i<n;i++) {
array[i][0] = arr[0];
}
for(i=1; i<n; i++) {
for(j=i;j<n;j++) {
array[i][j] = arr[j] * array[i-1][j-1];
System.out.println("i: "+i+" j: "+j+" arr[i-1][j-1]: "+array[i-1][j-1]+" arr[i][j]: "+array[i][j]);
if(array[i][j] % k ==0) {
if(i != 0) {
System.out.println("End of subarray is: "+arr[j]);
return i+1;
}
}
}
}
return 0;
}
public static void main(String[] args) {
// TODO Auto-generated method stub
int array[] = {1, 9, 16, 5, 4, 3, 2};
int k = 720;
int answer = findsubArray(array, k);
System.out.println("Minimum lenth of subarray is: "+answer);
}
}