coding interview round - 1) search in a row and col wise sorted matrix 2) find if two tree are identical 3) maximum product subarray technical interview round - what is node js , what is event loop ,what are threads, difference between thread and process , what is middleware , etc. all questions related to my web dev project .
Design an algorithm for an elevator
Design rate limiter Microservices design questions Coding questions My project discussions etc
unexpected: The Recruiter asked how many lines of code I have written in my biggest project
How many bits do you have to flip to convert one integer to another.
How to revert a single linked list? I solved, but with a mistake for the first time. After rewriting I had little time, so interview ended. That was my fault, I guess.
There were 3 rounds of interview. In first round, there were 2 questions and i had to explain and code both. First question was based on merging intervals and in other question a binary tree was given and I had to find the size of a subtree in which all the nodes have value 0. in round 2, again there were three questions and the interviewer said "I want to have a good discussion, if your are unable to give correct answer its okay, but correct answer will matter." first question was same as "house robber 3" on leetcode, except it was n-ary tree. In second question, I was given a binary tree and i had to remove and edge from the tree such that resulting two tree's heights difference is maximum. I had to return the difference of heights. In round 3 i was asked a few questions about my life and journey along with some designing questions based on OOPS
Duck in the pond. Start: Duck located in the center of circle (pond). Fox is on the beach and cannot swim. Duck cannot fly (by some reason), but once duck is on the beach, she will fly away. Duck speed - x Fox speed - 4x Can duck escape? Why?
Design / implementation considerations while implementing a service talking to database which is deployed on Premise Vs Azure.
Basic object oriented concepts. One question based on binary search
Viewing 301 - 310 interview questions