MediumNo. 2592
Maximize Greatness of an Array — LeetCode 2592 Python Solution
- Pattern
- Two Pointers
- Topics
- Greedy, Array, Two Pointers, Sorting
- Reading time
- 2 min
- Source
- leetcode.com
The problem
You are given a 0-indexed integer array nums. You are allowed to permute nums into a new array perm of your choosing.
Example
- Input
- nums = [1,3,5,2,1,3,1]
- Output
- 4
- Explanation
- One of the optimal rearrangements is perm = [2,5,1,3,3,1,1].
Python solution
class Solution:
def maximizeGreatness(self, nums: List[int]) -> int:
nums.sort()
i = 0
for x in nums:
i += x > nums[i]
return iComplexity
- Time
- O(n × log n)
- Space · auxiliary
- O(log n)where n is the length of the array nums
Pattern: Two Pointers
Use the order already in the input to discard half the search space at every step. LeetCode 2592. Maximize Greatness of an Array is filed here because LeetCode tags it Two Pointers, which is the vocabulary this hub collects.
The two pointers guide has the Python template for the pattern and the 201 LeetCode problems that use it.
Related problems
| No. | Problem | Difficulty |
|---|---|---|
| 0455 | Assign Cookies | Easy |
| 0611 | Valid Triangle Number | Medium |
| 0826 | Most Profit Assigning Work | Medium |
| 0870 | Advantage Shuffle | Medium |
| 0881 | Boats to Save People | Medium |
| 0948 | Bag of Tokens | Medium |
Frequently asked questions
- How hard is LeetCode 2592. Maximize Greatness of an Array?
LeetCode 2592. Maximize Greatness of an Array is rated Medium on LeetCode.
- What is the time complexity of LeetCode 2592. Maximize Greatness of an Array?
The Python solution on this page runs in O(n × log n).
- What is the space complexity of LeetCode 2592. Maximize Greatness of an Array?
The Python solution on this page uses O(log n), where n is the length of the array nums auxiliary space.
- What topics does LeetCode 2592. Maximize Greatness of an Array cover?
LeetCode 2592. Maximize Greatness of an Array is tagged Greedy, Array, Two Pointers and Sorting on LeetCode.