CareerCup

import java.util.ArrayList;
import java.util.List;

public class FindWordInString {

	/*
	assume that dictionary has only 5 words...
	APPLE,APE,BABY,BALL,CAT
write a program which will accept a string and list all possible words in the dictionary which start with that string.use binary trees for fast retrieval.
	 */
	public static void main(String[] args) {
		
		//Letus take here ArrayList is a Dictionary		
		List<String> fruits=new ArrayList<String>();
		
		//This ArrayList for storing the matching words
		List<String> match_words=new ArrayList<String>();
		
		fruits.add("APPLE");
		fruits.add("APE");
		fruits.add("BYBA");
		fruits.add("BALL");
		fruits.add("CAT");
		
		//Here i will take one string which will search in List		
		String search="BA";
		
		
		
		for(String s:fruits)
		{
			if(s.indexOf(search) >= 0)
				match_words.add(s);
		}
		
		
		
		System.out.println("Matched words are:"+match_words);

	}

}

import java.util.ArrayList;

public class MatchString {

	public static void main(String[] args) {
		String[] dictionary = new String[]{"APPLE","APE","BABY","BALL","CAT"};
		ArrayList<String> matchWords = new ArrayList<String>();
		for(int i=0; i < dictionary.length; i++){
			if(dictionary[i].indexOf(args[0]) > -1) {
				matchWords.add(dictionary[i]);
		}
	}
	System.out.println("Matching Strings are "+matchWords.toString());
		
		
		}

	}

public static void main(string args[ ]){
int i=0;
int ans;
System.out.println("give ans");
}