Feature #1: Hand of Straights
Explore how to form groups of sequential cards called hands of straights in a poker variation. This lesson teaches you to implement an algorithm that sorts and counts cards, checks group formation conditions, and returns true if valid groups exist. You will understand the problem breakdown, the use of data structures, and analyze the solution's time and space complexity.
We'll cover the following...
Description
For the first feature, we will be working on a variation of Poker. In traditional poker, players form sets of five playing cards, called hands. This feature is concerned with a hand of Straights. Traditionally, a hand of straight is formed by five cards of sequential ranks, such as 9♣, 8♠, 7♠, 6♥, and 5♥. However, in our variation of Poker, a number will be determined by rolling a dice 🎲. Then, a hand of straights is only possible if sets of cards can be formed using all of the cards in the hand. Each group will consist of cards of sequential rank.
If the dice rolls a 1, we roll it again. Therefore, you can assume that ...