Easy Solution (Bit Manipulation) beats 100%
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n    youtube link - http
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n    youtube link - https://www.youtube.com/watch?v=PeouhGUGr7Q\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```python3 []\nfrom typing import List\n\nclass Solution:\n    def smallestSubarrays(self, nums: List[int]) -> List[int]:\n        n = len(nums)\n        max_or_setbits = [-1] * 32\n        ans = []\n\n        for i in range(n - 1, -1, -1):\n            cur = nums[i]\n            pos = 0\n\n            while cur:\n                if cur & 1:\n                    max_or_setbits[pos] = i\n                cur //= 2\n                pos += 1\n\n            max_index = max(max_or_setbits)\n            ans.append(max_index - i + 1 if max_index != -1 else 1)\n\n        return ans[::-1]\n\n```
['Python3']