Learn AI Create the Future — with Pranay
Main site

LeetCode solutions

2525. Count Number of Distinct Integers After Reverse Operations

My accepted JavaScript solution to LeetCode problem 2525, Count Number of Distinct Integers After Reverse Operations, running in 173ms.

  • Difficulty: Medium
  • JavaScript
  • Runtime 173ms
  • Memory 83.6MB

Read the problem on LeetCode View on GitHub

The problem statement is LeetCode’s and stays on their site. What follows is my accepted solution.

JavaScript

Accepted on LeetCode — runtime 173ms, memory 83.6MB, accepted 2025-12-29.

javascript
var countDistinctIntegers = function(nums) {
    const set = new Set(nums);
    for (const num of nums) {
        const reversed = parseInt(String(num).split('').reverse().join(''), 10);
        set.add(reversed);
    }
    return set.size;
};

Source