3300. Minimum Element After Replacement With Digit Sum

LeetCodeArrayMathOpen on judge ↗

You are given an integer array nums. You replace each element in nums with the sum of its digits. Return the minimum element in nums after all replacements. Example 1: Input: nums = [10,12,13,14] Output: 1 Explanation: nums becomes [1, 3, 4, 5] after all replacements, with minimum element 1. Example 2: Input: nums = [1,2,3,4] Output: 1 Explanation: nums becomes [1, 2, 3, 4] after all

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI