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

Problem: Largest Number At Least Twice of Others

Explore how to determine if the largest element in an integer array is at least twice as large as every other element by applying linear search. Learn to track the maximum and verify dominance with a two-pass scan while understanding the problem's O(n) time complexity and constant space usage.

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 ...