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 Solvers14
Suggested Problems
-
Which values occur exactly three times?
5248 Solvers
-
Maximum running product for a string of numbers
2257 Solvers
-
1249 Solvers
-
Given an unsigned integer x, find the largest y by rearranging the bits in x
2055 Solvers
-
Least common multiple of many numbers
256 Solvers
More from this Author326
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
