I'm so glad to have come across your channel. Your way of organising the content, structuring a lesson, presentation, ... that too over a seemingly complicated topic like DP to make it feel so simple and elegant... This channel is a goldmine!
practiced after watching this amazing video. import math str1 = ['A','B','C'] res=[] for j in range(0,int(math.pow(2, len(str1)))): temp = "" for i in range(len(str1)): if j & 1
Since a long time, I want to learn Bitmasking, I suddenly found and learn whole things. Thanks making this video. if possible, Make one more video related problem solving with bit mask. Best thing I learn is blocking the bits... my god so easy to understand..
Good Explanation, but i don't get why need to left shift after creating 2^n-1 bitmasks, cant we check jth bits of bitmask itself, if its 1 then take arr[j]
Small question the bitwise & operation is checking for equality with 1, shouldn't it be checking for inequality with 0? For the bits other than LSB the result of bitwise & would be powers of 2. Superb explanation as always !!
When I think of logic, I am getting only the brute force logic. But if I see the answer I am understanding the logic and if any similar kind of problems occurs, I am able to use this logic in some other problems. But I am never getting the optimal logic so far by not seeing the solution. I am only getting the brute force logic. Now I feel like memorizing the logics but problem solving means deducing the solution on the spot, right? without having seen the similar problem before. I dont understand what I am doing, is it problem solving or memorizing the logics? However in any interviews, the questions will be somehow new only. It is not guaranteed that I will get only the questions which I have practised. Please suggest me on this.
i followed your channel while i was learning to code and i recommended it to all my friends in college, especially to ones who were trying for SDE jobs but were not from CS or IT . I am curious as to what software (and special hardware,if any) you use for writing on screen, I'd love to try it once. Anyway , keep up the good work!
Your videos are good, but you missed the part of explaining from mask size 0. what could be the case if our current mask is 0 ? how the j will change the mask. Just a thing which I didn't get.
Some of friends who works in service based company have got more compensation than the who are working in product based company......they have increased their compensation while switching by getting counter offer....they have switched to service based company only...what's the use of working in product based company
Please please please make a solution video on *Leetcode 1486* it is categorised as an easy problem because expected time complexity is O(N) but using some bitmanipulation O(1) solution exists and it is very complex....so please make a video on it🥺🥺
I have to rearrange the numbers in a string in a decreasing order Input: 3times4 is 12 Output:12times4 is 3 Input: Exam23 is Endby35 tomorrow98 Output: Exam98 is Endby35 tomorrow23 Know the solution, take me out..
I'm so glad to have come across your channel. Your way of organising the content, structuring a lesson, presentation, ... that too over a seemingly complicated topic like DP to make it feel so simple and elegant... This channel is a goldmine!
Great :)
practiced after watching this amazing video.
import math
str1 = ['A','B','C']
res=[]
for j in range(0,int(math.pow(2, len(str1)))):
temp = ""
for i in range(len(str1)):
if j & 1
Great :)
Lal phul Pila phul ! your explaining technique is beautiful!!!!!!!!
😂
Since a long time, I want to learn Bitmasking, I suddenly found and learn whole things.
Thanks making this video.
if possible, Make one more video related problem solving with bit mask.
Best thing I learn is blocking the bits... my god so easy to understand..
:)
The best explanation of the subset problem..........🔥🔥
Thanks
Insightful and very helpful !
Thanks 😊
Dude you should have like a billion subs. Great content.
Thanks 😊
very nice video Surya Sir, want more of videos related to bit manipulation👏👏👏👏
👍🏼
Great method, very intuitive!!
Thanks ❤️
Very informative video.
Thank you so much!
Welcome 😀
precise explanation thanks ,you earned a sub.
Lovely video, please do dp + bitmasking next, thanks!
Sure
very helpful video. thank you so much
Welcome
Excellent!
For anyone who tried the last question using the code in the video, In the line :
if(mask &(1
correctumundo....
Omg your back!!! More leetcode video please!
Sure
Amazing content quality
❤️❤️❤️❤️❤️❤️
:)
Great content like always.
Thank you :)
Good Explanation, but i don't get why need to left shift after creating 2^n-1 bitmasks, cant we check jth bits of bitmask itself, if its 1 then take arr[j]
Small question the bitwise & operation is checking for equality with 1, shouldn't it be checking for inequality with 0? For the bits other than LSB the result of bitwise & would be powers of 2.
Superb explanation as always !!
When I think of logic, I am getting only the brute force logic. But if I see the answer I am understanding the logic and if any similar kind of problems occurs, I am able to use this logic in some other problems.
But I am never getting the optimal logic so far by not seeing the solution. I am only getting the brute force logic.
Now I feel like memorizing the logics but problem solving means deducing the solution on the spot, right? without having seen the similar problem before.
I dont understand what I am doing, is it problem solving or memorizing the logics?
However in any interviews, the questions will be somehow new only. It is not guaranteed that I will get only the questions which I have practised.
Please suggest me on this.
You need more practice
Great content. Kindly do dp + bitmasking, thanks
DP + BitMasking is easier to teach in LIVE class. I have covered it in my batch :)
@@techdose4u ok then btw thnx for replying
What will be the time complexity if we do this using recursion? 2^N.
If yes then bit masking is slower?
I cannot find the DP + bitmasking video from the playlist.
Please make video remove duplicate in a string using recursion full explanation
👍🏼
Hi Surya, Can you please explain wiggle sort II problem.
👍🏼
Thanks
i followed your channel while i was learning to code and i recommended it to all my friends in college, especially to ones who were trying for SDE jobs but were not from CS or IT .
I am curious as to what software (and special hardware,if any) you use for writing on screen,
I'd love to try it once. Anyway , keep up the good work!
Your videos are good, but you missed the part of explaining from mask size 0. what could be the case if our current mask is 0 ? how the j will change the mask. Just a thing which I didn't get.
Best
:)
Some of friends who works in service based company have got more compensation than the who are working in product based company......they have increased their compensation while switching by getting counter offer....they have switched to service based company only...what's the use of working in product based company
No need to work in product based company if you wanna rest in peace :)
Sir which application you used to making the video . Can you tell me the name sir
S sir pls say the application name?
@@onestopplacement4917 pta chale to mere ko msg kr dena okk bro
@@mnnitianexplains7325 plz tell me in english bro
@@onestopplacement4917 right i want to say that if any time u get name of appilcation used by tech doze so u can tell me
Please please please make a solution video on *Leetcode 1486* it is categorised as an easy problem because expected time complexity is O(N) but using some bitmanipulation O(1) solution exists and it is very complex....so please make a video on it🥺🥺
I have to rearrange the numbers in a string in a decreasing order
Input: 3times4 is 12
Output:12times4 is 3
Input: Exam23 is Endby35 tomorrow98
Output: Exam98 is Endby35 tomorrow23
Know the solution, take me out..
8:14 there will be 8 subsequence not subset ,am i correct ?
Make more videos sir. Its awesomeeeeee
Sure.