Fly Round

Written Test:

There were three easy questions. Complete a function that takes two integer x and y. you have to return x+y if numbers of the digit in (x+y) are equal to x otherwise, return x. Complete a function that takes a binary string. You have to return the longest size of contiguous substring containing only ‘1’. Complete a function that takes the root of a tree( implemented as linked list and every node containing an integer) and an integer N. You have to return maximum depth of leaf node, such that sum of elements of the node in the path from the root to the leaf node should equal to N....

Fly Round

The fly round was about 45 minutes. The student had to write code for 2 problems on paper. Write a function that takes a sentence. You have to return that sentence having words in reverse order. Input: He is not coder. output: coder not is He. Maximum Product Subarray. According to my thought, Don’t think to solve the question fast ( It will be better If you are fast.), You can take your time, Write a beautiful code ( clearly understandable to anyone, eg if you are using helping array, then choose the name for this wisely like MinSum[], SmallestInt[],CurAns[])....

Interview

1st round:...