Software Development Engineer 2
Minimum Size Subarray Sum
Given an array of positive integers and a target value, find the minimal length of a contiguous subarray of which the sum is greater than or equal to the target value. If no such subarray exists, return 0. Example: Input: nums = [2,3,1,2,4,3], target = 7. Output: 2.
This question was asked in
Mindtickle Software Development Engineer 2 Interview Experience
The interview process at Mindtickle was quite comprehensive, consisting of four rounds focused on various aspects of software development and project management. The first round had coding questions centered around Data Structures and Algorithms, while subsequent rounds involved system design discussions such as building a Locker Delivery System and a NoBroker-like platform. The overall experience was moderately challenging, highlighting both technical abilities and behavioral insights.