Search⌘ K
AI Features
Home
Courses
Learn Data Structures and Algorithms

Problem: Largest Number At Least Twice of Others

Explore how to determine whether the largest element in an integer array is at least twice as large as all other elements. Learn to implement a simple linear search to find the maximum value and validate the condition efficiently, while understanding the time and space complexity of this algorithm.

We'll cover the following...

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:

  • 2≤2 \leq nums.length ≤50\leq 50

  • ...