Game Theory LeetCode Problems: 25 Python Solutions

Game Theory problems by difficulty

Problems with a complete Python solution are listed first, then by ascending problem number.

Easy (2)

Easy problems
No.	Problem	Topics
0292	Nim Game	Brainteaser, Math, Game Theory
1025	Divisor Game	Brainteaser, Math, Dynamic Programming +1

Medium (13)

Medium problems
No.	Problem	Topics
0375	Guess Number Higher or Lower II	Math, Dynamic Programming, Game Theory
0464	Can I Win	Bit Manipulation, Memoization, Math +3
0486	Predict the Winner	Recursion, Array, Math +2
0877	Stone Game	Array, Math, Dynamic Programming +1
1140	Stone Game II	Array, Math, Dynamic Programming +2
1561	Maximum Number of Coins You Can Get	Greedy, Array, Math +2
1686	Stone Game VI	Greedy, Array, Math +3
1690	Stone Game VII	Array, Math, Dynamic Programming +1
1927	Sum Game	Greedy, Math, String +1
2029	Stone Game IX	Greedy, Array, Math +2
2038	Remove Colored Pieces if Both Neighbors are the Same Color	Greedy, Math, String +1
0294	Flip Game IIPremium	Memoization, Math, Dynamic Programming +2
1908	Game of NimPremium	Bit Manipulation, Brainteaser, Array +3

Hard (10)

Hard problems
No.	Problem	Topics
0810	Chalkboard XOR Game	Bit Manipulation, Brainteaser, Array +2
0913	Cat and Mouse	Graph, Topological Sort, Memoization +3
1406	Stone Game III	Array, Math, Dynamic Programming +1
1510	Stone Game IV	Math, Dynamic Programming, Game Theory
1563	Stone Game V	Array, Math, Dynamic Programming +1
1728	Cat and Mouse II	Graph, Topological Sort, Memoization +5
1872	Stone Game VIII	Array, Math, Dynamic Programming +2
0843	Guess the Word	Array, Math, String +2
2005	Subtree Removal Game with Fibonacci TreePremium	Tree, Math, Dynamic Programming +2
2868	The Wording GamePremium	Greedy, Array, Math +3

Eyes only

When the Game Theory problem arrives live.

In the live round, Stealth Interview reads the problem off your screen, returns a working solution with a step-by-step explanation and its time and space complexity, and transcribes what the interviewer says. It's a desktop app for macOS and Windows, invisible to screen sharing.

Get Stealth Interview See pricing

90%Subscription

python

Please analyze this context and help me answer the question or solve the problem.

Technical interview · 45 minsolution.pyShared editor · Python 3Longest substring without repeatsMediumGiven a string s, return the length of the longest contiguous substring in which every character is unique.s = "abcabcbb"
→ 31def length_of_longest_substring(s: str) -> int:2 last_seen = {}3 left = best = 04 for right, ch in enumerate(s):5 if ch in last_seen and last_seen[ch] >= left:

python

def length_of_longest_substring(s: str) -> int:    last_seen = {}                    # char -> index    left = best = 0    for right, ch in enumerate(s):        if ch in last_seen and last_seen[ch] >= left:            left = last_seen[ch] + 1  # jump past it        last_seen[ch] = right        best = max(best, right - left + 1)    return best    last_seen = {}                    # char -> index

Approach

At each index r, the window's left edge is:

left r = max (left r -1, last[s r] + 1)

Time O(n): each character enters and leaves the window once.
Space O(min(n, k)): k is the size of the character set.

Type your message...

GPT-6.1 Terra

90%Subscription

python

Please analyze this context and help me answer the question or solve the problem.

Technical interview · 45 minsolution.pyShared editor · Python 3Longest substring without repeatsMediumGiven a string s, return the length of the longest contiguous substring in which every character is unique.s = "abcabcbb"
→ 31def length_of_longest_substring(s: str) -> int:2 last_seen = {}3 left = best = 04 for right, ch in enumerate(s):5 if ch in last_seen and last_seen[ch] >= left:

python

def length_of_longest_substring(s: str) -> int:    last_seen = {}                    # char -> index    left = best = 0    for right, ch in enumerate(s):        if ch in last_seen and last_seen[ch] >= left:            left = last_seen[ch] + 1  # jump past it        last_seen[ch] = right        best = max(best, right - left + 1)    return best    last_seen = {}                    # char -> index

Approach

At each index r, the window's left edge is:

left r = max (left r -1, last[s r] + 1)

Time O(n): each character enters and leaves the window once.
Space O(min(n, k)): k is the size of the character set.

Type your message...

GPT-6.1 TerraClear chat

QuitEscHide+QCapture+PCrop+OSubmit+EnterPress to get answerLeft/Right+Up/Down+

90%Subscription

python

Please analyze this context and help me answer the question or solve the problem.

Technical interview · 45 minsolution.pyShared editor · Python 3Longest substring without repeatsMediumGiven a string s, return the length of the longest contiguous substring in which every character is unique.s = "abcabcbb"
→ 31def length_of_longest_substring(s: str) -> int:2 last_seen = {}3 left = best = 04 for right, ch in enumerate(s):5 if ch in last_seen and last_seen[ch] >= left:

python

def length_of_longest_substring(s: str) -> int:    last_seen = {}                    # char -> index    left = best = 0    for right, ch in enumerate(s):        if ch in last_seen and last_seen[ch] >= left:            left = last_seen[ch] + 1  # jump past it        last_seen[ch] = right        best = max(best, right - left + 1)    return best    last_seen = {}                    # char -> index

Approach

At each index r, the window's left edge is:

left r = max (left r -1, last[s r] + 1)

Time O(n): each character enters and leaves the window once.
Space O(min(n, k)): k is the size of the character set.

Type your message...

GPT-6.1 TerraClear chat

Primary display

QuitEscHide+QCapture+PCrop+OSubmit+EnterPress to get answerLeft/Right+Up/Down+

Game Theory LeetCode Problems: All 25,
With Python Solutions

Game Theory problems by difficulty

Easy (2)

Medium (13)

Hard (10)

When the Game Theory problem arrives live.

Approach

Approach

Approach

Keep exploring

Game Theory problems by difficulty

Easy (2)2

Medium (13)13

Hard (10)10

When the Game Theory problem arrives live.

Approach

Approach

Approach

Keep exploring

Easy (2)

Medium (13)

Hard (10)