EasyNo. 2418

Sort the People — LeetCode 2418 Python Solution

Pattern
Sorting
Topics
Array, Hash Table, String, Sorting
Reading time
2 min

The problem

You are given an array of strings names, and an array heights that consists of distinct positive integers. Both arrays are of length n.

Example

Input
names = ["Mary","John","Emma"], heights = [180,165,170]
Output
["Mary","Emma","John"]
Explanation
Mary is the tallest, followed by Emma and John.

Python solution

PythonSolution
class Solution:
    def sortPeople(self, names: List[str], heights: List[int]) -> List[str]:
        idx = list(range(len(heights)))
        idx.sort(key=lambda i: -heights[i])
        return [names[i] for i in idx]

Complexity

Time
O(n × log n)
Space · auxiliary
O(n)

Pattern: Sorting

Spend O(n log n) once to buy an ordering that makes the rest of the problem trivial. LeetCode 2418. Sort the People is filed here because LeetCode tags it Sorting, which is the vocabulary this hub collects.

The sorting guide has the Python template for the pattern and the 401 LeetCode problems that use it.

Related problems

Related problems
No.ProblemDifficulty
0049Group AnagramsMedium
0522Longest Uncommon Subsequence IIMedium
0692Top K Frequent WordsMedium
0720Longest Word in DictionaryMedium
0721Accounts MergeMedium
0792Number of Matching SubsequencesMedium

Frequently asked questions

How hard is LeetCode 2418. Sort the People?

LeetCode 2418. Sort the People is rated Easy on LeetCode.

What is the time complexity of LeetCode 2418. Sort the People?

The Python solution on this page runs in O(n × log n).

What is the space complexity of LeetCode 2418. Sort the People?

The Python solution on this page uses O(n) auxiliary space.

What topics does LeetCode 2418. Sort the People cover?

LeetCode 2418. Sort the People is tagged Array, Hash Table, String and Sorting on LeetCode.

Stuck on problems like this in a live interview?

Stealth Interview is a desktop app for macOS and Windows. It reads the problem off your screen and returns a working solution with a step-by-step explanation and its time and space complexity, invisible to screen sharing.

Free to download. Check it runs on your machine, then pick a plan.