Longest Repeated Sub-sequence

Given a string, print the longest repeating sub-sequence such that the two sub-sequence don’t have same string character at same position, i.e., any i’th character in the two sub-sequences shouldn’t have the same index in the original string.

import java.util.ArrayList;
import java.util.HashMap;
import java.util.List;
import java.util.Map;

public class RepeatedSubsequence {

 public static void main(String[] args) {
  String str = "AABEBCDD";
  RepeatedSubsequence rr = new RepeatedSubsequence();
  System.out.println(rr.repeatedSubsequence(str));
 }

 public String repeatedSubsequence(String data) {
  Map<Character, Character> map = new HashMap<Character, Character>();
  List<Character> list = new ArrayList<Character>();

  char[] X = data.toCharArray();
  for (char c : X) {
   if (!map.containsValue(c)) {
    map.put(c, c);
   } else {
    if(!list.contains(c)){
    list.add(c);
    }
   }
  }
  StringBuffer br = new StringBuffer();
  for (char d : list) {
   br.append(d);
  }

  return br.toString();

 }
}

• Tweet
• Share
• Share
• Share
• Share

About Kartik Chandra Mandal

I am Kartik Chandra Mandal from Bangalore, India. Working as software engineer in Java technology. Have good knowledge of OWASP and CSRF in security for applications and it's implementation in Java technology.

Related Post