Shortest Subarray With OR at Least K II | Leetcode 3097

[@chetanshrivastava3762]

Sir, you are genius....best explanation for a complex problem.

[@techdose4u]

🙏🏼

[@BHUVANESHWARIR-x1j]

Clear Explanation... Thank you so much sir !!

[@techdose4u]

Thanks :)

[@anujmishra1688]

Best Explanation ❤

[@techdose4u]

Thanks :)

[@walky4158]

Great explanation!

[@techdose4u]

Thanks :)

[@sailendrachettri8521]

Another great explanation :)

[@techdose4u]

Thanks :)

[@photos9350]

nice explanation

[@techdose4u]

thanks

[@21flame72]

sir make a seperate video for how to choose some apprach based on constraints

[@techdose4u]

👍🏼

[@ShubhamSingh-ek6fp]

Thank you sir
class Solution {
public:
void updateFreq(vector& bitFreq, int num, int val){
for(int i = 0; i < 32; i++){
if(num & (1

[@techdose4u]

👍🏼

[@explore_with_sim]

Very well explained !!

[@techdose4u]

Thanks :)