title: Check Possible Transform One String Another
signature: pub fn check_possible_transform_one_string_another(s1: String, s2: 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(s1: String, s2: String, expected: bool)->String{
      if validate_solution(PLACEHOLDER_FN_NAME(s1, s2), expected) {
        return "PASSED".to_string();
      };
      return "FAILED".to_string();
  
  }
  
  fn main() {
      println!("TEST-0...{}", driver(
        "daBcd".to_string(), "ABC".to_string(), 
        true
      ));
      
      println!("TEST-1...{}", driver(
        "417514".to_string(), "9".to_string(), 
        false
      ));
      
      println!("TEST-2...{}", driver(
        "010000".to_string(), "1111011010".to_string(), 
        false
      ));
      
      println!("TEST-3...{}", driver(
        "ZcKYguiMrdyn".to_string(), "iz".to_string(), 
        false
      ));
      
      println!("TEST-4...{}", driver(
        "argaju".to_string(), "RAJ".to_string(), 
        true
      ));
      
      println!("TEST-5...{}", driver(
        "1110101101".to_string(), "110101001".to_string(), 
        false
      ));
      
      println!("TEST-6...{}", driver(
        "ySOCoSaygi".to_string(), "aRhxkYqh".to_string(), 
        false
      ));
      
      println!("TEST-7...{}", driver(
        "204".to_string(), "6986871066".to_string(), 
        false
      ));
      
      println!("TEST-8...{}", driver(
        "10011100000010".to_string(), "0".to_string(), 
        true
      ));
      
      println!("TEST-9...{}", driver(
        "nMAioozPmY".to_string(), "WZFdDKw".to_string(), 
        false
      ));
      
  }
source_py: def check_possible_transform_one_string_another(s1, s2):
      n = len(s1)
      m = len(s2)
      dp = [[False for i in range((m + 1))] for i in range((n + 1))]
      dp[0][0] = True
      for i in range(len(s1)):
          for j in range((len(s2) + 1)):
              if dp[i][j]:
                  if ((j < len(s2)) and (s1[i].upper() == s2[j])):
                      dp[(i + 1)][(j + 1)] = True
                  if (s1[i].isupper() == False):
                      dp[(i + 1)][j] = True
      return dp[n][m]
source_cpp: bool check_possible_transform_one_string_another(string s1, string s2) {
    int n = s1 . length ( );
    int m = s2 . length ( );
    bool dp [ n + 1 ] [ m + 1 ];
    for ( int i = 0;
    i <= n;
    i ++ ) {
      for ( int j = 0;
      j <= m;
      j ++ ) {
        dp [ i ] [ j ] = false;
      }
    }
    dp [ 0 ] [ 0 ] = true;
    for ( int i = 0;
    i < s1 . length ( );
    i ++ ) {
      for ( int j = 0;
      j <= s2 . length ( );
      j ++ ) {
        if ( dp [ i ] [ j ] ) {
          if ( j < s2 . length ( ) && ( toupper ( s1 [ i ] ) == s2 [ j ] ) ) dp [ i + 1 ] [ j + 1 ] = true;
          if ( ! isupper ( s1 [ i ] ) ) dp [ i + 1 ] [ j ] = true;
        }
      }
    }
    return ( dp [ n ] [ m ] );
  }