> For the complete documentation index, see [llms.txt](https://gl01.gitbook.io/gfg-editorials/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://gl01.gitbook.io/gfg-editorials/2024/02-2024-feb-24/27-play-with-or.md).

# 27. Play With OR

The problem can be found at the following link: [Question Link](https://www.geeksforgeeks.org/problems/play-with-or5515/1)

## My Approach

* Iterate through the given array from index 0 to n-2.
* For each index i, perform a bitwise OR operation between arr\[i] and arr\[i+1].
* Update the value at arr\[i] with the result of the OR operation.
* Continue this process until the second-to-last element of the array.
* Return the modified array.

## Time and Auxiliary Space Complexity

* **Time Complexity**: `O(N)`, where N is the length of the array.
* **Auxiliary Space Complexity**: `O(1)`

## Code (C++)

```cpp
int* game_with_number(int arr[], int n)
{
    for(int i = 0 ; i < n - 1; ++i){
        arr[i] |= arr[i+1];
    }
    return arr;
}
```

## Contribution and Support

For discussions, questions, or doubts related to this solution, please visit our [discussion section](https://github.com/getlost01/gfg-potd/discussions). We welcome your input and aim to foster a collaborative learning environment.

If you find this solution helpful, consider supporting us by giving a ⭐ star to the [getlost01/gfg-potd](https://github.com/getlost01/gfg-potd) repository.