Solve problems that are commonly asked in Java coding interviews related to common data structures.

Ace the Java Coding Interview

Data structures are among the fundamentals of computer science and are often a core decision in developing efficient programs. They are categorized as a vital benchmark of computer science knowledge when it comes to industry interviews. This module contains a detailed review of common data structures in Java. We'll also become well-equipped with different data structures by implementing them.
By the end of this module, we'll have expertise in solving problems in data structures.

Data Structures

# Statement

Given two arrays, `array1` and `array2`, implement a function that takes the two arrays as input and checks whether `array2` is a subset of `array1`.
> A **subset** is a set containing only elements present in another set. 



**Constraints:**

- $1 \leq$ `array1.length` $\leq 10^{3}$
- $0 \leq$ `array2.length` $\leq$ `array1.length` 
- $10^{-3} \leq$ `array1[i]` , `array2[i]` $\leq 10^{3}$
- All the numbers of `array1` and `array2` are unique

# Examples

 Try to solve the An Array as a Subset of Another Array problem.

Challenge: An Array as a Subset of Another Array

Try to solve the An Array as a Subset of Another Array problem.

Challenge 1: Find whether an array is a subset of another array

Statement