InterviewBit Problems   Intersection Of Sorted Arrays : Unsolved

About the Intersection Of Sorted Arrays : Unsolved category (1)
Super easy C++ ans (1)
Got Superman ! Super easy question (1)
I have submitted 2 submissions in JAVA 8... Failed Submission : if(a.get(l1)==a.g (4)
Please help me rectify this code (3)
Submitted same code twice, once got TLE second got accepted (2)
solution_For_Sorted_Arrays (1)
Title of your commentO(n) time complexity efficient code (1)
Larger Number Test Case - == and .equals() (3)
Giving wrong answer while submitting but giving correct output in test with custom input (2)
I am having a problem with the submission for the input A:[10000000] B:[10000000] (7)
Getting Efficiency problem. Why? (1)
Grpc error got reduced point (1)
Getting Memory Limit Exceeded while using vector (2)
If C++ to avoid memory limit exceeded, use unordered_map instead of map (2)
Not working for java (3)
Error during submission but same input passes in testing (1)
Give me partly points, about efficiancy, but i dont see any problem (2)
For those using SWIFT and having TLE (1)
The same solution gives correct answer as expected if run using testing , but wrong answer when submitting (5)
Solved it in O(n+m) time. Still showing partially accedpted answer(TLE) and most (3)
In Swift the proposed solution fails at the efficiency test (1)
Scala - time estimation probably wrong (1)
It is passing in correctness , but showing error in time complexity like this R (2)
Shouldn't it be specified in the problem statement that if an element occurs twic (4)