Available question text
Given an array and a target, find the minimum absolute difference between target and the bitwise AND of any subarray arr[l..r]. The core challenge is to avoid O(n^2) checks by using the monotone/decreasing property of subarray ANDs (there are few distinct AND values ending at each index).
Related questions
Continue with questions that share topics or the same question type.
- Find the Closest Element to a Target in an Array
Coding
- Closest Binary Search Tree Value
Coding · Binary Search · Binary Search Tree · Binary Tree
- Closest Binary Search Tree Value II
Coding · Binary Search Tree · Binary Tree · Depth-First Search
- Find All Combinations of Bag Sizes That Sum to a Target Capacity
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 1521. Find a Value of a Mysterious Function Closest to Target
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source