Question: You are given an array of integers (both positive and negative). Find the contiguous sequence with the largest sum. Return the sum. Input: 2, -8, 3, -2, 4, 10 Output: 5 (i.e., {3, -2, 4})

From: Cracking the Coding Interview [McDowell]

Subject: Moderate

Load Another Question

Select a Subject

Select a Subject Algorithm Analysis Arrays and Strings Bit Manipulation C and Cpp Code Quality Combinatorial Search Concurrency Data Structures Databases Design Patterns Dynamic Programming General Graph Theory Hard Java Knowledge Based Linked Lists Math and Logic Puzzles Moderate Object-Oriented Design Recursion Recursion and Dynamic Programming Soft Skills Sorting and Searching Stacks and Queues System Design and Scalability Testing Threads and Locks Trees and Graphs