DEV Community

Divya Divya
Divya Divya

Posted on

Different Arrangements of a Numbers

1. 123456 => 654321

Python

def sum1(no,sum):
    if no>0:
        sum=sum*10 + no%10
        no=no//10
        return sum1(no,sum)
    return sum
print(sum1(123456,0))
Enter fullscreen mode Exit fullscreen mode

JavaScript:

function sum1(no, sum) {
    if (no > 0) {
        sum = sum * 10 + (no % 10);
        no = parseInt(no / 10);
        return sum1(no, sum);
    }
    return sum;
}

console.log(sum1(123456, 0));
Enter fullscreen mode Exit fullscreen mode

Java :

class Main {
    static int sum1(int no, int sum) {
        if (no > 0) {
            sum = sum * 10 + (no % 10);
            no = no / 10; 
            return sum1(no, sum);
        }
        return sum;
    }

    public static void main(String[] args) {
        System.out.println(sum1(123456, 0));
    }
}
Enter fullscreen mode Exit fullscreen mode

Output :

2. 123456 => 563421

Python:

def sum1(no,sum):
    if no>0:
        sum=sum*100 + no%100
        no=no//100
        return sum1(no,sum)
    return sum
print(sum1(123456,0))
Enter fullscreen mode Exit fullscreen mode

JavaScript:

function sum1(no, sum) {
    if (no > 0) {
        sum = sum * 100 + (no % 100);
        no = parseInt(no / 100);
        return sum1(no, sum);
    }
    return sum;
}

console.log(sum1(123456, 0));
Enter fullscreen mode Exit fullscreen mode

Java:

class Main {
    static int sum1(int no, int sum) {
        if (no > 0) {
            sum = sum * 100 + (no % 100);
            no = no / 100; 
            return sum1(no, sum);
        }
        return sum;
    }

    public static void main(String[] args) {
        System.out.println(sum1(123456, 0));
    }
}
Enter fullscreen mode Exit fullscreen mode

Output :

3. 123456 => 456123

Python:

def sum1(no,sum):
    if no>0:
        sum=sum*100 + no%100
        no=no//100
        return sum1(no,sum)
    return sum
print(sum1(123456,0))
Enter fullscreen mode Exit fullscreen mode

JavaScript:

javascript
function rotate(no) {
    let last = no % 1000;         
    let first = parseInt(no / 1000); 

    return last * 1000 + first;
}

console.log(rotate(123456));
Enter fullscreen mode Exit fullscreen mode

Java:

class Main {
    static int rotate(int no) {
        int last = no % 1000;   // 456
        int first = no / 1000;  // 123

        return last * 1000 + first;
    }

    public static void main(String[] args) {
        System.out.println(rotate(123456));
    }
}
Enter fullscreen mode Exit fullscreen mode

Output :

4. 123456 => 135246

Python:

no = 123456
no1 = 100000
result1 = ""  
result2 = ""  

while no > 0 and no1 >= 1:
    res = no // no1
    res1 = res % 10
    result1 += str(res1)      
    no = no % no1
    no1 = no1 // 10           

    if no > 0 and no1 >= 1:
        res = no // no1
        res2 = res % 10
        result2 += str(res2)  
        no = no % no1
        no1 = no1 // 10

result = result1 + result2
print(result)
Enter fullscreen mode Exit fullscreen mode

JavaScript:

function rearrangeNumber(no) {
    let no1 = 100000;
    let result1 = "";
    let result2 = "";

    while (no > 0 && no1 >= 1) {
        let res = Math.floor(no / no1);
        let res1 = res % 10;
        result1 += res1.toString();

        no = no % no1;
        no1 = Math.floor(no1 / 10);

        if (no > 0 && no1 >= 1) {
            res = Math.floor(no / no1);
            let res2 = res % 10;
            result2 += res2.toString();

            no = no % no1;
            no1 = Math.floor(no1 / 10);
        }
    }

    let result = result1 + result2;
    return result;
}

console.log(rearrangeNumber(123456));
Enter fullscreen mode Exit fullscreen mode

Output:

Top comments (2)

Collapse
 
payilagam_135383b867ea296 profile image
Payilagam •

Explain the program

Collapse
 
divya_divya_b18f82b19353a profile image
Divya Divya •

Okay Sir