Candidate X and Candidate O receive the same number (n) of votes in an election. Write a function to determine the number of ways the ballots can be counted such that X is never behind O. For example, for n = 3 there are five ways:
XXXOOO
XXOXOO
XXOOXO
XOXXOO
XOXOXO
Solution Stats
Problem Comments
Solution Comments
Show comments
Loading...
Problem Recent Solvers16
Suggested Problems
-
Find all elements less than 0 or greater than 10 and replace them with NaN
15821 Solvers
-
2427 Solvers
-
It dseon't mettar waht oedrr the lrettes in a wrod are.
2173 Solvers
-
Calculate the Levenshtein distance between two strings
1514 Solvers
-
Permute diagonal and antidiagonal
518 Solvers
More from this Author329
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
