M2P Fintech - Interview Round 1 - SDE1 - 2 YoE
Summary
I recently completed my first interview round for the SDE1 position at M2P Fintech, which covered core Java, Spring Boot, database fundamentals, and two specific Data Structures & Algorithms problems.
Full Experience
I had my initial interview round for the SDE1 role at M2P Fintech. The session began with a standard self-introduction, followed by an in-depth discussion where I explained my past projects. The interviewer then moved on to core Java concepts, asking about multithreading and synchronization, as well as features introduced in Java 8. We also covered basic Spring Boot questions, focusing on annotations and the Inversion of Control (IOC) principle. Database concepts such as isolation levels and locking mechanisms were discussed, along with the differences between abstract classes and interfaces. Finally, I was presented with two Data Structures and Algorithms problems to solve.
Interview Questions (2)
The problem involved implementing or explaining Kadane's Algorithm to find the maximum sum of a contiguous subarray within a given array of integers.
Given the root of a binary search tree and two integers, low and high, the task was to trim the tree such that all its elements lie within the [low, high] range. The structure of the tree should be maintained as much as possible, and the result must still be a valid Binary Search Tree (LeetCode 669).