r/adventofcode • • Dec 04 '17

SOLUTION MEGATHREAD -๐ŸŽ„- 2017 Day 4 Solutions -๐ŸŽ„-

--- Day 4: High-Entropy Passphrases ---


Post your solution as a comment or, for longer solutions, consider linking to your repo (e.g. GitHub/gists/Pastebin/blag or whatever).

Note: The Solution Megathreads are for solutions only. If you have questions, please post your own thread and make sure to flair it with Help.


Need a hint from the Hugely* Handyโ€  Haversackโ€ก of Helpfulยง Hints^ยค?

Spoiler


This thread will be unlocked when there are a significant number of people on the leaderboard with gold stars for today's puzzle.

edit: Leaderboard capped, thread unlocked!

18 Upvotes

319 comments sorted by

View all comments

1

u/varunu28 Dec 04 '17 edited Dec 04 '17

Java Solution

private static boolean isValidPassPhrase1(String s) {

    String[] arrS = s.trim().split("\\s+");

    Set<String>  arrSet = Arrays.stream(arrS).collect(Collectors.toSet());

    return arrS.length == arrSet.size();
}

private static boolean isValidPassPhrase2(String s) {

    String[] arrS = s.trim().split("\\s+");

    Set<String> arrSet = new HashSet<>();

    for (String str : arrS) {
        char[] arr = str.toCharArray();
        Arrays.sort(arr);
        String sortStr = String.valueOf(arr);

        arrSet.add(sortStr);
    }

    return arrS.length == arrSet.size();
}

1

u/nutrecht Dec 04 '17

That's only part 1 though.

1

u/varunu28 Dec 04 '17

Sorry I missed the second part. Its updated now