Problem 46551. Solve a ballot counting problem
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 commentsProblem Recent Solvers13
Suggested Problems
-
Extract leading non-zero digit
2064 Solvers
-
Calculate the Levenshtein distance between two strings
1353 Solvers
-
697 Solvers
-
Getting the absolute index from a matrix
242 Solvers
-
Solve a System of Linear Equations
10868 Solvers
More from this Author249
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!