LeetCode 1033: Moving Stones Until Consecutive
A clear explanation of finding the minimum and maximum moves to make three stones consecutive by analyzing gap cases.
Tag
Brainteasers
2 notes
2 notes
A clear explanation of finding the minimum and maximum moves to make three stones consecutive by analyzing gap cases.
A clear explanation of why Alice wins the divisor game if and only if n is even, proven by mathematical induction.