CareerCup

Solution in python

import re

def numVowels(line):
    count = 0
    for c in line:
        if re.search("[aeiou]", c):
            count += 1

    return count

def bestScoreLine(fileName, scoreFunction):
    f = open(fileName)

    bestLine = None
    bestScore = None

    for line in f:
        curScore = scoreFunction(line)

        if bestLine is None:
            bestLine = line
            bestScore = curScore
        elif curScore > bestScore:
            bestLine = line
            bestScore= curScore

    return bestLine    

## MAIN
print bestScoreLine("test.txt", numVowels)
print bestScoreLine("test.txt", len)

test.txt

abcdef
ab
abcdefghik
abcdefghkhllj
aeiouseiou

OUTPUT

aeiouseiou

abcdefghkhllj

Solution in java:

public interface Criteria {

	public Score getScore(String input);
}

public class VowelCriteria implements Criteria {

	@Override
	public Score getScore(String input) {
		int score = 0;
		for(char c : input.toCharArray()) {
			if(isVowel(c)) {
				score++;
			}
		}
		return new Score(score, input);
	}

	private boolean isVowel(char c) {
		return c == 'a' ||
				c == 'e' ||
				c == 'i' ||
				c == 'o' ||
				c == 'u';
	}
}

public class LengthCriteria implements Criteria {

	@Override
	public Score getScore(String input) {
		int score = 0;
		if(input != null) {
			score = input.length();
		}
		return new Score(score, input);
	}
}

public class Score implements Comparable<Score> {

	public int score;
	public String input;

	public Score(int score, String input) {
		super();
		this.score = score;
		this.input = input;
	}

	@Override
	public int compareTo(Score s) {
		return Integer.valueOf(this.score).compareTo(s.score);
	}
}

public class CriteriaCalculator {

	public static String[] words = new String[]{"georgia", "seattle", "arizona", "texas", "atlanta"};
	
	public static Score getMaxScore(String[] words, Criteria c) {
		Score maxScore = null;
		for(String word : words) {
			Score s = c.getScore(word);
			if(maxScore == null || maxScore.compareTo(s) <= 0) {
				maxScore = s;
			}
		}
		return maxScore;
	}

	public static void main(String[] args) {
		Score vowelMax = getMaxScore(words, new VowelCriteria());
		System.out.println(vowelMax.input);
		System.out.println(vowelMax.score);

		Score lengthMax = getMaxScore(words, new LengthCriteria());
		System.out.println(lengthMax.input);
		System.out.println(lengthMax.score);
	}
}

Java code using Pattern and Matcher class.

public static void main(String args[])throws IOException{
		File file = new File("Input.txt");
		
		try {
			FileReader fr = new FileReader(file);
			BufferedReader br = new BufferedReader(fr);
			String str = null,finalStr=null;
			int count=0,finalCnt=-1;
			while((str = br.readLine()) != null){
				count=0;
				Pattern p = Pattern.compile("[aeiouAEIOU]");
				Matcher m = p.matcher(str);
				while(m.find()){
					count++;
				}
				if(count>finalCnt){
					finalCnt = count;
					finalStr = str;
				}
			}	
			
			System.out.println("Max vowel string :: "+finalStr);
			System.out.println("Max vowel count :: "+finalCnt);
			
			
		} catch (FileNotFoundException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}
	}

If we can work on distributed environment we can also use MapReduce algo to improve performance.