3783. Mirror Distance of an Integer

/**
 * Problem: LeetCode 3783 - Mirror Distance of an Integer
 * Difficulty: Easy
 * Language: Java
 * Author: CodeByTushu
 */
class Solution {
    public int mirrorDistance(int n) {
        int temp = n;
        long reversed = 0;
        
        while (temp > 0) {
            reversed = reversed * 10 + (temp % 10);
            temp /= 10;
        }
        
        return (int) Math.abs(n - reversed);
    }
}

"""
Problem: LeetCode 3783 - Mirror Distance of an Integer
Difficulty: Easy
Language: Python
Author: CodeByTushu
"""
class Solution:
    def mirrorDistance(self, n: int) -> int:
        reversed_n = int(str(n)[::-1])
        return abs(n - reversed_n)

/**
 * Problem: LeetCode 3783 - Mirror Distance of an Integer
 * Difficulty: Easy
 * Language: C++
 * Author: CodeByTushu
 */
#include <cmath>
#include <cstdlib>

using namespace std;

class Solution {
public:
    int mirrorDistance(int n) {
        int temp = n;
        long long reversed = 0;
        
        while (temp > 0) {
            reversed = reversed * 10 + (temp % 10);
            temp /= 10;
        }
        
        return static_cast<int>(abs(n - reversed));
    }
};

/**
 * Problem: LeetCode 3783 - Mirror Distance of an Integer
 * Difficulty: Easy
 * Language: JavaScript
 * Author: CodeByTushu
 */
/**
 * @param {number} n
 * @return {number}
 */
var mirrorDistance = function(n) {
    let temp = n;
    let reversed = 0;
    
    while (temp > 0) {
        reversed = reversed * 10 + (temp % 10);
        temp = Math.floor(temp / 10);
    }
    
    return Math.abs(n - reversed);
};