LeetCode 898: Bitwise ORs of Subarrays
A clear explanation of counting distinct bitwise OR results from all non-empty subarrays using rolling sets.
5 notes
A clear explanation of counting distinct bitwise OR results from all non-empty subarrays using rolling sets.
A clear explanation of counting how many stones are jewels using a hash set for fast membership checks.
A clear explanation of filtering words that can be typed using only one row of an American keyboard.
A clear explanation of finding the third distinct maximum number using one pass and constant space.
A clear explanation of checking whether 2D points are symmetric around a vertical line using min and max x-coordinates.