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.