Daily Coding Problem: Problem #238 [Hard]

Good morning!

Here's a solution to yesterday's problem.

This is your coding interview problem for today.

This problem was asked by MIT.

Blackjack is a two player card game whose rules are as follows:

• The player and then the dealer are each given two cards.
• The player can then "hit", or ask for arbitrarily many additional cards, so long as their total does not exceed 21.
• The dealer must then hit if their total is 16 or lower, otherwise pass.
• Finally, the two compare totals, and the one with the greatest sum not exceeding 21 is the winner.

For this problem, cards values are counted as follows: each card between 2 and 10 counts as their face value, face cards count as 10, and aces count as 1.

Given perfect knowledge of the sequence of cards in the deck, implement a blackjack solver that maximizes the player's score (that is, wins minus losses).

We will be sending the solution tomorrow, along with tomorrow's question. As always, feel free to shoot us an email if there's anything we can help with.

Have a great day!

Master algorithms together on Binary Search. Create a room, invite your friends, and race to finish the problem!