Software Engineer Interview Questions in New Delhi, India | Glassdoor.co.in

Software Engineer Interview Questions in New Delhi

6,266

Software engineer interview questions shared by candidates

Top Interview Questions

Sort: RelevancePopular Date

Given n numbers (P1,P2,P3,.....Pn). Divide them in m contiguous partitions such that the sum of the maximum is minimum. For e.g. (5,1,4,2,3) and m =2 then (5,1)(4,2,3)

7 Answers

Was not able to solve this. But some guys used DP.

Need to try all options according to m, Can be referred as spanning tree in depth of M. The leaf of the tree will hold the combination of the indexes that we've decided to divide by and than we can compute the min sum and choose the correct leaf

Assume they are all integers? Get the sum and divide by m. Then try to get sum that can get the exact same value. If can't increase m by 1, try again, until find.

Puzzle question: A Floating ship contains 1 stone , If I drop that stone in sea,,What will happen with water level??? Is it increase or decrease n why??

8 Answers

If your basics are clear you will go through.Have to say process is not much difficult (simpler than other companies process), the programs which you have to write are like : print this output: 122333444455555..

4 Answers

A stream of numbers of length not more than M will be given. You don't know the exact length of the stream but are sure that it wont exceed M. At the end of the stream, you have to tell the N/2 th element of the stream, considering that N elements came in the stream. what would be best space complexity with which you can solve this problem

4 Answers

nothing was difficult. they came to hire u

3 Answers

None

2 Answers

What are logs stored on a UNIX server?

2 Answers

Given two numbers m and n, write a method to return the first number r that is divisible by both (e.g., the least common multiple).

2 Answers

data structure specific questions

2 Answers

Propose an algorithm to remove duplicates in very large datset (which cannot be completely stored in memory for processing). Now, give scenarios in which your algorithm fails.

2 Answers
110 of 6,266 Interview Questions