OA lasts for a total of sixty minutes, with two questions.
- The first question is similar to How Many Sentences on leetcode.com.
Original question image: [link removed]
- Second question 53. Maximum Subarray Sum: Given an integer array nums, please find a continuous subarray with the largest sum (the subarray must contain at least one element) and return its maximum sum.
A subarray is a continuous part of an array.
Example 1:
Input: nums = [-2,1,-3,4,-1,2,1,-5,4]
Output: 6
Explanation: The sum of the continuous subarray [4,-1,2,1] is the largest, which is 6.