Given a series of cards, return true if it's the famous hand. Note that i pretend that poker cards goes from 1 to 10 so be careful with the test suite to avoid some traps like (nan, 0.05 , 'string', 55...) are invalid cards right ?
Solution Stats
Problem Comments
-
1 Comment
David Verrelli
on 13 Dec 2017
It can't be that famous: I've never heard of it. Are you referring to a "full house"?
http://suntzupoker.com/full-house.aspx
It would also be good for you to define in the problem statement how to interpret the inputs.
Problem Recent Solvers11
Suggested Problems
-
Project Euler: Problem 7, Nth prime
326 Solvers
-
116 Solvers
-
Unique values without using UNIQUE function
113 Solvers
-
304 Solvers
-
Deleting an element in a matrix
237 Solvers
More from this Author12
Problem Tags
Select a Web Site
Choose a web site to get translated content where available and see local events and offers. Based on your location, we recommend that you select: .
Select web siteYou can also select a web site from the following list:
Americas
- América Latina (Español)
- Canada (English)
- United States (English)
Europe
- Belgium (English)
- Denmark (English)
- Deutschland (Deutsch)
- España (Español)
- Finland (English)
- France (Français)
- Ireland (English)
- Italia (Italiano)
- Luxembourg (English)
- Netherlands (English)
- Norway (English)
- Österreich (Deutsch)
- Portugal (English)
- Sweden (English)
- Switzerland
- United Kingdom (English)