Special Array II | Leetcode 3152

  Рет қаралды 4,400

Techdose

Techdose

Күн бұрын

Пікірлер
@jody4210
@jody4210 Ай бұрын
that dry run explanation is really helpful i finally understood what the prefix sum approach is doing
@techdose4u
@techdose4u Ай бұрын
great :)
@n-logn
@n-logn Ай бұрын
Thank you sir for your daily efforts
@techdose4u
@techdose4u Ай бұрын
welcome :)
@BHUVANESHWARIR-x1j
@BHUVANESHWARIR-x1j 29 күн бұрын
As usual Great Explanation ... Keep Going 💥
@techdose4u
@techdose4u 29 күн бұрын
Thanks :)
@B-Billy
@B-Billy Ай бұрын
Thank you... a perfect explanation!
@techdose4u
@techdose4u Ай бұрын
Glad it was helpful!
@anupamtiwary4265
@anupamtiwary4265 29 күн бұрын
great explanation!! Thank you
@techdose4u
@techdose4u 29 күн бұрын
welcome :)
@bngocsc91982
@bngocsc91982 29 күн бұрын
thank you so much
@techdose4u
@techdose4u 29 күн бұрын
welcome
@anonymous-sz8jq
@anonymous-sz8jq 29 күн бұрын
thankyou so much sir!
@techdose4u
@techdose4u 29 күн бұрын
Welcome :)
@lakithakare7387
@lakithakare7387 29 күн бұрын
Thank you
@techdose4u
@techdose4u 29 күн бұрын
Welcome!
@sailendrachettri8521
@sailendrachettri8521 29 күн бұрын
Thank you sir :)
@techdose4u
@techdose4u 29 күн бұрын
welcome :)
@kingraj4797
@kingraj4797 29 күн бұрын
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
@techdose4u
@techdose4u 29 күн бұрын
I had already made a video on this titled: “Algo to any problem”
@rhugvedbhojane4387
@rhugvedbhojane4387 Ай бұрын
Thank you!
@techdose4u
@techdose4u Ай бұрын
welcome
@ujjwal_7531
@ujjwal_7531 Ай бұрын
nice expln.
@techdose4u
@techdose4u Ай бұрын
Appreciate it.
@adityarajvermaa
@adityarajvermaa 29 күн бұрын
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
@techdose4u
@techdose4u 29 күн бұрын
good to be stuck :) it will help in the long run
@TheSmashten
@TheSmashten 29 күн бұрын
Had absolutely no clue how to do this problem. Feels bad
@techdose4u
@techdose4u 29 күн бұрын
you will improve on learning everyday :)
@saka_codes
@saka_codes Ай бұрын
subscribed
@techdose4u
@techdose4u Ай бұрын
great :)
@imfaded3105
@imfaded3105 29 күн бұрын
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
@techdose4u
@techdose4u 29 күн бұрын
nice
@karthik-varma-1579
@karthik-varma-1579 Ай бұрын
better you zoom the question sir
@techdose4u
@techdose4u Ай бұрын
are you watching on mobile ?
Каха и дочка
00:28
К-Media
Рет қаралды 3,4 МЛН
Мясо вегана? 🧐 @Whatthefshow
01:01
История одного вокалиста
Рет қаралды 7 МЛН
VIP ACCESS
00:47
Natan por Aí
Рет қаралды 30 МЛН
Enceinte et en Bazard: Les Chroniques du Nettoyage ! 🚽✨
00:21
Two More French
Рет қаралды 42 МЛН
Fourier Transform Explained Intuitively
9:48
Ali the Dazzling
Рет қаралды 8 М.
BS-17. Aggressive Cows | Binary Search Hard
26:44
take U forward
Рет қаралды 192 М.
Minimum Limit of Balls in a Bag | Leetcode 1760
22:31
Techdose
Рет қаралды 5 М.
Каха и дочка
00:28
К-Media
Рет қаралды 3,4 МЛН