Find Common Elements in Three Sorted Arrays - Java Code

very well explained.

Using HashSet is very smart here

What if array is not sorted.. Then which approach will you use

This program will not pass all cases it consists of so many bugs

Nice video but one minor correction: You should state explicitly that your first O(m+n) solution works ONLY for sorted arrays. The failing test case is [6,1,2,3] and [1,2,3]. Your second O(m+n) solution works for both types of arrays obviously.

how do we ignore repeated number for eg arr1=[1,2,3,4,5] arr2=[1,1,2,2,3] output= 1,1,2,2 but desired output =[1,2]

What if the 2nd array contains 2 values which are same. It would be printed 2 times which is wrong

same as two array of tunion example can you explain sir

You're finding common elements, this is not intersection.

Can u pls tell me the platform u r using sir or the software

Code link is present in the description box.

The way you have explained two approaches to solve this problem is awesome.