Available question text
Given an array of positive integers, for each number replace every digit with the largest digit present in that number (e.g., 523 -> 555) and return the sum of these transformed numbers. Constraints are small (n ≤ 50, nums[i] ≤ 1000), so a simple per-number digit scan suffices.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 3079. Find the Sum of Encrypted Integers
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source