give integer array num find maximum possible bitwise or subset num return number different nonempty subset maximum bitwise ORAn array subset array b obtain b delete possibly zero element b two subset consider different index element choose differentThe bitwise or array equal a0 or a1 or or aalength 1 0indexed Example 1input num 31output 2explanation the maximum possible bitwise or subset 3 there 2 subset bitwise or 3 3 31example 2input num 222output 7explanation all nonempty subset 222 bitwise or 2 there 23 1 7 total subsetsexample 3input num 3215output 6explanation the maximum possible bitwise or subset 7 there 6 subset bitwise or 7 35 315 325 3215 25 215 constraints1 numslength 161 numsi 105