title: How to find the longest continuous sub-string in a string?
body: <p>For example, there is a given string which is consisted of <code>1s</code> and <code>0s</code>:</p>
  
  <pre><code>s = "00000000001111111111100001111111110000";
  </code></pre>
  
  <ul>
  <li>What is the efficient way to get the count of longest 1s substring in s? (<code>11</code>)</li>
  <li>What is the efficient way to get the count of longest 0s substring in s? (<code>10</code>)</li>
  </ul>
  
  <p>I appreciate the question would be answered from an algorithmic perspective. </p>