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

Problem: Largest Number At Least Twice of Others

Explore how to solve the problem of finding whether the largest element in an integer array is at least twice as big as all other elements. Learn to apply linear search efficiently to identify the largest number and validate the condition in two passes, with a clear understanding of 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 ...