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

Problem: Largest Number At Least Twice of Others

Explore how to determine if the largest number in an array is at least twice as large as every other element. Learn to apply linear search with two passes to identify the largest element and verify this condition. Understand the solution's logic and its O(n) time and O(1) space complexities through practical examples.

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