All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > General
String length differences (Posted on 2005-02-15) Difficulty: 3 of 5
Consider the sequence 0100111100
There are 5 zeroes and 5 ones in this sequence.
The longest string of ones is 4.
The longest string of zeroes is 2.
The difference in string lengths is 2.

Create a sequence consisting of 100 zeroes and 100 ones which maximizes the difference in lengths between the longest string of 1's and the longest string of 0's.

Find a formula for the maximum difference in string lengths with n zeroes and n ones.

See The Solution Submitted by Jer    
Rating: 4.0000 (3 votes)

Comments: ( You must be logged in to post comments.)
  Subject Author Date
Solutionsolutionrajeshkumar2005-02-20 07:53:35
SolutionWithout peekingLarry2005-02-17 21:01:07
Solution to part 1Steve Herman2005-02-15 15:27:17
SolutionsolutionCharlie2005-02-15 15:23:00
Please log in:
Remember me:
Sign up! | Forgot password

Search body:
Forums (2)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (6)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Copyright © 2002 - 2020 by Animus Pactum Consulting. All rights reserved. Privacy Information