Date: July 2024
Duration: 1.5 hours

The interview began with a basic introduction. then delved into core Java features, focusing primarily on streams, functional interfaces, and lambda expressions. I was asked to solve 4-5 problems using streams exclusively. Following this, the interviewer grilled me on Java/JVM internals, garbage collection (GC), and the concept of immutable classes.

Next, the interview moved to DSA). I was required to write and execute working code for two problems -

Problem 1: Determine if a given array can be partitioned into two subsets with equal sums.
LeetCode Link: https://leetcode.com/problems/partition-equal-subset-sum/description/
Approach: I utilized dynamic programming to solve this problem efficiently.

Problem 2: Perform a search in a rotated sorted array.
Approach: I implemented a modified binary search to handle the rotation in the array.

Hope, it helps. Cheers !!!