ME

Maximum Friendship Quotient

Given a list of integers representing the heights of individuals in a lineup, find the maximum friendship quotient. The friendship quotient is calculated as the product of the position difference and the minimum height of two individuals.

Example 1:

Input:nums = [5, 3, 8, 6], N = 4

Output:15

Example 2:

Input:nums = [1, 2, 3, 4], N = 4

Output:2

Example 3:

Input:nums = [10, 20, 30, 40], N = 4

Output:20

Constraints:

1 <= N <= 10^5
1 <= height < 10^5

solution.cpp

Loading...

Run code to see test results

00:00 / 69:42

Maximum Friendship Quotient

MediumMed•485 views

Given a list of integers representing the heights of individuals in a lineup, find the maximum friendship quotient. The friendship quotient is calculated as the product of the position difference and the minimum height of two individuals.

Example 1:

Input:nums = [5, 3, 8, 6], N = 4

Output:15

Example 2:

Input:nums = [1, 2, 3, 4], N = 4

Output:2

Example 3:

Input:nums = [10, 20, 30, 40], N = 4

Output:20

Constraints:

1 <= N <= 10^5
1 <= height < 10^5

MediumMed•485 views

Time Complexity

Space Complexity

A

Asked at

Amazon ML Summer School

AD

Author: Amit Dayal

Software Engineer

Expert in Data Structures & Algorithms. Building tools to help developers crack FAANG interviews.

Reviewed by Senior Engineers

GitHub LinkedIn

Up Next

Last updated Jul 2026