Tech for good

class Solution: def maximumUnits(self, boxTypes: List[List[int]], truckSize: int) -> int: # Sort boxTypes by units per box in descending order boxTypes.sort(key=lambda x: x[1], reverse=True) total_units = 0 for boxes, units_per_box in boxTypes: if truckSize == 0: break # Take as many boxes as possible, up to the truckSiz..

class Solution: def maximum69Number (self, num: int) -> int: num_str = list(str(num)) for i in range(len(num_str)): if num_str[i] == '6': num_str[i] = '9' break # Only change the single element return int(''.join(num_str))

class Solution: def largestPerimeter(self, nums: List[int]) -> int: nums.sort(reverse=True) # Sort descending for greedy check for i in range(len(nums)-2): a, b, c = nums[i], nums[i+1], nums[i+2] if b + c > a: # Triangle inequality return a + b + c return 0 for i in range(len(nums) - 2):is used because we are checking triplets of side ..