LeetCode: Sort the People

PublishedNovember 28, 2025

•1 min read

Problem:

https://leetcode.com/problems/sort-the-people/

Code:

class Solution:
    def sortPeople(self, names: List[str], heights: List[int]) -> List[str]:
        return [name for height, name in sorted(zip(heights, names), reverse=True)]

Key Points:

We need to sort people in descending order of their heights.
Names and heights are given in separate lists but correspond by index.
Zip the data together: zip(heights, names) → creates pairs like (height, name)
Sort these pairs in reverse (descending) order: sorted(zip(heights, names), reverse=True)
After sorting, extract only the names in the new order using a list comprehension: [name for height, name in ... ]
Why this works:
- Python sorts tuples by first element (height), which is exactly what we want.
- reverse=True ensures tallest → shortest.
Time Complexity: O(n log n) for sorting.
Space Complexity: O(n) for the sorted list.

#leetcode #strings

Comments

Join the discussion

No comments yet. Be the first to comment.

More from this blog

LeetCode: Contains Duplicate II

Problem: https://leetcode.com/problems/contains-duplicate-ii/ Code: class Solution: def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool: # window = k seen_in_window = set() for i in range(len(nums)): ...

Jan 9, 20262 min read

LeetCode: Rearrange Array Elements by Sign

Problem: https://leetcode.com/problems/rearrange-array-elements-by-sign/ Code: class Solution: def rearrangeArray(self, nums: List[int]) -> List[int]: non_neg_nums = [] neg_nums = [] result = [] # Segregated non-n...

Dec 26, 20252 min read

GeeksForGeeks: Array Leaders

Problem: https://www.geeksforgeeks.org/problems/leaders-in-an-array-1587115620/1 Code: class Solution: def leaders(self, arr): leads = [] n = len(arr) maximum = arr[-1] # till will handle negatives # we will colle...

Dec 26, 20252 min read

LeetCode: Intersection of Two Arrays

Problem: https://leetcode.com/problems/intersection-of-two-arrays/ Code: class Solution: def intersection(self, nums1: List[int], nums2: List[int]) -> List[int]: result = set() n2 = set(nums2) for num in nums1: ...

Dec 24, 20252 min read

LeetCode: Repeated Substring Pattern

Problem: https://leetcode.com/problems/repeated-substring-pattern/ Code: class Solution: def repeatedSubstringPattern(self, s: str) -> bool: return s in (s + s)[1:-1] # Points to note: # - A repeated string will reappear ...

Dec 22, 20254 min read

LeetCode Shahwar

65 posts

I write LeetCode Explanations here

Command Palette

Problem:

Code:

Key Points:

Comments

More from this blog