Question

Given two random integer arrays of size m and n, print their intersection. That is, print all the elements that are present in both the given arrays. Input arrays can contain duplicate elements.If no common element is present then print -1

Input Format

Line 1 : Array 1 Size
Line 2 : Array 1 elements (separated by space)
Line 3 : Array 2 Size
Line 4 : Array 2 elements (separated by space)
Constraints

1 <= m, n <= 10^3
Output Format

Print intersection elements in different lines

Sample Input 0

6
2 6 8 5 4 3
4
2 3 4 7
Sample Output 0

2
4
3
Sample Input 1

4
2 6 2 1
5
1 2 3 4 2
Sample Output 1

2
2
1

Answer 1

Answer: 0

Make me brainlist

Explanation:

13. No, because the probability of the particle existing in a narrow (infinitesimally small) interval at the discontinuity is undefined.

15. No. For an infinite square well, the spacing between energy levels increases with the quantum number n. The smallest energy measured corresponds to the transition from n = 2 to 1, which is three times the ground state energy. The largest energy measured corresponds to a transition from n=∞ to 1, which is infinity. (Note: Even particles with extremely large energies remain bound to an infinite square well—they can never “escape”)