#sorting
Read more stories on Hashnode
Articles with this tag
class Solution: def frequencySort(self, nums: List[int]) -> List[int]: c = Counter(nums) v = [x[0] for x in...
class Solution: def maxProfitAssignment(self, difficulty: List[int], profit: List[int], worker: List[int]) -> int: N = len(profit) ...
class Solution: def minIncrementForUnique(self, nums: List[int]) -> int: nums.sort() ans = 0 for i in range(len(nums) -...
class Solution: def minMovesToSeat(self, seats: List[int], students: List[int]) -> int: seats.sort() students.sort() diff...
class Solution: def sortColors(self, nums: List[int]) -> None: c = Counter(nums) count = [] for e in range(3): ...
class Solution: def heightChecker(self, heights: List[int]) -> int: minVal = float('inf') maxVal = 0 freq =...
