Engineer II Interview Questions | Glassdoor.co.in

Find jobs for Engineer II

Engineer II Interview Questions

576

Engineer ii interview questions shared by candidates

Top Interview Questions

Sort: RelevancePopular Date

Given an large list of unsorted numbers, find the smallest number. You can access the list only 3 numbers at a time, and keep moving forward 1 number at a time.

6 Answers

Otherwise called the sliding window problem

Use the selection sort and after the pass stop the iterating. Time complexity will be O(N) & only one swap.

Use the selection sort and after the first pass stop the iterating. Time complexity will be O(N) & only one swap.

You are given an array of numbers. You need to print the length of the maximum continuous sequence that you encounter. For example if input is [3,8,10,1,9,6,5,7,2 ], the continuous sequences are{1,2,3} and {5,6,7,8,9,10} the latter is the longest one so the answer becomes 6. O(n) solution was asked for, assuming you have a hash map which supports O(1) insertion and fetching operations

6 Answers

Two sorted arrays. you can start from any one them, and then at common element you may or may not jump to other array. Continue in this manner till you reach the end of an array. Find the path that results the maximum sum.

3 Answers

Remove all characters of a string from another string. The algorithm should be less than O(m*n) where m & n are lengths of strings and the space used should be less than O(m+n).

3 Answers

Find the kth smallest number in an unsorted array with minimum complexity.

2 Answers

Asked about the Asynch method of jquery?

1 Answer

Write algorithm for c compiler.

1 Answer

technical

1 Answer

technical

1 Answer

How can you sort a text file of 4Gb size in a computer system of 2 Gb ram.

1 Answer
110 of 576 Interview Questions