Dataford
Popular roles
Software EngineerData AnalystData ScientistData EngineerBusiness AnalystAI EngineerMachine Learning EngineerProduct Manager
Browse
Browse All RolesEvery role hub, from analyst to MLBrowse All CompaniesCompany-specific interview loopsAll Interview GuidesThe full guide library
Top questions by role
Software EngineerData AnalystData ScientistData EngineerBusiness AnalystAI EngineerMachine Learning EngineerProduct Manager
Top questions by skill
SQLPythonStatisticsMachine LearningA/B TestingSystem DesignGenerative AIProduct SenseMetricsBehavioral
Browse all questions →Try a mock interview
ExperiencesCoaching
New
Practice
Mock InterviewsTimed interview simulations with feedbackSuccess PathYour 6-week structured planModulesCurated lessons by topicWebinarsTalks from ex-Big Tech data leadsPlaygroundA free-form scratch editor
Learn
BlogInterview strategy and career adviceTech Job Market ReportHiring trends across data and AI rolesFor UniversitiesDataford for career centersAbout DatafordWho we are and how we build
Pricing
Get started
Maximum Subarray Sum
00:00
5 left

Maximum Subarray Sum

MediumPython

Problem

Given an array of mixed positive and negative numbers, develop an algorithm to find the contiguous section with the maximum sum (e.g. for (-1, 2, 4, -9, 8) the segment (2, 4)).

Return a three-element list [start, end, sum], where start and end are inclusive indices of the selected segment. If multiple segments have the same maximum sum, return the earliest one. The reported example is reproduced verbatim; under the standard definition, [8] has sum 8, which exceeds [2, 4] with sum 6.

Input: A nonempty list of integers. Output: The selected segment's start index, end index, and sum.

Example: nums = [-2, 3, -1, 5, -6] returns [1, 3, 7] because 3 + (-1) + 5 = 7.

Constraints

  • 1 <= nums.length <= 500
  • -10^9 <= nums[i] <= 10^9
  • The input array is nonempty
  • Return the earliest segment when maximum sums are tied

Function Signature

def max_subarray(nums):
Interviewer

Whenever you're ready, walk me through your approach or go straight to the code. The requirements are in the Question tab.

You need to log in / sign up to run or submit.
Code
Sign up free to run your codeLog inLn 2
Run your code to see test output here.