that dry run explanation is really helpful i finally understood what the prefix sum approach is doing
@techdose4uАй бұрын
great :)
@n-lognАй бұрын
Thank you sir for your daily efforts
@techdose4uАй бұрын
welcome :)
@BHUVANESHWARIR-x1j29 күн бұрын
As usual Great Explanation ... Keep Going 💥
@techdose4u29 күн бұрын
Thanks :)
@B-BillyАй бұрын
Thank you... a perfect explanation!
@techdose4uАй бұрын
Glad it was helpful!
@anupamtiwary426529 күн бұрын
great explanation!! Thank you
@techdose4u29 күн бұрын
welcome :)
@bngocsc9198229 күн бұрын
thank you so much
@techdose4u29 күн бұрын
welcome
@anonymous-sz8jq29 күн бұрын
thankyou so much sir!
@techdose4u29 күн бұрын
Welcome :)
@lakithakare738729 күн бұрын
Thank you
@techdose4u29 күн бұрын
Welcome!
@sailendrachettri852129 күн бұрын
Thank you sir :)
@techdose4u29 күн бұрын
welcome :)
@kingraj479729 күн бұрын
Nice Detailed Explanation sir..But Sir How does the Idea comes to solve with having prefixSum array..And another doubt is by looking the constraints how we can say in which time complexity the problem is solved..Please explain it in next video or else if already there send me link of resource for that.Thank you sir
@techdose4u29 күн бұрын
I had already made a video on this titled: “Algo to any problem”
@rhugvedbhojane4387Ай бұрын
Thank you!
@techdose4uАй бұрын
welcome
@ujjwal_7531Ай бұрын
nice expln.
@techdose4uАй бұрын
Appreciate it.
@adityarajvermaa29 күн бұрын
was stuck in this for 3 hours. Sir do you think sticking to a probelm for these many hours, is good, or shall I move on to the next question. But utimately watched this tutorial, and then was able to code down the solution by myself
@techdose4u29 күн бұрын
good to be stuck :) it will help in the long run
@TheSmashten29 күн бұрын
Had absolutely no clue how to do this problem. Feels bad
@techdose4u29 күн бұрын
you will improve on learning everyday :)
@saka_codesАй бұрын
subscribed
@techdose4uАй бұрын
great :)
@imfaded310529 күн бұрын
I Came up with this solution but the last test case failed due to time limit class Solution { private static boolean torf(int[]arr , int start , int end){ boolean res=true; for(int i =start;i