Codeforces problem mentioned while discussing G- codeforces.com/contest/1968/problem/D
@danushbasanaboyina1306
3 ай бұрын
@aryanc403 When will you take the session for explaining the lambda functions in c++
@A_Myth963
3 ай бұрын
i just love you man...the amount of work you put in and the way you explain every little detail and give those liitle hints during problem is just amazing❤
@danushbasanaboyina1306
3 ай бұрын
Aryan bro you are using lambda functios Can you take a session to explain whole lambda functions in c++
@gouravpanseja7236
3 ай бұрын
Great explanation! really helped
@998psp
3 ай бұрын
Your contest discussion streams are so helpful. Please do such more up- solving sessions. It's more than a week and you have not done any streaming.
@Sarkarrrrr6985
3 ай бұрын
Thanks a lot sir, these videos are really helpful, i can't explain what are you doing for us
@raghavrathi2412
3 ай бұрын
In e, you are taking the range of first few characters and then extending this range by adding the next character. Like first take A to E, the add a few F's. What if the string only contained letters B to G, and then we were adding H?
@aryanc403
3 ай бұрын
B to G just means we have A-G but A appears 0 times.
@ramankr0022
3 ай бұрын
helpful, ty
@sanathk3528
3 ай бұрын
I couldn't understand one thing in G, why can't we use the staying at the cell move only for the last cell we decide to stay, And check for all cells as last staying, and why couldn't we go in the shortest possible path with max value among all shortest paths to that cell. I am getting 23ac , 13 wa couldn't figure out why. Couldn't understand two things, y to use staying at the cell on two different one's ,( can't we stay at the cell which has max among the both). And if we decide to stay at some cell,y can't we go in shortest path? If we go in non shortest path, can't we replace one move with the cell we want to stay to get more value. I m sure i m wrong somewhere, but couldn't figure out where I m wrong 😅
@aryanc403
3 ай бұрын
Staying at last cell is the correct approach but using shortest path to reach last cell is incorrect. Check the counter testcase in the video.
@sanathk3528
3 ай бұрын
@@aryanc403Yeah got it, i was only seeing replacing one extra wasted move with maximum cell , but group of wasted moves can be more value than shortest path, i left the video after the solution, so didn't go through counter test case, thanks brother ❤.
@subhashsuryawanshi8820
3 ай бұрын
How do I solve the C problem in general of AT CODER ABC contest and DIV 2 B problem, is there anything you can suggest me? Most of the time I can come up with the brute force solution but i get TLE
@aryanc403
3 ай бұрын
You can join the discord yt403.com/discord and check #🚗roadmap-to-red-in-2-mins channel.
@subhashsuryawanshi8820
3 ай бұрын
Thanks I have joined the discord channel provided
@nakultiwari5162
3 ай бұрын
Can anybody provide a template which he is using
@NaruTo-zn1ps
3 ай бұрын
Sir struggling with dp any tips to improve . able to solve only standard ones
@aryanc403
3 ай бұрын
Join the discord yt403.com/discord and check #🚗roadmap-to-red-in-2-mins channel.
@NaruTo-zn1ps
3 ай бұрын
@@aryanc403 k thanks sir
@GhostRiley-g2s
3 ай бұрын
aryan bhai please thoda saaf saaf likho
@aryanc403
3 ай бұрын
Bhai bada muskil kaam hai yeh. School mai teachers bolte bolte thak gaye but handwriting sahi nahi hui. :(
@GhostRiley-g2s
3 ай бұрын
@@aryanc403 bhai aap saare words ko capital m likho, pehle slow hoga phir automatically handwriting sudhar jayega
@aryanc403
3 ай бұрын
Thanks a lot. I can try this for next video.
@Anonymous____________A721
3 ай бұрын
Thanks god
@CoderAadarsh
3 ай бұрын
For problem C, bitmask DP was the intended solution...
@aryanc403
3 ай бұрын
Its just bitmask, no dp.
@JIGARSINGTHAKOR-yy6qp
3 ай бұрын
Bhaiya is "cracking the coding interview " book is worth to buy in 2024???
Пікірлер: 30