Leetcode questions, ranging in difficulty from easy to hard. It was just the standard interview process expected at most companies for the OA. The interview focused on the fundamentals, mostly arrays and OOP.

Maximum Subarray (LeetCode style problem)

This is a classic problem often found on platforms like LeetCode. The goal is to find the contiguous subarray within a given array of numbers that has the largest sum.

For example, given the array [-2, 1, -3, 4, -1, 2, 1, -5, 4], the contiguous subarray with the largest sum is [4, -1, 2, 1], which has a sum of 6.