@MD_ItteshamItte/

# 2018 google kick start Q1

## No description

Files
• index.js
index.js
```1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
```
```/*KickStart 2018 Round A
* Problem A. Even Digits
* Both solved
**/
let fs= require('fs');
console.log(input.map((e,i)=>`Case #\${i+1}: \${solve(e)}`).join('\n'));

function solve(str){
let up= '', down= '';
for (let i=0; i<str.length; i++) {
if (str[i]%2) {

str[i]!=='9'?

break;
}
up+= str[i];
};

for (let i=0; i<str.length; i++) {
if (str[i]%2) {
break;
}
down+= str[i];
};

if (Number.isSafeInteger(+str)) {
return Math.min(Math.abs(str-up), Math.abs(str-down));
}

return [getDiff(str,up), getDiff(str,down)]
.sort()[0].replace(/^0+(?=\d)/,'');
}

/*
JS can't handle very big numbers natively
(check out Number.MAX_SAFE_INTEGER)... yet (BigInt and other stuff is coming)
so in order to solve A-large subproblem I implemented the function
getDiff which determines a difference between two numbers represented
as strings: for example getDiff('13','2')-> '11', getDiff('5','8')-> '03' etc.
*/

function getDiff(a, b)
{
const len= Math.max(a.length, b.length);
let r= '', c= 0, d, diff;
if (a < b) [a,b]= [b,a];

for (let i=len-1; i>=0; i--)
{
d= +b[i] + c;

+a[i]>=d ?
(c= 0, diff= a[i]-d)
:(c= 1, diff= '1'+a[i]-d)

r = diff + r;
}
return r;
}```