Program To Find The Position Of Right Most Set Bit | FREE DSA Course in JAVA | Lecture 18
Vložit
- čas přidán 8. 12. 2022
- Data Structures and Algorithms Free Course (Learn DSA Without Paise) Playlist - • Data Structures And Al...
We are up with the lecture 18 of our much awaited dsa course in java.
Proceeding with our bit manipulation module, he is a very popular question in this segment ie. program to find the position of the right most set bit.
This concept is very important to understand because it is asked in many dsa interviews as well as this concept is used in many other programs.
Learn about this important concept in this lecture.
Subscribe to our channel for regular updates on the dsa course and click on the bell icon to never miss an update from our dsa course.
For more information, fill this form: forms.gle/8eiUmM92Fx563Aen9
or call us at 8884881203
Facebook: / thetapacademy
Instagram: / tapacademy_online
Linkedin: / 73820805
Website: www.thetapacademy.com
#dsa #dsacourse #java #dsainjava #javaprogramming #coding #coder
Nicely explained...! Thank you
Your's logic is correct but geeks for geeks test case 4/1230 not passed with above code but u are legend bro i never watched tutorial like this before keep it up great
So helpful sir🫠🫠 really appreciate thisss
Always welcome
Wow, Explantion is such a easy...Best of Best Teacher out there, he should be awareded to make DS as this much easy....now im bery confident to crack DS interviews
the best ever explanation on yt
best dsa teacher
Yes excellent clarity...best teacher
I have been watching since one week ,it's a nice dsa series
4:04 correct me if i am wrong but ,sir if return statement is gonna be return i+1; o/p would be Position of the rightmost set bit: 7.if we change return b.length() - i; then we will get Position of the rightmost set bit: 2.
Hi - How would you convert number to position in C or C++?
26:38 last formula for logN is incorrect. Kindly check.
is it log2 N = log10 N / log10 2 ?