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
-
Project Euler: Problem 2, Sum of even Fibonacci
2921 Solvers
-
Construct an index vector from two input vectors in vectorized fashion
462 Solvers
-
Determine if input is a Narcissistic number
220 Solvers
-
How many days does the cat take to climb out of the hole?
83 Solvers
-
Check that number is whole number
5509 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!
