CodingEasy
Minimum Magician Tricks for Ordering Wise and Strong People
Filed under WheelsEye
The question
Given a string of 'S' (strong) and 'W' (wise) characters representing people in a line, find the minimum number of type transformations a magician must perform so that all wise people ('W') appear before strong people ('S').
No write-up yet. Related questions below have one.
Related WheelsEye questions
Collected from public candidate posts and coding forums. Updated Nov 2026.