title: Program Find String Start End Geeks
signature: pub fn program_find_string_start_end_geeks(str: String, corner: String) -> bool {
test_code: use std::collections::HashMap;
  use std::collections::HashSet;
  use std::cmp::*;
  use std::collections::*;
  use std::fmt::*; 
  
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  pub fn validate_solution(actual: bool, expected: bool)->bool{
  return actual==expected
  }
  pub fn driver(str: String, corner: String, expected: bool)->String{
      if validate_solution(PLACEHOLDER_FN_NAME(str, corner), expected) {
        return "PASSED".to_string();
      };
      return "FAILED".to_string();
  
  }
  
  fn main() {
      println!("TEST-0...{}", driver(
        "geeksmanishgeeks".to_string(), "geeks".to_string(), 
        true
      ));
      
      println!("TEST-1...{}", driver(
        "shreyadhatwalia".to_string(), "abc".to_string(), 
        false
      ));
      
      println!("TEST-2...{}", driver(
        "10000100".to_string(), "100".to_string(), 
        true
      ));
      
      println!("TEST-3...{}", driver(
        "abaa".to_string(), "a".to_string(), 
        true
      ));
      
      println!("TEST-4...{}", driver(
        "30645530".to_string(), "30".to_string(), 
        true
      ));
      
      println!("TEST-5...{}", driver(
        "0000011011001".to_string(), "001".to_string(), 
        false
      ));
      
      println!("TEST-6...{}", driver(
        "dkqEd".to_string(), "d".to_string(), 
        true
      ));
      
      println!("TEST-7...{}", driver(
        "48694119324654".to_string(), "654".to_string(), 
        false
      ));
      
      println!("TEST-8...{}", driver(
        "1101010010".to_string(), "11".to_string(), 
        false
      ));
      
      println!("TEST-9...{}", driver(
        "Ks".to_string(), "KsFLmngGGOmHKs".to_string(), 
        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 );
  }