Round 1. Tweaked version of this - https://www.geeksforgeeks.org/problems/bottom-view-of-binary-tree/1 Given a tree, find bottom view - 1 / \ 3 2 / \ / \ 4 5 6 7 Expected output - 4 3 5 6 2 7 (Not 4 3 6 2 7)
Software Development Programmer Interview Questions
33,200 software development programmer interview questions shared by candidates
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
They asked me to open the camera I rejected that unless the interviewers open their cameras too.
Rotate array. He asked to propose any solution first, and then optimise it.
Round 1: DS & Algo 1. Serialize and Deserialse Tree 2. Rat Maze problem (Backtracking) Round 2: Design Design Redis (LRU policy), Design should take care of multi-threading Round 3: Design Design Distribute Global Lock Round 4: Technical Manager - about work - Design a analytics platform that collect logs from multiple systems and provide insight from that
Delete duplicate characters
Count # of A's in a sentence
Convert a number to a roman number
Remove repeated characters from a string
how to determine if 2 linked lists are merged at a common node in O(n) time
Viewing 2011 - 2020 interview questions