The interviewer seemed inexperienced and wanted bookish answers only.

It was not too difficult, but I recommend reading through streams and DS algorithms for round 2.

You should be prepared to give bookish answers here. They want the final solution, not the approach.

Round 1: MCQ-based question: passing score: 60%

Round 2:

• Intro
• Have you worked on Elasticsearch?
• SOLID principles
• What is autoscaling in Kubernetes?
• What does "from alpine image" mean in a Dockerfile?
• Difference between sharding and partitioning
• Your application suddenly received a burst of requests. If your application stores data in an SQL database, will it be able to handle this burst of requests if it were a NoSQL database?
• What implementation of HashMap changed in Java 8?
• What has changed in interfaces in Java 8 and how is it different from an abstract class? Is there any change in inheritance in Java 8?
• What is fault tolerance?
• Given an array: arr[] = {4, 10, 5, 15, 3, 1, 14, 11, 8, 7, 12} and a targetSum = 19. Find duplets and triplets in a single iteration.
• Given an array: arr = [0, 1, 5, 7, 3, 0, 1, 4, 1, 5, 7, 0, 1], convert this such that 0s are at the beginning, 1s are at the end, and other numbers are sorted in the middle. Result = [0, 0, 0, 3, 4, 5, 5, 7, 7, 1, 1, 1, 1]