Bit Trial and Error Method¶
Table of Contents¶
- 3007. Maximum Number That Sum of the Prices Is Less Than or Equal to K (Medium)
- 421. Maximum XOR of Two Numbers in an Array (Medium)
- 2935. Maximum Strong Pair XOR II (Hard)
- 3145. Find Products of Elements of Big Array (Hard)
- 3022. Minimize OR of Remaining Elements Using Operations (Hard)
- 3287. Find the Maximum Sequence Value of Array (Hard)
3007. Maximum Number That Sum of the Prices Is Less Than or Equal to K¶
-
LeetCode | LeetCode CH (Medium)
-
Tags: binary search, dynamic programming, bit manipulation
421. Maximum XOR of Two Numbers in an Array¶
-
LeetCode | LeetCode CH (Medium)
-
Tags: array, hash table, bit manipulation, trie
2935. Maximum Strong Pair XOR II¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: array, hash table, bit manipulation, trie, sliding window
3145. Find Products of Elements of Big Array¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: array, binary search, bit manipulation
3022. Minimize OR of Remaining Elements Using Operations¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: array, greedy, bit manipulation
3287. Find the Maximum Sequence Value of Array¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: array, dynamic programming, bit manipulation