Skip to content

Practice Find the Sum of Encrypted Integers

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Easy#3079
LeetCode Problem

Find the Sum of Encrypted Integers

Problem Statement

You are given an integer array nums containing positive integers. We define a function encrypt such that encrypt(x) replaces every digit in x with the largest digit in x. For example, encrypt(523) = 555 and encrypt(213) = 333. Return the sum of encrypted elements.

Source: Find the Sum of Encrypted Integers on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input
nums = [1,2,3]
Output
6

# Example 2

Input
nums = [10,21,31]
Output
66

Constraints

1 <= nums.length <= 50
1 <= nums[i] <= 1000

Related LeetCode Problems

Practice more problems similar to Find the Sum of Encrypted Integers.

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.