Skip to content

Practice Minimize OR of Remaining Elements Using Operations

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Hard#3022
LeetCode Problem

Minimize OR of Remaining Elements Using Operations

Problem Statement

You are given a 0-indexed integer array nums and an integer k. In one operation, you can pick any index i of nums such that 0 <= i < nums.length - 1 and replace nums[i] and nums[i + 1] with a single occurrence of nums[i] & nums[i + 1], where & represents the bitwise AND operator. Return the minimum possible value of the bitwise OR of the remaining elements of nums after applying at most k operations.

Source: Minimize OR of Remaining Elements Using Operations on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input
nums = [3,5,3,2,7], k = 2
Output
3

# Example 2

Input
nums = [7,3,15,14,2,8], k = 4
Output
2

# Example 3

Input
nums = [10,7,10,3,9,14,9,4], k = 1
Output
15

Constraints

1 <= nums.length <= 10^5
0 <= nums[i] < 2^30
0 <= k < nums.length

Related LeetCode Problems

Practice more problems similar to Minimize OR of Remaining Elements Using Operations.

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.