title: Find Whether An Array Is Subset Of Another Array Set 1
signature: func findWhetherAnArrayIsSubsetOfAnotherArraySet1(arr1 []int, arr2 []int, m int, n int) int {
test_code: package main
  
  import (
      "fmt"
      "reflect"
      "math"
      "sort"
  )
  
  // SOLUTION CODE
  // ===================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE
  // ===================================
  func validateSolution(actual int, expected int) bool {
      return reflect.DeepEqual(actual,expected)
  }
  
  func driver(arr1 []int, arr2 []int, m int, n int, expected int) string {
      if validateSolution(PLACEHOLDER_FN_NAME(arr1, arr2, m, n),expected) {
              return "PASSED"
      }
      return "FAILED"
  
  }
  
  func main() {
  
      // Use imports to avoid undefined errors
      var _ = reflect.DeepEqual
      _ = math.Abs
      _ = sort.Sort
      result := ""
      result = driver([]int{7, 10, 10, 10, 13, 17, 23, 24, 25, 28, 30, 33, 37, 49, 49, 50, 57, 60, 60, 63, 63, 64, 65, 65, 72, 81, 84, 85, 85, 94, 96}, 
  	[]int{10, 13, 17, 63}, 
  	29, 
  	4, 1)
      fmt.Printf("TEST-0...%s\n", result)
      
      result = driver([]int{12, 30, -94, -92, -62, -18, -56, 44, -50, -92, 6, 2, 56, -90, 0, 0, 18, 86, -58, 58, -54, 62, -94, 94, 0, 8, 82, -68, -88, -18, 8, -80, -42, 18, 62, -8, 56, -76, -42, 56, 44, -2, -20, 62, -14, 74, -86, -76}, 
  	[]int{12, -18, 44}, 
  	46, 
  	3, 1)
      fmt.Printf("TEST-1...%s\n", result)
      
      result = driver([]int{0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1}, 
  	[]int{0, 0, 0}, 
  	34, 
  	3, 1)
      fmt.Printf("TEST-2...%s\n", result)
      
      result = driver([]int{94, 26, 32, 20, 46, 55, 9, 51, 57, 80, 45, 38, 68, 12, 90, 10, 80, 65, 12, 52, 51, 86, 64, 57, 93, 19, 30, 92, 85, 82, 24, 26, 36, 56}, 
  	[]int{80, 58, 32, 2}, 
  	17, 
  	4, 1)
      fmt.Printf("TEST-3...%s\n", result)
      
      result = driver([]int{-98, -90, -86, -86, -84, -84, -82, -80, -78, -72, -70, -68, -66, -64, -52, -52, -50, -38, -28, -26, -24, -14, -8, 16, 26, 26, 28, 34, 36, 40, 42, 44, 44, 46, 50, 60, 68, 78, 80, 86, 90, 92, 98}, 
  	[]int{-99, -90, -90, -86}, 
  	23, 
  	4, 1)
      fmt.Printf("TEST-4...%s\n", result)
      
      result = driver([]int{1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1}, 
  	[]int{0, 0, 1, 1}, 
  	10, 
  	4, 1)
      fmt.Printf("TEST-5...%s\n", result)
      
      result = driver([]int{6, 8, 11, 13, 14, 26, 26, 41, 48, 70, 82, 83, 84, 88, 96}, 
  	[]int{1, 9, 12, 16}, 
  	10, 
  	4, 1)
      fmt.Printf("TEST-6...%s\n", result)
      
      result = driver([]int{-88, 80, 62, 76, 48, 92, 18, -94, -62, 98, -46, -50, 70, 32, 68, -54, 26, 16, 94, 0, -84, 2, -16, 88, 26, -38, 18, 64, 90, 80, 76, 2, 14, -90, 50, 4, 76, 30}, 
  	[]int{-76, -54, 4, 78}, 
  	27, 
  	4, 1)
      fmt.Printf("TEST-7...%s\n", result)
      
      result = driver([]int{0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1}, 
  	[]int{0, 1, 0, 1}, 
  	10, 
  	4, 1)
      fmt.Printf("TEST-8...%s\n", result)
      
      result = driver([]int{54, 44, 97, 92, 13, 54, 27, 8, 43, 70, 77, 84, 55, 64, 5, 59, 27, 19, 65, 68, 66, 26, 33, 38, 7}, 
  	[]int{93, 5, 9, 13}, 
  	19, 
  	4, 1)
      fmt.Printf("TEST-9...%s\n", result)
      
          
  }
source_py: def find_whether_an_array_is_subset_of_another_array_set_1(arr1, arr2, m, n):
      i = 0
      j = 0
      for i in range(n):
          for j in range(m):
              if (arr2[i] == arr1[j]):
                  break
          if (j == m):
              return 0
      return 1
source_cpp: bool find_whether_an_array_is_subset_of_another_array_set_1(vector<int> arr1, vector<int> arr2, int m, int n) {
    int i = 0;
    int j = 0;
    for ( i = 0;
    i < n;
    i ++ ) {
      for ( j = 0;
      j < m;
      j ++ ) {
        if ( arr2 [ i ] == arr1 [ j ] ) break;
      }
      if ( j == m ) return 0;
    }
    return 1;
  }