Tech for good

class Solution: def frequencySort(self, s: str) -> str: # Step 1: Count frequency of each character freq = Counter(s) # Step 2: Build max-heap based on frequency # Use -count to simulate max-heap heap = [(-count, char) for char, count in freq.items()] heapq.heapify(heap) # Step 3: Build the result string from the heap result = []..

class Solution: def getFinalState(self, nums: List[int], k: int, multiplier: int) -> List[int]: n = len(nums) # Build a heap of (value, index) for index tracking heap = [(nums[i], i) for i in range(n)] heapq.heapify(heap) for _ in range(k): while True: val, idx = heapq.heappop(heap) # Check if the heap value m..