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

Problem: Largest Number At Least Twice of Others

Explore how to implement a linear search to find the largest unique element in an integer array and verify if it is at least twice as large as every other element. Learn to return the index of this element or -1 if the condition is not met, while understanding the algorithm's time and space complexity.

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

  • 0≤0 \leq ...