PROBLEMS|MOD 13|HARD

Detonate the Maximum Bombs

Algorithms: Searching, Sorting & Big-O

Given a non-empty list of numbers `arr`, return the maximum value.

// EXAMPLES

Example 1:
Input: Input: [3, 5, 2, 8, 1]
Output: 8
Explanation: Result for example 1 of Detonate the Maximum Bombs.
Example 2:
Input: Input: [-10, -3, -20]
Output: -3
Explanation: Result for example 2 of Detonate the Maximum Bombs.

// CONSTRAINTS

  • -10^9 <= n <= 10^9
  • Time Complexity target: O(N) or O(N log N)
  • Space Complexity target: O(1) or O(N)
  • Evaluated against 600 test cases.
solution.py