Status: BTech CSE from Tier I
Position: Product Engineer Intern
Location: Gurgaon, IN
Stipend: 2,00,000/mo
Duration: 8 Weeks
Date: August 2023

This was an on-campus opportunity.

Round 1:
Friendly interviewer. Asked about general things on my resume . Asked me OOPS basic questions . Then gave me 2 DSA qns.
Q1. Find a unique element present once in a given array where every other element is present twice.
Q2. (Idr but a Binary Search Question)
He asked me to code this one on google docs.

After this he seemed satisfied and asked general questions and proceeded to Round 2

Round 2:

He instantly presented 2 DSA questions.
Q1. Imagine you are reading in a stream of integers. Periodically, you wish to be able to look up the rank of a number x (the number of values less than or equal to x). implement the data structures and algorithms to support these operations. That is, implement the method track ( int x), which is called when each number is generated, and the method getRankOfNumber(int x), which returns the number of values less than or equal to x (not including x itself).
EXAMPLE :-
1, 4, 4, 5, 9, 7, 13, 3
getRankOfNumber(1) - 0,
getRankOfNumber(3) - 1,
getRankOfNumber(4) - 3,

Q2. Given that integers are read from a data stream. Find median of elements read so for in efficient way. For simplicity assume there are no duplicates. For example, let us consider the stream 5, 15, 1, 3 …

I couldn't solve 2nd qn at that time (as I was not fully confident in heaps data structure).

I was REJECTED

Round 3 was HR round and afaik all the people who got selected after Round 2 got offer .