Top Problems on Prefix Sum Technique for Interviews Last Updated : 18 May, 2025 Comments Improve Suggest changes Like Article Like Report The Prefix Sum Technique is a powerful and widely used approach in coding interviews, especially for optimizing queries related to subarray sums and cumulative computations. Easy ProblemsEquilibrium IndexSplit an array into two equal Sum subarraysMean of range in arrayOriginal Array from Prefix Sums Medium and Hard ProblemsProduct of Array Except SelfLongest Subarray With Sum KMinimum Removals for Target SumSubarray with 0 sum Longest Span in two Binary ArraysLargest Submatrix With Sum 0 Maximum occurring integer in given rangesCompute before MatrixMaximum occured integerLongest Span with same Sum in two Binary arraysMaximum sum RectangleSubarray Sum Divisible By KCount Subarrays having Sum KSmallest sum contiguous subarray Comment More infoAdvertise with us Next Article Top Problems on Prefix Sum Technique for Interviews U ujjwalroq0 Follow Improve Article Tags : DSA prefix-sum Practice Tags : prefix-sum Similar Reads Intuit Interview | Set 2 (On-Campus) Round One (Written round, 60 minutes): 1. Given an unsorted linked list, remove all duplicates without using temporary buffers. 2. A number starting from 1 can be got by either multiplying 3 or adding 5 to it. Given a number, find the sequence of operations to get it or say it's not possible. e.g: 1 3 min read Intuit Interview | Set 9 (On-Campus) Intuit came for on-campus hiring for 2016 batch and internship offerings for 2017 batch in our college last week. Round One (Online round, 90 minutes): The shortlisting was done on the basis of an online round which consisted of 24 questions (one question was for the profile chosen and 20 were a mix 5 min read MAQ Software Interview Experience | Set 9 (On-Campus for SE-1) First Round : 1) 30 Aptitiude questions. 2) 2-Coding questions 2-a)Â Find Missing And Repeating 2-b)Â Word Break Problem 32 people were selected for second round. Second Round : 1) Given a table of employees containing employee_id, manager_id and employee_name, find the topmost manager and second topm 2 min read VMWare Interview | Set 1 (MTS-2) VMWare interview for MTS-2 position. I Telephonic round 1. Given an array of strings. Find the maximum prefix among all the strings. Ans: First told about tries. Then went for trivial answer saying compare all the zeroth indices then first indices. 2. Similar to kadane's algorithm 3. I forgot this Q 3 min read Payu Interview Experience | Set 6 (On-Campus) Recently Payu came for recruitment in our college. Hiring Process : Online Test + 3 Technical Rounds + HR Round. Position : Software Engineer Online Coding Round (1 hr): There were 5 coding Questions. All of us got different sets. Most of the Questions were based on standard Dynamic Programming like 3 min read Like