<p>You are given a <strong>0-indexed</strong> integer array <code>nums</code> of length <code>n</code> and an integer <code>k</code>. In an operation, you can choose an element and multiply it by <code>2</code>.</p>

<p>Return <em>the maximum possible value of </em><code>nums[0] | nums[1] | ... | nums[n - 1]</code> <em>that can be obtained after applying the operation on nums at most </em><code>k</code><em> times</em>.</p>

<p>Note that <code>a | b</code> denotes the <strong>bitwise or</strong> between two integers <code>a</code> and <code>b</code>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> nums = [12,9], k = 1
<strong>Output:</strong> 30
<strong>Explanation:</strong> If we apply the operation to index 1, our new array nums will be equal to [12,18]. Thus, we return the bitwise or of 12 and 18, which is 30.
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> nums = [8,1,2], k = 2
<strong>Output:</strong> 35
<strong>Explanation:</strong> If we apply the operation twice on index 0, we yield a new array of [32,1,2]. Thus, we return 32|1|2 = 35.
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= nums.length &lt;= 10<sup>5</sup></code></li>
	<li><code>1 &lt;= nums[i] &lt;= 10<sup>9</sup></code></li>
	<li><code>1 &lt;= k &lt;= 15</code></li>
</ul>

class Solution:
    def maximumOr(self, nums: List[int], k: int) -> int:

        bitwise_or = lambda x, y: x | y
        REV = lambda x: tuple(reversed(tuple(x)))
        SHIFT_ADD_ZERO = lambda x: ((0,) + tuple(x)[:-1])
        # PARTIAL_OR = lambda x: ((0,) + tuple(accumulate(x, bitwise_or))[:-1])
        PARTIAL_OR = lambda x: SHIFT_ADD_ZERO(accumulate(x, bitwise_or))
        # PARTIAL_OR = lambda x: tuple(accumulate(x, bitwise_or))

        nums.sort()
        # print(f'sorted {nums=}')
        partialOrLeft = PARTIAL_OR(nums)
        # print(f'{partialOrLeft=}')
        partialOrRight = REV(PARTIAL_OR(REV(nums)))
        # print(f'{partialOrRight=}')

        answer = 0
        for i, N in enumerate(nums):
            left_Or = partialOrLeft[i]
            right_Or = partialOrRight[i]
            # print(f'{i}: [{left_Or}] {N=} [{right_Or}]')
            N <<= k         # left shift number by K bits
            # print(f'  shifted: {N=}')
            total_Or = left_Or | N | right_Or
            # print(f'  {total_Or=}')

            answer = max(answer, total_Or)

        return answer

697