Error
|
|
---|---|
@Ibrahim Nash | 5761 |
@blackshadows | 5701 |
@akhayrutdinov | 5111 |
@mb1973 | 4989 |
@Quandray | 4944 |
@saiujwal13083 | 4506 |
@sanjay05 | 3762 |
@marius_valentin_dragoi | 3516 |
@sushant_a | 3459 |
@verma_ji | 3341 |
@KshamaGupta | 3318 |
Complete Leaderboard | |
|
|
@aroranayan999 | 938 |
@bt8816103042 | 739 |
@SHOAIBVIJAPURE | 428 |
@codeantik | 412 |
@SherlockHolmes3 | 407 |
@neverevergiveup | 348 |
@mahlawatep | 347 |
@shalinibhataniya1097 | 343 |
@murarry3625 | 333 |
@saiujwal13083 | 326 |
@rohitanand | 314 |
Complete Leaderboard |
Given N bits to an XOR - Gate find the output that will be produced.
XOR - Gate Table:
1 ^ 1 = 0
1 ^ 0 = 1
0 ^ 1 = 1
0 ^ 0 = 0
Example 1:
Input:
N = 4
arr: 1 1 1 0
Output:
1
Explanation:
1 ^ 1 = 0
0 ^ 1 = 1
1 ^ 0 = 1
hence output is 1
Example 2:
Input:
N = 4
arr: 0 0 1 0
Output:
1
Explanation:
0 ^ 0 = 0
0 ^ 1 = 1
1 ^ 0 = 1
hence output is 1
Your Task:
You don't need to read input or print anything. Your task is to complete the function xorGate() which takes the array arr[], its size N as input parameters and returns the output after processing OR operations on N bits.
Expected Time Complexity: O(N)
Expected Space Complexity: O(1)
Constraints:
1<=N<=1000
We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?
Yes