Lead Backend Developer Interview Questions

6,291 lead backend developer interview questions shared by candidates

Technical : It started with General Aptitude questions. Then I was asked to implement algorithms . Here are some questions: 1) Write a function that takes an array as input and returns a reversed version of the input array. 2)Returns an element of the array which has a frequency greater than floor(n/2). If no such element exists, it would return -1. Latter I was asked to normalize tables and write SQL queries .
avatar

Backend Developer

Interviewed at Rebel Foods (Formerly Faasos)

3.8
Aug 29, 2021

Technical : It started with General Aptitude questions. Then I was asked to implement algorithms . Here are some questions: 1) Write a function that takes an array as input and returns a reversed version of the input array. 2)Returns an element of the array which has a frequency greater than floor(n/2). If no such element exists, it would return -1. Latter I was asked to normalize tables and write SQL queries .

Q: Write an SQL query that prints city names along with the number of citizens in it. The scenario was something like that two tables are given, the city names were in one table and no of citizens were in another table and there is a common attribute in both the tables(foreign key concept).
avatar

Backend Developer

Interviewed at Rebel Foods (Formerly Faasos)

3.8
Jan 19, 2022

Q: Write an SQL query that prints city names along with the number of citizens in it. The scenario was something like that two tables are given, the city names were in one table and no of citizens were in another table and there is a common attribute in both the tables(foreign key concept).

in 1st coding round There is an array of elements and you have to print the result after removing continuous same elements. Ex -> [tom , jerry, jerry, tom] Output -> [] Ex -> [tom, jerry, jerry, tom, tom, jerry, tom] [tom jerry Jerry tom ] output-> [] [tom jerry Jerry tom jerry tom] op= [Jerry tom ] 2nd ques Given a 1-indexed array of integers numbers that is already sorted in non-decreasing order, find two numbers such that they add up to a specific target number. Let these two numbers be numbers[index1] and numbers[index2] where 1 <= index1 < index2 <= numbers.length. ex -> Input: numbers = [2,7,11,15], target = 9 Output: [1,2] Ex -> [-1, 0] target = -1 Output -> [1, 2
avatar

Software Engineer II SDE2 Java Backend

Interviewed at HashedIn by Deloitte

4.1
Feb 4, 2022

in 1st coding round There is an array of elements and you have to print the result after removing continuous same elements. Ex -> [tom , jerry, jerry, tom] Output -> [] Ex -> [tom, jerry, jerry, tom, tom, jerry, tom] [tom jerry Jerry tom ] output-> [] [tom jerry Jerry tom jerry tom] op= [Jerry tom ] 2nd ques Given a 1-indexed array of integers numbers that is already sorted in non-decreasing order, find two numbers such that they add up to a specific target number. Let these two numbers be numbers[index1] and numbers[index2] where 1 <= index1 < index2 <= numbers.length. ex -> Input: numbers = [2,7,11,15], target = 9 Output: [1,2] Ex -> [-1, 0] target = -1 Output -> [1, 2

Viewing 3291 - 3300 interview questions

Glassdoor has 6,291 interview questions and reports from Lead backend developer interviews. Prepare for your interview. Get hired. Love your job.