3300 - 3399
Solutions categorised by Problem IDs
3300 - Minimum Element After Replacement With Digit SumFind the minimum value after replacing every array element with the sum of its decimal digits.3364 - Minimum Positive Sum SubarrayFind the minimum positive sum of a subarray with a length between l and r using a simple running-sum approach.3375 - Minimum Operations to Make Array Values Equal to KCount the distinct levels above k to determine the fewest operations needed to reduce all values to k, checking feasibility first.
