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!
@techdose4u3 жыл бұрын
Great :)
@bravitheja11423 жыл бұрын
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
@techdose4u3 жыл бұрын
Great :)
@ujeshnada72813 жыл бұрын
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..
@techdose4u3 жыл бұрын
:)
@Amitkumar-nw5mt3 жыл бұрын
Lal phul Pila phul ! your explaining technique is beautiful!!!!!!!!
@techdose4u3 жыл бұрын
😂
@hmswrth3 жыл бұрын
Dude you should have like a billion subs. Great content.
@techdose4u3 жыл бұрын
Thanks 😊
@soumakpoddar43723 жыл бұрын
The best explanation of the subset problem..........🔥🔥
@techdose4u3 жыл бұрын
Thanks
@anubhavsethi34163 жыл бұрын
Insightful and very helpful !
@techdose4u3 жыл бұрын
Thanks 😊
@wentingsong94353 жыл бұрын
Great method, very intuitive!!
@techdose4u3 жыл бұрын
Thanks ❤️
@rosonerri-faithful3 жыл бұрын
very nice video Surya Sir, want more of videos related to bit manipulation👏👏👏👏
@techdose4u3 жыл бұрын
👍🏼
@hasanimrul4403 жыл бұрын
Very informative video. Thank you so much!
@techdose4u3 жыл бұрын
Welcome 😀
@sakshamkapoor59053 жыл бұрын
Lovely video, please do dp + bitmasking next, thanks!
@techdose4u3 жыл бұрын
Sure
@visheshkumargautam1683 Жыл бұрын
precise explanation thanks ,you earned a sub.
@dayanandraut56603 жыл бұрын
very helpful video. thank you so much
@techdose4u3 жыл бұрын
Welcome
@algorithmo1343 жыл бұрын
Omg your back!!! More leetcode video please!
@techdose4u3 жыл бұрын
Sure
@suyashmisra74063 жыл бұрын
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!
@SauravKumar-yp1fy2 жыл бұрын
For anyone who tried the last question using the code in the video, In the line : if(mask &(1
@aswinkrishnap10602 жыл бұрын
correctumundo....
@Varuns363 жыл бұрын
Amazing content quality ❤️❤️❤️❤️❤️❤️
@techdose4u3 жыл бұрын
:)
@gourav.barkle3 жыл бұрын
Great content like always.
@bloody91623 жыл бұрын
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 !!
@elanchezian44523 жыл бұрын
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.
@techdose4u3 жыл бұрын
You need more practice
@karankanojiya76722 жыл бұрын
Excellent!
@Abhishek-sz8wg11 ай бұрын
8:14 there will be 8 subsequence not subset ,am i correct ?
@RahulKumar-wv4ti3 жыл бұрын
What will be the time complexity if we do this using recursion? 2^N. If yes then bit masking is slower?
@impatientgaming98688 ай бұрын
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]
@shreyakjain96923 жыл бұрын
Great content. Kindly do dp + bitmasking, thanks
@techdose4u3 жыл бұрын
DP + BitMasking is easier to teach in LIVE class. I have covered it in my batch :)
@shreyakjain96923 жыл бұрын
@@techdose4u ok then btw thnx for replying
@ShaliniNegi242 жыл бұрын
Thank you :)
@Adilakshmi_Nagiri3 жыл бұрын
Hi Surya, Can you please explain wiggle sort II problem.
@techdose4u3 жыл бұрын
👍🏼
@The-fc1fi3 жыл бұрын
Please make video remove duplicate in a string using recursion full explanation
@techdose4u3 жыл бұрын
👍🏼
@RamSingh-zp1nl3 жыл бұрын
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
@techdose4u3 жыл бұрын
No need to work in product based company if you wanna rest in peace :)
@Bhushan1234able3 жыл бұрын
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.
@schan263 Жыл бұрын
I cannot find the DP + bitmasking video from the playlist.
@techykush71923 жыл бұрын
Sir which application you used to making the video . Can you tell me the name sir
@onestopplacement49173 жыл бұрын
S sir pls say the application name?
@mnnitianexplains73253 жыл бұрын
@@onestopplacement4917 pta chale to mere ko msg kr dena okk bro
@onestopplacement49173 жыл бұрын
@@mnnitianexplains7325 plz tell me in english bro
@mnnitianexplains73253 жыл бұрын
@@onestopplacement4917 right i want to say that if any time u get name of appilcation used by tech doze so u can tell me
@harshalgarg11493 жыл бұрын
Thanks
@Shanto262 ай бұрын
Best
@techdose4u2 ай бұрын
:)
@KeshariPiyush243 жыл бұрын
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🥺🥺
@muttanagendrakumar27713 жыл бұрын
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..
@sharuk35453 жыл бұрын
Make more videos sir. Its awesomeeeeee
@techdose4u3 жыл бұрын
Sure.
@tinal3991Ай бұрын
I have a suggestion, make the screen more clear, it's too much and too colorful. cheers