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
-
Extract leading non-zero digit
2257 Solvers
-
Test if a Number is a Palindrome without using any String Operations
259 Solvers
-
Project Euler: Problem 3, Largest prime factor
1823 Solvers
-
Project Euler: Problem 7, Nth prime
1780 Solvers
-
Back to basics 22 - Rotate a matrix
939 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!
