WAP for longest repeating subsequence

// return the longest repeated string in s

    public static String lrs(String s) {

        // form the N suffixes

        int N  = s.length();

        String[] suffixes = new String[N];

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

            suffixes[i] = s.substring(i, N);

        }

        // sort them

        Arrays.sort(suffixes);

        // find longest repeated substring by comparing adjacent sorted suffixes

        String lrs = "";

        for (int i = 0; i < N - 1; i++) {

            String x = lcp(suffixes[i], suffixes[i+1]);

            if (x.length() > lrs.length())

                lrs = x;

        }

        return lrs;

    }