Top Three Elements in O(n) | Dataford Interview Questions

Given an array with all distinct elements, find the largest three elements with O(n) time and O(1) extra space.

Implement def largest_three(nums):. Return the three values in descending order. The input contains at least three distinct integers, and the original array must not be sorted or copied.

Constraints

3 <= nums.length <= 1000
-10^9 <= nums[i] <= 10^9
All elements in nums are distinct
Return the values in descending order
Do not sort, copy, or otherwise modify nums

Function Signature

def largest_three(nums):

Your question is Top Three Elements in O(n). Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem

Given an array with all distinct elements, find the largest three elements with O(n) time and O(1) extra space.

Implement def largest_three(nums):. Return the three values in descending order. The input contains at least three distinct integers, and the original array must not be sorted or copied.

Constraints

3 <= nums.length <= 1000
-10^9 <= nums[i] <= 10^9
All elements in nums are distinct
Return the values in descending order
Do not sort, copy, or otherwise modify nums

Function Signature

def largest_three(nums):

Your question is Top Three Elements in O(n). Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.