Skip to content

mastermind

bradendubois edited this page Nov 24, 2021 · 9 revisions

Mastering Mastermind

ID: mastermind

Difficulty: 2.5

CPU Time: 1 second

Memory: 2048 MB

Solution

For this, read in the 2 strings, and keep 2 empty strings that will store the character for non-matches. Loop through the two strings together, and increment r if they match; otherwise, push the character from the code to the first string, the character from the code to the second string. After this, while the first string is not empty, search for a character from it in the second string; if found, increment s and delete it from the second string. Delete it from the first string either way. After this, output r and s.

Clone this wiki locally