#
**About**

This is a series of JavaScript Code Daily Challenge. Each day I show a few solutions written in JavaScript. The questions are from coding practice/contest sites such as HackerRank, LeetCode, Codeforces, Atcoder and etc.

Between Two Sets

https://www.hackerrank.com/challenges/between-two-sets

```
'use strict';
const fs = require('fs');
process.stdin.resume();
process.stdin.setEncoding('utf-8');
let inputString = '';
let currentLine = 0;
process.stdin.on('data', function(inputStdin) {
inputString += inputStdin;
});
process.stdin.on('end', function() {
inputString = inputString.split('\n');
main();
});
function readLine() {
return inputString[currentLine++];
}
```

Complete the 'getTotalX' function in comment.

The function is expected to return an INTEGER.

```
function getTotalX(a, b) {
}
```

```
function main() {
const ws = fs.createWriteStream(process.env.OUTPUT_PATH);
const firstMultipleInput = readLine().replace(/\s+$/g, '').split(' ');
const n = parseInt(firstMultipleInput[0], 10);
const m = parseInt(firstMultipleInput[1], 10);
const arr = readLine().replace(/\s+$/g, '').split(' ').map(arrTemp => parseInt(arrTemp, 10));
const brr = readLine().replace(/\s+$/g, '').split(' ').map(brrTemp => parseInt(brrTemp, 10));
const total = getTotalX(arr, brr);
ws.write(total + '\n');
ws.end();
}
```

## Top comments (5)

Here's my (somewhat optimized) answer written in Lua:

Intuitively, I'd say this should run in O(n) time using O(1) memory.

EDIT: Here's the same algorithm but in Ruby

Where'd you get the 100 from?

Open the link given in the question and check the constraints

Ah, I see. Well, you can still choose a smaller number though.