We use cookies (including Google cookies) to personalize ads and analyze traffic. By continuing to use our site, you accept our Privacy Policy.

SimplyLeet
TagsDisclaimersPrivacyTermsContactAbout Us

Sort the People

Difficulty: Easy

Problem Description

You are given an array of strings names, and an array heights that consists of distinct positive integers. Both arrays are of length n. For each index i, names[i] and heights[i] denote the name and height of the ith person. Return names sorted in descending order by the people's heights.

Key Insights

  • The problem requires sorting names based on their corresponding heights.
  • Heights are guaranteed to be distinct, simplifying the sorting logic.
  • We can pair each name with its height to maintain the relationship during sorting.

Space and Time Complexity

Time Complexity: O(n log n) - due to the sorting operation. Space Complexity: O(n) - for storing the pairs of names and heights.

Solution

To solve the problem, we can use a combination of a list of tuples and a sorting algorithm. First, we create a list of tuples where each tuple contains a name and its corresponding height. Next, we sort this list of tuples in descending order based on heights. Finally, we extract the names from the sorted list and return them.

Code Solutions

def sortPeople(names, heights):
    # Create a list of tuples (height, name)
    paired = list(zip(heights, names))
    # Sort the list of tuples based on heights in descending order
    paired.sort(reverse=True, key=lambda x: x[0])
    # Extract the names from the sorted tuples
    return [name for height, name in paired]
← Back to All Questions