title: Program Find String Start End Geeks
signature: programFindStringStartEndGeeks(str, corner) {
test_code: import 'dart:convert';
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  bool validateSolution(bool actual, bool expected){
      return actual.toString() == expected.toString();
  }
  
  String driver(str, corner, bool expected){
      try
      {
          if (validateSolution(PLACEHOLDER_FN_NAME(str, corner), expected)){
              return "PASSED";
          }
          return "FAILED";
      }catch(exception_object){
          return exception_object.runtimeType.toString();
      }
  }
  
  int main() {
  
      print("TEST-0...${driver(
          "geeksmanishgeeks", "geeks", 
          true)
      }");
  
      print("TEST-1...${driver(
          "shreyadhatwalia", "abc", 
          false)
      }");
  
      print("TEST-2...${driver(
          "10000100", "100", 
          true)
      }");
  
      print("TEST-3...${driver(
          "abaa", "a", 
          true)
      }");
  
      print("TEST-4...${driver(
          "30645530", "30", 
          true)
      }");
  
      print("TEST-5...${driver(
          "0000011011001", "001", 
          false)
      }");
  
      print("TEST-6...${driver(
          "dkqEd", "d", 
          true)
      }");
  
      print("TEST-7...${driver(
          "48694119324654", "654", 
          false)
      }");
  
      print("TEST-8...${driver(
          "1101010010", "11", 
          false)
      }");
  
      print("TEST-9...${driver(
          "Ks", "KsFLmngGGOmHKs", 
          false)
      }");
  
      return 0;
  }
source_py: def program_find_string_start_end_geeks(str, corner):
      n = len(str)
      cl = len(corner)
      if (n < cl):
          return False
      return ((str[:cl] == corner) and (str[(n - cl):] == corner))
source_cpp: bool program_find_string_start_end_geeks(string str, string corner) {
    int n = str . length ( );
    int cl = corner . length ( );
    if ( n < cl ) return false;
    return ( str . substr ( 0, cl ) . compare ( corner ) == 0 && str . substr ( n - cl, cl ) . compare ( corner ) == 0 );
  }