Find an algorithm to find the largest sum subarray in an array of integers. (Better than O(n^2) ).
Ingegneria Interview Questions
374,904 ingegneria interview questions shared by candidates
Questions were asked to check basic knowledge of OOPS concepts, String manipulation, Data Structures. Not very hard questions but were good enough to check concept.
Count bits in a byte.
Given a set of n jobs with [start time, end time, cost] find a subset so that no 2 jobs overlap and the cost is maximum ?
Write some pseudo code to raise a number to a power.
What is Little Endian and Big Endian?
How many golf balls can fit in a school bus?
Assume a matrix of integers they are sorted in boh row and column vice .. how do u find a given number from the matrix in a optimal way?
How to find the max number of a shift buffer queue. For instance, there is an array like 5, 6,8,11,1,2, how to find the max number, which is 11 in this example.
1. return the maximum product of 3 numbers in an array 2. print out the pairs of a number and the nearest greater number to its right in an array. Example: given [1,2,5,2,6], print out (1,2), (2,5), (5,6), (2,6)
Viewing 101 - 110 interview questions