| # | User | Rating |
|---|---|---|
| 1 | ecnerwala | 3648 |
| 2 | Benq | 3580 |
| 3 | orzdevinwang | 3570 |
| 4 | cnnfls_csy | 3569 |
| 5 | Geothermal | 3568 |
| 6 | tourist | 3565 |
| 7 | maroonrk | 3530 |
| 8 | Radewoosh | 3520 |
| 9 | Um_nik | 3481 |
| 10 | jiangly | 3467 |
| # | User | Contrib. |
|---|---|---|
| 1 | maomao90 | 174 |
| 2 | awoo | 164 |
| 2 | adamant | 164 |
| 4 | TheScrasse | 159 |
| 4 | nor | 159 |
| 6 | maroonrk | 156 |
| 7 | -is-this-fft- | 150 |
| 8 | SecondThread | 147 |
| 9 | orz | 146 |
| 10 | pajenegod | 145 |
Doubt in a question asked in linkedin coding test
You are given two arrays a and b each of size n. For each i (0<=i<n), you have to find smallest 'x' such that
-> x+y = a[i]
-> x^y = b[i] (i.e. x xor y = b[i])
0<=a[i],b[i]<=10^(15)
1<=n<=50
It is possible that there might be no 'x' possible. Would be glad if anyone could help...
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en3 |
|
poerhfsdhfnc_h | 2020-11-11 09:06:51 | 22 | Tiny change: 'x^y = b[i]\n\n0<=a[i' -> 'x^y = b[i] (i.e. x xor y = b[i])\n\n0<=a[i' | |
| en2 |
|
poerhfsdhfnc_h | 2020-11-11 08:49:00 | 10 | ||
| en1 |
|
poerhfsdhfnc_h | 2020-11-11 08:48:39 | 316 | Initial revision (published) |
