201. Bitwise AND of Numbers Range (Solution Explained ) - LeetCode JAVA/C++ | BitWise- #04
It's always best to learn one at a time and then all together
GFG POTD Playlist - • DAY 1 | Filling Bucket...
Number Theory playlist - • 204. Count Primes - (A...
Arrays - • Reverse a String | Ep-01
LinkedList - • Reverse a Linked List ...
Strings - • Day 300 - Multiply two...
Bitwise - • Non Repeating Numbers ...
Stacks - • DAY - 280 Reverse a St...
Heaps - • How to Build Heap and ...
Recursion - • Lec-1 What is Recursio...
Map - • Non Repeating Characte...
Graphs Playlist Link - • Course Schedule II (To...
Binary Trees Playlist - • What is a Binary Tree ?
DP playlist - • What is Dynamic Progra...
Use code for 10% off on GFG : "AKSHAYS10"
----------------------------------------------
GitHub: github.com/AkshayAnil1080
Problem Link:leetcode.com/problems/bitwise...
Solution: github.com/AkshayAnil1080/DSA...
Other Social Media
----------------------------------------------
LinkedIn - / akshay-a-26672a172
Twitter - / akshay_anil_
Linktree: linktr.ee/aksh_yay
Instagram
/ itzz_aksh_yay
/ dsa_with_akshay
Happy Coding 🤝
#AkshayAnil #dsa #dsa_with_akshay #dsasheet #programming #gfg #gfgpotd #problemsolving #coding #softwareengineer #faang #amazon #microsoft #competitiveprogramming #dsasheet #interviewpreparation
Пікірлер: 5
amazing
@AkshayAnil0-1
5 ай бұрын
🙌
seeing this optimized approach for first time quite difficult to get resolve that this is the solution . but after more dry run it is now crystal clear
class Solution { public int rangeBitwiseAnd (int left,int right){ while(right>left) right=right &(right-1); return right; } }