Skip to contentSkip to footer

Software Developer 2 Interview Questions

Salaries
Interviews

2,531 software developer 2 interview questions shared by candidates

Q1. A street contains few light lamps with given intensity, we need to tell minimum bulbs required to light up the street. No. denotes the intensity of light, how many blocks it can light up along with itself. 0 -> lights up only itself 1-> lights itself as well as 1 before it and 1 after it. and so on. -1-> faulty lamp e.g. Input [1,0,2,2,-1,1] output minimum 2 street lamps are required to light this up. Explanation , only street lamps at index 2 and 5 are required to light whole street as their intensity can light other blocks as well. Q2. maximum area under a historgram Input : 2,1,4,5,3,2 (height of bar) output : 8 block area is maximum created by 4,5 values at index 2,3. Area is 2*4 blocks wide.
avatar

SDE-2 Backend

Interviewed at PayU

3.6★
Aug 29, 2021

Q1. A street contains few light lamps with given intensity, we need to tell minimum bulbs required to light up the street. No. denotes the intensity of light, how many blocks it can light up along with itself. 0 -> lights up only itself 1-> lights itself as well as 1 before it and 1 after it. and so on. -1-> faulty lamp e.g. Input [1,0,2,2,-1,1] output minimum 2 street lamps are required to light this up. Explanation , only street lamps at index 2 and 5 are required to light whole street as their intensity can light other blocks as well. Q2. maximum area under a historgram Input : 2,1,4,5,3,2 (height of bar) output : 8 block area is maximum created by 4,5 values at index 2,3. Area is 2*4 blocks wide.

Array-based searching problem - Focus on optimizing from O(n) to O(log n) - Required understanding of modified searching algorithms Array manipulation/sorting problem (Leetcode Medium) - Started with basic approach - Asked to optimize space complexity - Required in-place solution - Simplified to a variant with fewer conditions
avatar

SDE 2

Interviewed at Loop Health

3.8★
Feb 20, 2025

Array-based searching problem - Focus on optimizing from O(n) to O(log n) - Required understanding of modified searching algorithms Array manipulation/sorting problem (Leetcode Medium) - Started with basic approach - Asked to optimize space complexity - Required in-place solution - Simplified to a variant with fewer conditions

Viewing 1721 - 1730 interview questions

Glassdoor has 2,531 interview questions and reports from Software developer 2 interviews. Prepare for your interview. Get hired. Love your job.