I went for face to face interview and faced following questions.
- Check if parenthesis are balanced or Not.
- Given two unsorted arrays A, B. They can contain duplicates. For each element in A count elements less than or equal to it in array B
Input : A = [1, 2, 3, 4, 7, 9] B = [0, 1, 2, 1, 1, 4] Output : [4, 5, 5, 6, 6, 6]
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.
Related Practice Problems
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready. To complete your preparation from learning a language to DS Algo and many more, please refer Complete Interview Preparation Course. In case you are prepared, test your skills using TCS, Wipro, Amazon and Microsoft Test Serieses.