Tag: divide-and-conquer

All the problems with the tag "divide-and-conquer".

• Leetcode 53 - Maximum Subarray

  • amazon
  • microsoft
  • adobe
  •  arrays
  •  dynamic-programming
  •  divide-and-conquer

  Given an integer array nums, find the subarray with the largest sum and return its sum.