Question

I need to create a Java program that, given an array of size N whose entries are numbers between 0 and 10^6, finds the largest repeating subarray. Doesn't matter how many times the array is repeated. For example, an array [0 1 2 1 4 1 2 1 0 5] should return 3 for the subarray [1 2 1]. I need this to be quite time efficient. I was recomended Suffix array but no idea how to implement.

Answer 1

This problem can be done efficiently in dynamic programming way

import java.io.*;

import java.util.*;

class Main{

public static void main(String args[]){

Scanner sc=new Scanner(System.in);

int n=sc.nextInt();

int a[]=new int[n];

for(int i=0;i<n;i++){

a[i]=sc.nextInt();

}

int[][] dp = new int[n+1][n+1];//creating 2D array as matrix

int max=0;

for (int i=1; i<=n; i++)

{

for (int j=1; j<=n; j++)

{

// If characters match and indexes are not same

if (a[i-1] == a[j-1] && i!=j)

dp[i][j] = 1 + dp[i-1][j-1];

max=Math.max(max,dp[i][j]); //update max with maximum length i.e. diagonally continuously increasing sequence

}

}

System.out.println("Length of longest repeated subarray:"+max);

}

}

C Need To Create A Java Program X Repl.it - SteepJoyousBuckets X + - O X → C r epl.it/@satish5657s/SteepJoyousBuckets = @satish56575/Steep JoyousBuc... No description invite 8+ run share import repo +new repl | https://SteepJoyousBuckets.satish5657s.repl.run Files Main.java > jdt.is-java-project Main.java € saved import java.io.*; 2 import java.util."; class Main{ public static void main(String args[]){ Scanner scenew Scanner(System.in); int n=sc.nextInt(); int a[ ]=new int[n]; for(int i=0;i<n;i++) { a[i]=sc.nextInt(); java version "1.8.0_31" Java (TM) SE Runtime Environment (build 1.8.0 31-1 b13) Java HotSpot (TM) 64-Bit Server VM (build 25.31-b 07, mixed mode) ? javac -classpath ./run_dir/junit-4.12.jar:/ru n dir/hamcrest-core-1.3.jar:/run_dir/json-simple -1.1.1.jar -d . Main.java ? java -classpath .:/run dir/junit-4.12.jar:/run dir/hamcrest-core-1.3.jar:/run_dir/json-simple- 1.1.1.jar Main 10 int[][] dp = new int[n+1] [n+1]; int max=8; for (int i=1; i<=n; i++) for (int j-1; j<=n; j++) // If characters match and indexes are not same if (a[i-1] == a[j-1] && i!=j) dp[i][j] = 1 + dp[i-1][j-1]; max=Math.max(max, dp[i][j]); Length of longest repeated subarray:3 System.out.println("Length of longest repeated subarray:"+max); 1 Type here to search о не е в со 24x7 Crisis Mgmt bridge VOIP: 4999999 Contacts 6:37 PM 12/20/2010 A9 I during aid