title: Program Find String Start End Geeks
signature: def programFindStringStartEndGeeks(str: String, corner: String) = {
test_code: import scala.collection.mutable.HashMap
  import scala.collection.immutable.HashSet
  
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  
  // TESTING CODE 
  // ============================================
  def validateSolution(actual: Boolean , expected: Boolean): Boolean = {
      actual.toString == expected.toString
  }
  
  def driver(str: String, corner: String, expected: Boolean): String = {
      try {
          if (validateSolution(PLACEHOLDER_FN_NAME(str, corner),expected)) {
              "PASSED"
          } else{
              "FAILED"
          }
      }catch{
          case e: Exception => {e.getClass.getName}
      }
  
  }
  object QuestionEvaluator extends App {
  
      println(s"TEST-0...${driver(
        "geeksmanishgeeks", "geeks", 
        true    
      )}")   
  
  
      println(s"TEST-1...${driver(
        "shreyadhatwalia", "abc", 
        false    
      )}")   
  
  
      println(s"TEST-2...${driver(
        "10000100", "100", 
        true    
      )}")   
  
  
      println(s"TEST-3...${driver(
        "abaa", "a", 
        true    
      )}")   
  
  
      println(s"TEST-4...${driver(
        "30645530", "30", 
        true    
      )}")   
  
  
      println(s"TEST-5...${driver(
        "0000011011001", "001", 
        false    
      )}")   
  
  
      println(s"TEST-6...${driver(
        "dkqEd", "d", 
        true    
      )}")   
  
  
      println(s"TEST-7...${driver(
        "48694119324654", "654", 
        false    
      )}")   
  
  
      println(s"TEST-8...${driver(
        "1101010010", "11", 
        false    
      )}")   
  
  
      println(s"TEST-9...${driver(
        "Ks", "KsFLmngGGOmHKs", 
        false    
      )}")   
  
  }
  
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 );
  }