CareerCup

in java

static void findIntersection(String a, String b){
		List<Character> inter = new ArrayList<Character>(); 
		for(int i=0; i< a.length();i++){
			if(b.indexOf(a.charAt(i)) > -1){
				if(!inter.contains(a.charAt(i)))
					inter.add(a.charAt(i));
			}
				
		}
		for(Character c: inter)
			System.out.println(c);
		
	}

WITHOUT for loops ree

use recursion . use c style arrays. make function as compare(i,j); increment both in recursion . whenever same. store i array. when \0 reached. return . That should do it

build a suffix tree (array) of first string, then test the second string ?

Does to "without 2 for loops" mean nested for loop ?

map of one the string in a hashmap, and scan the other one based on the built hashmap. We can get the intersection.