Skip to contentSkip to footer

Backend Developer Interview Questions

Salaries
Interviews

9,192 backend developer interview questions shared by candidates

Given an array of some elements having some weight - pop out two heaviest elements (x &y) from the array - then compare them until array is empty of there is only one element left comparisons: if x!=y ( push x-y into the array) if x==y ( do nothing)
avatar

Backend Developer

Interviewed at TestMu AI

3.8★
Feb 19, 2021

Given an array of some elements having some weight - pop out two heaviest elements (x &y) from the array - then compare them until array is empty of there is only one element left comparisons: if x!=y ( push x-y into the array) if x==y ( do nothing)

Online assessment: 5 problems - 2 leetcode hards, 1 relatively easy SQL query, 1 refactor-a-class problem and 1 design problem Technical interview: How do you create a bean? No, I don't mean that. How do you create the bean? What type of bean is it? That's not what scope means (it actually is). Ok, and how does Spring do that in the back? Tell me the implementation.
avatar

Backend Developer

Interviewed at ING

4.1★
Oct 12, 2022

Online assessment: 5 problems - 2 leetcode hards, 1 relatively easy SQL query, 1 refactor-a-class problem and 1 design problem Technical interview: How do you create a bean? No, I don't mean that. How do you create the bean? What type of bean is it? That's not what scope means (it actually is). Ok, and how does Spring do that in the back? Tell me the implementation.

//DELOITTE INTERVIEW QUESTION 2 //Split substring so no letter occurs more than once in each substring //Return the min num of substrings into which the string has to be split /* 1.Must always be true:no letter occurs more than once in each substring 2.Event forcing a boundary: Appearance of a letter more than once in a substring (a.k.a. duplicate detected) 3.Data Structure that tracks the constraint : Set */
avatar

Junior Backend Developer

Interviewed at Deloitte

3.8★
Mar 16, 2026

//DELOITTE INTERVIEW QUESTION 2 //Split substring so no letter occurs more than once in each substring //Return the min num of substrings into which the string has to be split /* 1.Must always be true:no letter occurs more than once in each substring 2.Event forcing a boundary: Appearance of a letter more than once in a substring (a.k.a. duplicate detected) 3.Data Structure that tracks the constraint : Set */

Viewing 531 - 540 interview questions

Glassdoor has 9,192 interview questions and reports from Backend developer interviews. Prepare for your interview. Get hired. Love your job.