Leetcode 3021. Alice and Bob Playing Flower Game

Two-pile take-1-per-turn game reduces to parity: Alice wins iff x+y is odd (since exactly one flower is removed per move and Alice goes first), so the task is to count pairs (x,y) in [1..n]×[1..m] with opposite parity — computable from the counts of odd/even numbers in each range.

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 3021. Alice and Bob Playing Flower Game

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact