Given an array of positive integers, find bitwise AND of a subarray, among all subarrays, which is closest to a given positive integer, 'P'.
The solution can obviously be found in O(n^2), but can we do better?
Asked
Active
Viewed 123 times
0
-
Duplicate https://stackoverflow.com/questions/55657935/listing-bitwise-ands-of-all-subarrays-where-i-j – גלעד ברקן Apr 13 '19 at 16:07
-
5Possible duplicate of [Listing bitwise ands of all subarrays where i <= j](https://stackoverflow.com/questions/55657935/listing-bitwise-ands-of-all-subarrays-where-i-j) – Matt Timmermans Apr 13 '19 at 16:17
-
Can you [edit] the question to cite the original source of the problem? – D.W. Apr 14 '19 at 20:32