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
-
Find the longest sequence of 1's in a binary sequence.
6857 Solvers
-
312 Solvers
-
Set the array elements whose value is 13 to 0
1460 Solvers
-
Remove entire row and column in the matrix containing the input values
576 Solvers
-
Fix the last element of a cell array
1877 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!
