Find whether an array is subset of another array | GeeksforGeeks

preview_player
Показать описание

This video is contributed by Anik Shah.

Please Like, Comment and Share the Video among your friends.

Install our Android App:

If you wish, translate into local language and help us reach millions of other geeks:

Follow us on Facebook:

And Twitter:

Also, Subscribe if you haven't already! :)
  1. GeeksforGeeks
  2. GeeksforGeeks
  3. Programming
  4. Algorithms
  5. Data Structures
  6. Coding
Рекомендации по теме
Find whether an 0:05:53

Find whether an array is subset of another array | GeeksforGeeks

Find Whether One 0:06:53

Find Whether One Array is Subset of Another Array

Leetcode 1752. Check 0:06:24

Leetcode 1752. Check if Array Is Sorted and Rotated [Java]

Check If An 0:09:39

Check If An Array Is Sorted | C Programming Example

Data Structures And 0:06:54

Data Structures And Algorithms - Check if Array is Sorted

Check if Array 0:25:56

Check if Array is Sorted & Rotated | DSA | Programming Tutorials | GeeksforGeeks

Check If A 0:03:26

Check If A Value Is In An Array | C Programming Example

Java Program to 0:10:42

Java Program to check whether given array is sorted or not?

1346. Check If 0:00:35

1346. Check If N and Its Double Exist | Daily LeetCode Solution | Java #leetcodechallenge

Check If Array 0:14:00

Check If Array Is Sorted C Program

Find maximum element 0:05:42

Find maximum element in an array (Largest element)

Check if Array 0:13:02

Check if Array is Unique in C

Find whether an 0:09:32

Find whether an array is a subset of another array | Q27 | DSA Sheet | Leetcode | GFG | Qualcomm

Check array is 0:06:00

Check array is sorted or not Coding problems for placements

Find Second Largest 0:43:26

Find Second Largest Element in Array | Remove duplicates from Sorted Array | Arrays Intro Video

Leetcode 1497. Check 0:13:46

Leetcode 1497. Check If Array Pairs Are Divisible by k

Array subset of 0:06:38

Array subset of another array? | Hashmap questions | STL | Basics of C++ | Nishant Chahar | Ep-33

Check If Array 0:12:53

Check If Array Pairs Are Divisible by k | Leetcode 1497

LeetCode 1752 : 0:13:25

LeetCode 1752 : Check if Array Is Sorted and Rotated || EASY || JAVA || Detailed Solution

Leetcode 1250: Check 0:08:35

Leetcode 1250: Check If It Is a Good Array

Find leaders in 0:04:53

Find leaders in an array

Microsoft Coding Interview 0:00:58

Microsoft Coding Interview Question - Find Minimum in Rotated Sorted Array - Leetcode 153

Find if Array 0:30:07

Find if Array Can Be Sorted | Detailed Approaches | Dry Runs | Leetcode 3011 | codestorywithMIK

Find minimum (Smallest) 0:05:38

Find minimum (Smallest) element in Array

Комментарии
Автор

What if n>m? Will it work efficiently in that condition too?

deepanjandatta
Автор

Brilliant, simple, and beautiful solution! Thank you! ✨✨✨✨✨

lolaueda
Автор

I would like to mention that Your algorithm is not linear as we are using contains () method which itslef has a loop inside .
Secondly, we are using add() method of hashser which implicitly calls contains() method to check duplicate elements.

Hence its complexity is not linear

randhish
Автор

Because of you I got to know hashing easily tq bro🙏✨✨✨

bisatisrilatha
Автор

What if the given arrays are a[]={1, 2, 3, 4, 5} b[1, 2, 3, 3]

shahbazalam
Автор

incase of duplicates elements in arrat, it will fail. right?

rishabhsahu
Автор

Is anyone able to submit Java solution for this problem...method is declared as public String isSubset( long a1[], long a2[], long n, long m). Facing issue with 'long'

abhisheksoti
Автор

Suppose arr1 = {11, 1, 13, 21, 3, 7}
arr2 = {11, 3, 7, 1, 1}
Using the method that you told would fail for this case because all the elements of arr2 have atleast 1 occurrence in arr1 but as arr2 contains two 1s and arr1 contains only one 1s, arr2 isn't a subset of arr1. But your function will return true for that.

divyanshr