Problem 15. Find the longest sequence of 1's in a binary sequence.

 s = '011110010000000100010111'

 Input  x = '110100111'
 Output y is 3

Solution Comments

Problem Recent Solvers6873

Suggested Problems

• Project Euler: Problem 8, Find largest product in a large string of numbers

  1335 Solvers

• Create matrix of replicated elements

  402 Solvers

• Compute Fibonacci Number

  542 Solvers

• Create a Matrix of Zeros

  660 Solvers

• Converts numbers into characters

  2183 Solvers

More from this Author96

• Remove the small words from a list of words.

  1566 Solvers

• QWERTY coordinates

  2380 Solvers

• Remove all the words that end with "ain"

  2738 Solvers

• Mandelbrot Numbers

  1784 Solvers

• Make a checkerboard matrix

  16267 Solvers