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
-
Test if a Number is a Palindrome without using any String Operations
259 Solvers
-
Sum of diagonal of a square matrix
1646 Solvers
-
Get the elements of diagonal and antidiagonal for any m-by-n matrix
525 Solvers
-
Circular Primes (based on Project Euler, problem 35)
660 Solvers
-
611 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!
