Given a set of people, one of them is a celebrity. You have a 2D array which describes which people know each other, that is [N, M] is true if N knows M. The celebrity will not know anyone (except them self) and everyone will know the celebrity. Find an order N algorithm to find the celebrity.
1. Given a array of integers find the index which partitions the array to two with high numbers and low numbers. For example [5, -1, 3, 8,6] the index 3 will partition the array to [5,-1,3] and [8,6] all the numbers in the second partition are greater than first. The solution has to work in O(n).
If you have a 10W light bulb and a 100W light bulb, and you connect them together, which one will be brighter?
Given two integer arrays. Find the Largest Common sub array. For example, arr1 = {1,2,3,2,3,2} arr2={2,2,3,3,4,5}, the largest common sub array is {2,2,3,3}
They asked me about the Java Object - Oriented, Inheritance and Out-put the single value of the 2 dimension array
How do you handle multiple staffs that works under you with all of them have unique personalities?
Tell me about NOV? Why does NOV interest you?
Q1. Print the 1st and 100th element of Fibonacci series together, 2nd and 99th element and so on. Q2. Print the following pattern 1 2 4 3 6 9 4 8 12 16 5 10 15 20 25. (Condition was using one for loop)
What are your goal for the next 5 years and how do yo plan to achieve them?
An array contains integers with the property that a particular number, called the majority element, appears more than 50% of the time. Give an algo to find this majority number
Viewing 381 - 390 interview questions