Strongest Card Set Detection

Problem Statement

Strongest Card Set Detection Problem Description You are dealt a hand of N playing cards. Every card has a rank and a suit . There are thirteen ranks, written from lowest to highest as 2, 3, 4, 5, 6, 7, 8, 9, 10, J, Q, K, A . There are four suits: S (Spades), H (Hearts), D (Diamonds), C (Clubs). From highest to lowest the suits are S , H , D , C . A card is written as <rank><suit> with no separator, so the 10 of Spades is 10S and the Queen of Hearts is QH . Six card sets can be formed out of a hand. They are listed below from the weakest to the strongest . Detect every set that can be formed from the given cards and report the strongest one, together with the cards that form it. Complete the function solution(cards) , which receives the hand and returns a Results value holding two fields: set_name - the name of the strongest set that can be formed; selected_cards - the cards that form it. Card Sets The sets, from weakest to strongest: 1. single card - one card. Its suit doe