title: Length Longest Sub String Can Make Removed
signature: function lengthLongestSubStringCanMakeRemoved(s: string): number {
test_code: 
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  function convertToString(value: any): string{
      return JSON.stringify(value, function (key, val) {
          if (val instanceof Set) {
              return Array.from(val);
          } return val;});
  }
  
  function validateSolution(actual: number, expected: number): boolean {
      return convertToString(actual) === convertToString(expected);
  }
  
  function driver(s: string, expected:number): string {
      try{
          if (validateSolution(PLACEHOLDER_FN_NAME(s),expected)){
              return "PASSED";
          }
          return "FAILED";
      } catch (error) {
        return error.name;
      }
      
  }
      
  function main(){
    let result = '';
    result = driver("U", 0);
    console.log(`TEST-0...${result}`);
  
    result = driver("544", 0);
    console.log(`TEST-1...${result}`);
  
    result = driver("111", 0);
    console.log(`TEST-2...${result}`);
  
    result = driver(" cDQaNxpRSOe", 0);
    console.log(`TEST-3...${result}`);
  
    result = driver("42920062459", 0);
    console.log(`TEST-4...${result}`);
  
    result = driver("00100101", 3);
    console.log(`TEST-5...${result}`);
  
    result = driver("FiC", 0);
    console.log(`TEST-6...${result}`);
  
    result = driver("302746335230", 0);
    console.log(`TEST-7...${result}`);
  
    result = driver("1", 0);
    console.log(`TEST-8...${result}`);
  
    result = driver("ZBLHiwGreUR ", 0);
    console.log(`TEST-9...${result}`);
  
  };
  
  main();
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;
      }