title: Check Possible Transform One String Another
signature: func checkPossibleTransformOneStringAnother(s1 string, s2 string) bool {
test_code: package main
  
  import (
      "fmt"
      "reflect"
      "math"
      "sort"
  )
  
  // SOLUTION CODE
  // ===================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE
  // ===================================
  func validateSolution(actual bool, expected bool) bool {
      return reflect.DeepEqual(actual,expected)
  }
  
  func driver(s1 string, s2 string, expected bool) string {
      if validateSolution(PLACEHOLDER_FN_NAME(s1, s2),expected) {
              return "PASSED"
      }
      return "FAILED"
  
  }
  
  func main() {
  
      // Use imports to avoid undefined errors
      var _ = reflect.DeepEqual
      _ = math.Abs
      _ = sort.Sort
      result := ""
      result = driver("daBcd", 
  	"ABC", true)
      fmt.Printf("TEST-0...%s\n", result)
      
      result = driver("417514", 
  	"9", false)
      fmt.Printf("TEST-1...%s\n", result)
      
      result = driver("010000", 
  	"1111011010", false)
      fmt.Printf("TEST-2...%s\n", result)
      
      result = driver("ZcKYguiMrdyn", 
  	"iz", false)
      fmt.Printf("TEST-3...%s\n", result)
      
      result = driver("argaju", 
  	"RAJ", true)
      fmt.Printf("TEST-4...%s\n", result)
      
      result = driver("1110101101", 
  	"110101001", false)
      fmt.Printf("TEST-5...%s\n", result)
      
      result = driver("ySOCoSaygi", 
  	"aRhxkYqh", false)
      fmt.Printf("TEST-6...%s\n", result)
      
      result = driver("204", 
  	"6986871066", false)
      fmt.Printf("TEST-7...%s\n", result)
      
      result = driver("10011100000010", 
  	"0", true)
      fmt.Printf("TEST-8...%s\n", result)
      
      result = driver("nMAioozPmY", 
  	"WZFdDKw", false)
      fmt.Printf("TEST-9...%s\n", result)
      
          
  }
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 ] );
  }