# JavaScript: Swap pairs of adjacent digits of a given integer of even length

## JavaScript Basic: Exercise-150 with Solution

Write a JavaScript program to swap pairs of adjacent digits of a given integer of even length.

Pictorial Presentation:

Sample Solution:

HTML Code:

``````<!DOCTYPE html>
<html>
<meta charset="utf-8">
<meta name="viewport" content="width=device-width">
<title>Swap pairs of adjacent digits of a given integer of even length.</title>
<body>

</body>
</html>
```
```

JavaScript Code:

``````function swap_adjacent_digits(n)
{
if (n.toString().length%2!=0)
{
return false;
}
var result = 0,
x = 1;
while (n != 0) {
var dg1 = n % 10,
dg2 = ((n - dg1) / 10) % 10;
result += x * (10 * dg1 + dg2);
n = Math.floor(n / 100);
x *= 100;
}
return result;
}
``````

Sample Output:

```51
2143
214365
false
```

Flowchart:

ES6 Version:

``````function swap_adjacent_digits(n) {
if (n.toString().length % 2 != 0) {
return false;
}

var result = 0,
x = 1;

while (n != 0) {
var dg1 = n % 10,
dg2 = (n - dg1) / 10 % 10;
result += x * (10 * dg1 + dg2);
n = Math.floor(n / 100);
x *= 100;
}

return result;
}

``````

Live Demo:

See the Pen javascript-basic-exercise-150 by w3resource (@w3resource) on CodePen.

Improve this sample solution and post your code through Disqus

What is the difficulty level of this exercise?

Test your Programming skills with w3resource's quiz.

﻿

## JavaScript: Tips of the Day

Checks if a string is an anagram of another string (case-insensitive, ignores spaces, punctuation and special characters)

Example:

```const isAnagram = (str1, str2) => {
const normalize = str =>
str
.toLowerCase()
.replace(/[^a-z0-9]/gi, '')
.split('')
.sort()
.join('');
return normalize(str1) === normalize(str2);
};
console.log(isAnagram('iceman', 'cinema')); // true
```

Output:

```true
```