title: Length Longest Sub String Can Make Removed
signature: func lengthLongestSubStringCanMakeRemoved(s string) int {
test_code: package main
  
  import (
      "fmt"
      "reflect"
      "math"
      "sort"
  )
  
  // SOLUTION CODE
  // ===================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE
  // ===================================
  func validateSolution(actual int, expected int) bool {
      return reflect.DeepEqual(actual,expected)
  }
  
  func driver(s string, expected int) string {
      if validateSolution(PLACEHOLDER_FN_NAME(s),expected) {
              return "PASSED"
      }
      return "FAILED"
  
  }
  
  func main() {
  
      // Use imports to avoid undefined errors
      var _ = reflect.DeepEqual
      _ = math.Abs
      _ = sort.Sort
      result := ""
      result = driver("U", 0)
      fmt.Printf("TEST-0...%s\n", result)
      
      result = driver("544", 0)
      fmt.Printf("TEST-1...%s\n", result)
      
      result = driver("111", 0)
      fmt.Printf("TEST-2...%s\n", result)
      
      result = driver(" cDQaNxpRSOe", 0)
      fmt.Printf("TEST-3...%s\n", result)
      
      result = driver("42920062459", 0)
      fmt.Printf("TEST-4...%s\n", result)
      
      result = driver("00100101", 3)
      fmt.Printf("TEST-5...%s\n", result)
      
      result = driver("FiC", 0)
      fmt.Printf("TEST-6...%s\n", result)
      
      result = driver("302746335230", 0)
      fmt.Printf("TEST-7...%s\n", result)
      
      result = driver("1", 0)
      fmt.Printf("TEST-8...%s\n", result)
      
      result = driver("ZBLHiwGreUR ", 0)
      fmt.Printf("TEST-9...%s\n", result)
      
          
  }
source_py: def length_longest_sub_string_can_make_removed(S):
      arr = []
      arr.append(['@', (- 1)])
      maxlen = 0
      for i in range(len(S)):
          arr.append([S[i], i])
          while ((len(arr) >= 3) and (arr[(len(arr) - 3)][0] == '1') and (arr[(len(arr) - 2)][0] == '0') and (arr[(len(arr) - 1)][0] == '0')):
              arr.pop()
              arr.pop()
              arr.pop()
          tmp = arr[(- 1)]
          maxlen = max(maxlen, (i - tmp[1]))
      return maxlen
source_cpp: int length_longest_sub_string_can_make_removed(string str) {
    vector < pair < char, int > > arr;
    arr . push_back ( {
      '@', - 1 }
      );
      int maxlen = 0;
      for ( int i = 0;
      i < str . length ( );
      ++ i ) {
        arr . push_back ( {
          str [ i ], i }
          );
          while ( arr . size ( ) >= 3 && arr [ arr . size ( ) - 3 ] . first == '1' && arr [ arr . size ( ) - 2 ] . first == '0' && arr [ arr . size ( ) - 1 ] . first == '0' ) {
            arr . pop_back ( );
            arr . pop_back ( );
            arr . pop_back ( );
          }
          int tmp = arr . back ( ) . second;
          maxlen = max ( maxlen, i - tmp );
        }
        return maxlen;
      }