Software Developer Java Interview Questions

4,317 software developer java interview questions shared by candidates

R1-Screening: Detailed discussion on previous project, architecture, what design patterns used and follow-ups on them. R2-Technical: Query to find customers who placed more than 5 orders, From a list of integers, filter out even numbers, square them, and collect into a new list using Java Streams, How Hashmap works internally, Two Sum Optimal Solution. R3-Technical: How Polymorphism is achieved in Java, why overriding is called runtime polymorphism, what is composition, Explain SOLID design principles, Abstract Factory vs Factory , Singleton design pattern, Showed a code blocked and asked what changes I will make to make them adhere to SOLID principles, Comparator vs Comparable, Eager vs Lazy Loading, How to achieve Dependency Injection in Spring Boot, how to pass different profiles(dev,stage,prod) for your app (JVM arguments), Checked vs Unchecked exceptions, Try, finally block, Controller Advice, Lets say Method A calls Method B, How would you propagate any exception thrown from Method B to A, Hibernate questions, how would you resolve circular dependency, Optimistic vs Pessimisstic Lock, Different Methods to create Threads in Java, Lambda function to filter a List with id > 3 and sort them in decending order based on their names, Hashset vs Hashmap , Does hashset maintain insertion order, if no which Collection of Set can be used to maintain insertion order, can we achieve Multiple Inheritance in Java.
avatar

Software Engineer Java

Interviewed at OakNorth

3.9
Jan 7, 2026

R1-Screening: Detailed discussion on previous project, architecture, what design patterns used and follow-ups on them. R2-Technical: Query to find customers who placed more than 5 orders, From a list of integers, filter out even numbers, square them, and collect into a new list using Java Streams, How Hashmap works internally, Two Sum Optimal Solution. R3-Technical: How Polymorphism is achieved in Java, why overriding is called runtime polymorphism, what is composition, Explain SOLID design principles, Abstract Factory vs Factory , Singleton design pattern, Showed a code blocked and asked what changes I will make to make them adhere to SOLID principles, Comparator vs Comparable, Eager vs Lazy Loading, How to achieve Dependency Injection in Spring Boot, how to pass different profiles(dev,stage,prod) for your app (JVM arguments), Checked vs Unchecked exceptions, Try, finally block, Controller Advice, Lets say Method A calls Method B, How would you propagate any exception thrown from Method B to A, Hibernate questions, how would you resolve circular dependency, Optimistic vs Pessimisstic Lock, Different Methods to create Threads in Java, Lambda function to filter a List with id > 3 and sort them in decending order based on their names, Hashset vs Hashmap , Does hashset maintain insertion order, if no which Collection of Set can be used to maintain insertion order, can we achieve Multiple Inheritance in Java.

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 1311 - 1320 interview questions

Glassdoor has 4,317 interview questions and reports from Software developer java interviews. Prepare for your interview. Get hired. Love your job.