Search⌘ K
AI Features

Problem: Largest Number At Least Twice of Others

Explore how to apply linear search to identify the largest element in an array and verify if it is at least twice as large as every other number. Understand the step-by-step process and analyze the time and space complexities of this approach.

Statement

Given an integer array nums, in which the largest element is guaranteed to be unique, determine whether this largest element is at least twice as large as every other element in the array.

If the condition holds, return the index of the largest element. Otherwise, return 1-1.

Constraints:

  • 22 \leq nums.length 50\leq 50

  • 00 \leq ...