Tip 1: Practice DSA thoroughly.
Tip 2: Be familiar with OOP concepts and the basics of LLD.
Tip 1: Mention tech stacks and relevant projects.
Tip 2: Do not lie.



You are given two distinct 0-indexed integer arrays nums1 and nums2, where nums1 is a subset of nums2.
For each 0 <= i < nums1.length, find the index j such that nums1[i] == nums2[j] and determine the next greater element of nums2[j] in nums2. If there is no next greater element, then the answer for this query is -1.
Return an array ans of length nums1.length such that ans[i] is the next greater element as described above.
1) Explained brute force
2) Optimized using stack
3) Explained time and space complexity


Given a rows x cols binary matrix filled with 0's and 1's, find the largest rectangle containing only 1's and return its area.
1) Told a very naive approach to consider every rectangle - O(n^6)
2) Optimized this approach using DP - O(n^4)
3) Told final solution which uses stack - O(n^2)
Low-level design, Java, OOPs, DBMS concepts.
Design low-level design of a food delivery app like Zomato/Swiggy.
Tip 1: If you are not familiar with a concept, tell the interviewer straightforwardly. Do not give a wrong answer.
I was new to Java at that time and did not know much about multithreading in Java. I clearly told them that I had not studied it, and the interviewer switched the question.
Hiring Manager round.
Tip 1: Prepare for such questions beforehand.

Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
What is the purpose of the return keyword?