Skip to contentSkip to footer

Developer Java Backend Interview Questions

Salaries
Interviews

519 developer java backend interview questions shared by candidates

JAVA basics, Springboot (Easy),Mostly situation based questions and The interviewer was friendly, helping and Asked me to write 4 programs using streams and Lambda,Write mapping using Hibernate config which i miserably failed and Yet the interviewer was approachable and Helped me write the mapping and Rejected which was a great lesson for My Learning!!
avatar

Java Cloud Backend Engineer

Interviewed at UPS

3.4★
Jun 26, 2025

JAVA basics, Springboot (Easy),Mostly situation based questions and The interviewer was friendly, helping and Asked me to write 4 programs using streams and Lambda,Write mapping using Hibernate config which i miserably failed and Yet the interviewer was approachable and Helped me write the mapping and Rejected which was a great lesson for My Learning!!

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 141 - 150 interview questions

Glassdoor has 519 interview questions and reports from Developer java backend interviews. Prepare for your interview. Get hired. Love your job.