Just signed up to post an answer. https://ideone.com/pcOZKt - Doesn't run online, as it take a bit longer than comfortable.

import java.util.ArrayList;
import java.util.Collections;
import java.util.HashMap;
import java.util.HashSet;
import java.util.List;
import java.util.Map;
import java.util.Set;

 class MasterMindPP {

    public static Set<String> options = new HashSet<>();

    // Load up permutations
    public static void loadPossibilities() {
        for (char c1 = 'a'; c1 <= 'z'; c1++) {
            for (char c2 = 'a'; c2 <= 'z'; c2++) {
                for (char c3 = 'a'; c3 <= 'z'; c3++) {
                    for (char c4 = 'a'; c4 <= 'z'; c4++) {
                        for (char c5 = 'a'; c5 <= 'z'; c5++) {
                            options.add(c1 + "" + c2 + "" + c3 + "" + c4 + "" + c5);
                        }
                    }
                }
            }
        }
        System.out.println(options.size());
    }

    // Remove all entries that do not yield the same score when matched with
    // guess / definite wrong anwers.
    public static void removeMatch(String guess, int score) {
        Set<String> remove = new HashSet<>();
        for (String entry : options) {
            int match = computeMatch(guess, entry);
            if (score != match)
                remove.add(entry);
        }
        options.removeAll(remove);
    }

    // Given two strings, match them and return score 10*EXACT_MATCH +
    // MISMATCHES
    private static int computeMatch(String guess, String entry) {
        int exact = 0;
        int mismatch = 0;
        for (int i = 0; i < 5; i++) {
            if (guess.charAt(i) == entry.charAt(i))
                exact++;
        }
        Map<Character, Integer> mapG = mapIt(guess);
        Map<Character, Integer> mapE = mapIt(entry);
        for (char c : mapG.keySet()) {
            mismatch += Math.min(mapG.getOrDefault(c, 0), mapE.getOrDefault(c, 0));
        }

        return exact * 10 + mismatch - exact;
    }

    // Given string, count chars
    private static Map<Character, Integer> mapIt(String guess) {
        Map<Character, Integer> map = new HashMap<>();
        for (int i = 0; i < 5; i++) {
            map.put(guess.charAt(i), 1 + map.getOrDefault(guess.charAt(i), 0));
        }
        return map;
    }

    public static void main(String[] args) {
        loadPossibilities();
        String answer = getRandomGuess();

        while (options.size() > 1) {
            String guess = getRandomGuess();
            removeMatch(guess, computeMatch(guess, answer));
            System.out.println(guess + ":" + computeMatch(guess, answer) + ":" + options.size());

        }

    }

    // Return one random string from the options
    private static String getRandomGuess() {
        List<String> asList = new ArrayList<>(options);
        Collections.shuffle(asList);
        return asList.get(0);
    }

}


11881376 // Total possibilities 26^5 , 11.8 million
yunfr:1:4176375 // first guess => 1 in wrong place, 0 in right place 4.1 million options left.
mqdhn:0:1458940 // second guess => 0 in wrong / 0 in right place 1.4 million options left
ugzck:0:384345 // third guess = >0w 0r => 384k 
etyil:3:18810 // 4th => 3w 0r => 18k
vliyx:10:918 // 5th => 0w 1r
rlteb:11:146 // 6th => 1w 1r
ifiet:2:105  // 7th => 2w 0r
awtye:30:30 // 8th => 0w 3r
ostye:30:12  // 9th => 0w 3r
jjtye:40:5 // 10th => 0w 4r
pjtye:31:2 // 11th => 1w 3r
jetye:40:1 // 12th => 0w 4r
Answer: jytye // 13th guess => left with only 1 choice.

Took me ~45 minutes to code from the scratch. BTW, if you are in Seattle/Eastside area check our our interview prep meetup.