given a string and an infinity width 2d matrix of length n. You have to write the characters of the string in a zigzag form ie if str[0] is at a[0][0] str[1] goes at a[1][1]. Once you reach the last row the direction of zigzag changes z[i][j] to z[i-1][j+1]. Print the final state of the 2d array
Leetcode question directly from the website
you are given an array [1,5,3,6,2,4,4,7] now print all the pairs whose sum is equal to 8, for example 1,7 4,4 5,3 6,2
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
Self intro Guestimates
How would you implement an undo and redo feature in an application like Photoshop?
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.
How many bits do you have to flip to convert one integer to another.
Basic object oriented concepts. One question based on binary search
Viewing 311 - 320 interview questions