title: Length Longest Sub String Can Make Removed
signature: def lengthLongestSubStringCanMakeRemoved(s: String) = {
test_code: import scala.collection.mutable.HashMap
  import scala.collection.immutable.HashSet
  
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  
  // TESTING CODE 
  // ============================================
  def validateSolution(actual: Int , expected: Int): Boolean = {
      actual.toString == expected.toString
  }
  
  def driver(s: String, expected: Int): String = {
      try {
          if (validateSolution(PLACEHOLDER_FN_NAME(s),expected)) {
              "PASSED"
          } else{
              "FAILED"
          }
      }catch{
          case e: Exception => {e.getClass.getName}
      }
  
  }
  object QuestionEvaluator extends App {
  
      println(s"TEST-0...${driver(
        "U", 
        0    
      )}")   
  
  
      println(s"TEST-1...${driver(
        "544", 
        0    
      )}")   
  
  
      println(s"TEST-2...${driver(
        "111", 
        0    
      )}")   
  
  
      println(s"TEST-3...${driver(
        " cDQaNxpRSOe", 
        0    
      )}")   
  
  
      println(s"TEST-4...${driver(
        "42920062459", 
        0    
      )}")   
  
  
      println(s"TEST-5...${driver(
        "00100101", 
        3    
      )}")   
  
  
      println(s"TEST-6...${driver(
        "FiC", 
        0    
      )}")   
  
  
      println(s"TEST-7...${driver(
        "302746335230", 
        0    
      )}")   
  
  
      println(s"TEST-8...${driver(
        "1", 
        0    
      )}")   
  
  
      println(s"TEST-9...${driver(
        "ZBLHiwGreUR ", 
        0    
      )}")   
  
  }
  
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;
      }