Practice30Create account

A word-arrangement machine, in each step, shifts the alphabetically-earliest not-yet-placed word to the leftmost free position (words in between move one place right). For Input: 'zebra monkey apple tiger lion', Step I is: 'apple zebra monkey tiger lion'. What is Step III?

Competition practiceInput-Output
  • Aapple lion monkey zebra tiger
  • Bapple lion zebra monkey tiger
  • Capple monkey lion zebra tiger
  • Dapple lion monkey tiger zebra

Step-by-Step Solution

Step II places lion → 'apple lion zebra monkey tiger'; Step III places monkey in the third position → 'apple lion monkey zebra tiger'.
Answer: A) apple lion monkey zebra tiger

Master this topic in 30 minutes a day.

Don't just memorise the answer — build a daily practice habit.

Practice 5 Similar Questions Free →

All Input-Output practice questions

More Input-Output practice

A number-arrangement machine, in each step, shifts the largest not-yet-placed number to…A number-arrangement machine, given an input line, rearranges it step by step: in each…A number-arrangement machine, given an input line, rearranges it step by step: in each…A number-arranging machine rearranges an input line of numbers so that, in each step,…A number-arranging machine rearranges an input line of numbers so that, in each step,…