Another "case study" question involving a clock, and a bunch of pennies/nickels/dimes. Problem required putting a coin on a face of the clock and moving that many steps clockwise (putting a nickel on the 12 would move you to 5, putting a penny on 5 would move you to 6). Multi-step problem where we were ultimately trying to find all of the sequence of 12 coin placements that would be "valid" (never putting a coin on a face that already has a coin on it). Don't overthink it. They took me step by step through it. They want to see if you can program on the spot. Brush up on some useful string manipulating functions in your favorite language.