In 1st round they asked 1 dp question which I solved. Another was a linked-list question which I explained but messed up in the code. still I got chance for 2nd round. Inn 2nd round they asked me 1 calendar based question which can be solved using basic logic.
Can't say, it was LC medium and hard
N/A
Describe the most difficult project you worked on.
A modification of the lowest common ancestor problem (bonus points if you answer using RMQs)
My previous projects
Mostly "prove you know data structures & algorithms and that you've done undergrad coursework". So compilers, some graphics, but no "1000% contrived" toy problems. Know well-known algorithms/data-structures by heart (but they're no bs, so you won't get super edgy / "prove you're a genius" data-structure interview questions). Know how to recognize exponential time problems.
Given a decimal number, find the number of ones in its binary representation. Can you improve the time complexity from O(log(d)) to O(1) and reduce the space to O(1)
recommend friends of friends.
Create all possible subsets subsets of given set.
Viewing 3671 - 3680 interview questions