Well played Unacademy by making Codechef Pro. Who is waiting for Codeforces Pro after Codechef Pro? Just Kidding Guys.
# | User | Rating |
---|---|---|
1 | ecnerwala | 3649 |
2 | Benq | 3581 |
3 | orzdevinwang | 3570 |
4 | Geothermal | 3569 |
4 | cnnfls_csy | 3569 |
6 | tourist | 3565 |
7 | maroonrk | 3531 |
8 | Radewoosh | 3521 |
9 | Um_nik | 3482 |
10 | jiangly | 3468 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 161 |
4 | TheScrasse | 159 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 152 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
Well played Unacademy by making Codechef Pro. Who is waiting for Codeforces Pro after Codechef Pro? Just Kidding Guys.
Problem link I did not find any better solution in the discuss section of leetcode that's why posting here.
1 — link of the first problem 2 — link of second problem thanks in advance.
Given an array A of N elements, you can pick at most one element of the array and increment or decrement it by any value. The task is to maximize the AND of the resulting array.
Note: AND of the array is defined as the bitwise AND(&) of all the array elements.
Constraints: 2 ≤ N ≤ 2 * 10^5 0 ≤ A[i] ≤ 2 * 10^9
Name |
---|