JobsJob TrackerJob alerts

WheelsEye · 8 questions

All 8Coding 8
  • Minimum Magician Tricks for Ordering Wise and Strong PeopleCoding
  • Sum of Values with Different Parity from IndexCoding
  • Lexicographically Smallest String Based on Substring ConditionsCoding
  • Search a 2D MatrixCoding
  • Search in rotated array, max sum non-adjacent, matrix adjacent checkCoding
  • Candies distribution, tree split edge, queue using stacksCoding
  • Implement Map, sort stack, and largest sum subarrayCoding
  • Sliding window maximum, egg dropping puzzle, and jail puzzleCoding
← WheelsEye questions
  1. Interview questions
  2. WheelsEye
  3. Minimum Magician Tricks for Ordering Wise and Strong People
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

  • Sum of Values with Different Parity from Index
  • Lexicographically Smallest String Based on Substring Conditions
  • Search in rotated array, max sum non-adjacent, matrix adjacent check
  • Candies distribution, tree split edge, queue using stacks
  • Implement Map, sort stack, and largest sum subarray
Sum of Values with Different Parity from Index →

Collected from public candidate posts and coding forums. Updated Nov 2026.