SUBSUMS In Bitmasking

sir i code in java and prateek bhaiya has used lower and upper bound functions of stl bt what should i use in java ,i searched a lot bt could not find the solution .plz help

Hi

you can write the upper bound lower bound function using binary search that would be equivalent.
in java we don’t have such functions.

also you can refer this article https://stackoverflow.com/questions/15603832/java-equivalent-of-c-equal-range-or-lower-bound-upper-bound

Hit like if you get it!
Cheers!