Cody

Problem 986. Penny Flipping: Reverse subsets of a sequence of coins until you recover the original configuration

Solution 2723619

Submitted on 21 Jul 2020 by Rafael S.T. Vieira
This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.

Test Suite

Test Status Code Input and Output
1   Pass
n = 1; y_correct = 2; assert(isequal(coinFlipAlt(n),y_correct))

2   Pass
n = 3; y_correct = 3; assert(isequal(coinFlipAlt(n),y_correct))

3   Pass
n = 10; y_correct = 295; assert(isequal(coinFlipAlt(n),y_correct))