Aspire's Library
A Place for Latest Exam wise Questions, Videos, Previous Year Papers,
Study Stuff for MCA Examinations - NIMCET
Study Stuff for MCA Examinations - NIMCET
Previous Year Question (PYQs)
Three Gold (G) coins, three Silver (S) coins and three Copper (C) coins are arranged in a single row as follow:
G S C G S C G S C
Only 2 adjacent unlike coins can be moved at any one time.
The moved coins must be in contact with at least one other coin in line.
No coin pairs can be reversed.
What is the minimum number of moves required to get all the coins in following order?
C C C S S S G G G
Solution
Given restrictions allow only adjacent unlike-pair shifts without reversing order.
Step-by-step optimal shifting gives minimum 8 moves.
Online Test Series, Information About Examination,
Syllabus, Notification
and More.
View More
Online Test Series, Information About Examination,
Syllabus, Notification
and More.
View More
Ask Your Question or Put Your Review.
