← All problemsSign in

3858. Minimum Bitwise OR From Grid

LeetCodeArrayGreedyBit ManipulationMatrixOpen on judge ↗

You are given a 2D integer array grid of size m x n. You must select exactly one integer from each row of the grid. Return an integer denoting the minimum possible bitwise OR of the selected integers from each row. Example 1: Input: grid = [[1,5],[2,4]] Output: 3 Explanation: - Choose 1 from the first row and 2 from the second row. - The bitwise OR of 1 | 2 = 3​​​​​​​, which is the minim

HINT LADDERno hints yet
L1 Observation
L2 Technique
L3 Approach
L4 Pseudo-code
🔒
L5 Full solution
L5 unlocks only if you insist twice
solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI

Sign in to chat with the tutor and save your progress.

Sign in to start