Search
⌘K

Leetcode 2868. The Wording Game

Given a list of words where players alternate picking unused words that start with the last letter of the previous word, determine whether the first player can force a win, loss, or draw under optimal play. The core challenge is to model the words as a directed graph (edges by matching letters) and apply game-theory graph analysis (retrograde DP, SCC/condensation and Grundy-like reasoning) to compute winning/losing/drawing states.


Question Timeline

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

Comments

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