Given any number, describe an algorithm that increments that number enough to turn the result into a number palindrome (i.e. reads the same left to right and right to left). That is, an input of 1000 would have a palindrome output of 1001. 9019 would have an output of 9119. If the input is already a palindrome, find the next highest palindrome.
how to make a class immutable
HR round : The Hr guy was interested in knowing what I know about the company and Why I want to join them.
1. Android components 2. App lifecycle. 3. Design pattern
Write an algorithm in the language of your choice to find the subset of an array of integers with the largest sum. For example in the array [1, 5, 0, -11, 4] the subset with the largest sum is [1,5]
What kind of role you want? We have a huge team of data scientist? We have best innovators? What is the guarantee of your joining? and others
Technical question from your skillset and how to deploy your presence of mind
algo, hw questions (how to wire), drivers, embedded system, OS, linux system programming, multi-thread programming, L2, L3, QoS, network stack. HW schematic and bus protocol, even write a piece of code of linux kernel. Some behavior questions.
(f2f whiteboarding) Find the most common ancestor of two tree nodes.
Give a range of numbers, return 6 different numbers randomly. In O(n).
Viewing 481 - 490 interview questions