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).
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
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)
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
Find the minimum number required to insert into a word to make it a palindrome.
Judge if a Sudoku solution is right.
Find the balance point in an array. (The index where the sum of the elements to the left it is the same as the sum of the elements to the right of it.)
Given a string, return the first NON-repeating character that occurs in the string. EX: "adzbdcab" returns 'z'.
How would you multiply two strings: "123 * "45", without any casting.
Viewing 301 - 310 interview questions