Count Number of Maximum Bitwise-OR Subsets | LeetCode Weekly contest 263 | DSA

problem link:
leetcode.com/c...
solution:
ideone.com/ToRfgK
___________________________________________________________________________
All my playlists:
DSA sheet:
• 450 questions DSA sheet
Interview experiences:
• Internship tests/Inter...
Leetcode problems:
• leetcode problems
projects for resume:
• Projects for Resume
___________________________________________________________________________
Connect with me on LinkedIn:
/ aditya-rajiv-0606491a5
Connect with me on Instagram:
/ adi_rajiv
#leetcode #weekly #contest263 #coding #stl #gfg #arrays #data_structure #algorithms #datastructure #algorithms

[@rajgupta5158]

could u please solve with dp?

[@manannagpal2822]

Bad explanation

[@kulasekhar]

from collections import deque
class Solution:
def countMaxOrSubsets(self, nums: List[int]) -> int:
self.maximumOR = 0

for x in nums:
self.maximumOR |= x
self.res = []
self.currNums = deque()

def helper(index,nums,currOR):
if index == len(nums):
if currOR == self.maximumOR:
self.res.append(list(self.currNums))
return

self.currNums.append(nums[index])
tempOR = currOR | nums[index]
helper(index + 1, nums,tempOR)
self.currNums.pop()
helper(index + 1, nums,currOR)

return
currOR = 0
helper(0,nums,currOR)

return len(self.res)