Leetcode 1499. Max Value of Equation

  Рет қаралды 12,134

Fraz

Fraz

Күн бұрын

Пікірлер: 27
@akashyadagouda896
@akashyadagouda896 7 ай бұрын
Good point. it's noted that xj + yj is constant. Additionally, we aim to identify the maximum value of yi - xi within a certain range, specified by the condition yi - xi
@Priyadarshankumar-te7lf
@Priyadarshankumar-te7lf Жыл бұрын
we came here for understanding the approach, not just to watch someone who just read the copied code , saying this code and that code .
@takeapieandrun
@takeapieandrun 3 жыл бұрын
5:10 Why do you consider Xj + Yj constant? Doesn't it change as you iterate down the priority queue so you must consider it? For example in the first dataset provided, Xj + Yj is [4, 2, 15, -4]
@akashyadagouda896
@akashyadagouda896 7 ай бұрын
Good point. it's noted that xj + yj is constant. Additionally, we aim to identify the maximum value of yi - xi within a certain range, specified by the condition yi - xi
@nurtayevyerzhan911
@nurtayevyerzhan911 4 жыл бұрын
keep doing it, this is really helpful!
@mohammadfraz
@mohammadfraz 4 жыл бұрын
Thanks a lot 😊
@nurtayevyerzhan911
@nurtayevyerzhan911 4 жыл бұрын
@@mohammadfraz a very good explanation! it’s a pity that I found your channel only now(
@mohammadfraz
@mohammadfraz 4 жыл бұрын
Glad that you loved ❤️. I have been covering contests and approaches since JANUARY. If possible please Share 😇.
@nurtayevyerzhan911
@nurtayevyerzhan911 4 жыл бұрын
​@ Lead Coding yeah,I'll tell my friends who do cp!
@mohammadfraz
@mohammadfraz 4 жыл бұрын
Thanks a lot again
@shubhamnaik4205
@shubhamnaik4205 4 жыл бұрын
Make videos on all the data structures and algorithms which are important and helpful in competitive programming. Thanks finally.
@mohammadfraz
@mohammadfraz 4 жыл бұрын
Yes in future I am planning for that 😊. Keep sharing the videos Thanks
@shubhamnaik4205
@shubhamnaik4205 4 жыл бұрын
@@mohammadfraz yes sure for your best work
@swananddeshmukh4405
@swananddeshmukh4405 3 жыл бұрын
Instead of saying "this thing", if you will say X or Y or more specific words that would be really great, thank you
@theghostwhowalk
@theghostwhowalk 2 жыл бұрын
Would be helpful if you could take example walk through. Otherwise good explanation.
@Vardanaggarwal
@Vardanaggarwal 4 күн бұрын
bilkul bhi samj nhi aayi
@ujjvalsharma5055
@ujjvalsharma5055 3 жыл бұрын
Another wonderful video :)
@mohammadfraz
@mohammadfraz 3 жыл бұрын
Thanks 😊
@giangkhuat9343
@giangkhuat9343 2 жыл бұрын
can some one explain to me why x_j and w_j is constant while y_i - x_i is changing ? Shouldn't they both change as we iterate ???
@akashyadagouda896
@akashyadagouda896 7 ай бұрын
Good point. it's noted that xj + yj is constant. Additionally, we aim to identify the maximum value of yi - xi within a certain range, specified by the condition yi - xi
@AshutoshKumar-ee8ig
@AshutoshKumar-ee8ig 4 жыл бұрын
Please explain solution of Parallel Courses 2 from biweekly contest 29 also...
@mohammadfraz
@mohammadfraz 4 жыл бұрын
Yes, I will try as soon as I can.
@deepashreekulkarni3213
@deepashreekulkarni3213 3 жыл бұрын
Is it maxHeap or minHeap?
@ayushgarg5929
@ayushgarg5929 3 жыл бұрын
This Problem can be easily solved in 0(n) time...just compare max.for every index using sliding window
@steverogers1657
@steverogers1657 Жыл бұрын
Video is too short to explain hard problem of leetcode
Largest rectangle in Histogram | Leetcode #84
27:43
Techdose
Рет қаралды 110 М.
小丑和白天使的比试。#天使 #小丑 #超人不会飞
00:51
超人不会飞
Рет қаралды 43 МЛН
I Took a LUNCHBAR OFF A Poster 🤯 #shorts
00:17
Wian
Рет қаралды 17 МЛН
АЗАРТНИК 4 |СЕЗОН 1 Серия
40:47
Inter Production
Рет қаралды 1,4 МЛН
Subarray Sums Divisible by K - Leetcode 974 - Python
16:41
NeetCodeIO
Рет қаралды 15 М.
Dynamic Programming isn't too hard. You just don't know what it is.
22:31
DecodingIntuition
Рет қаралды 140 М.
Whiteboard Coding Interviews: 6 Steps to Solve Any Problem
15:18
Fullstack Academy
Рет қаралды 369 М.
I gave 127 interviews. Top 5 Algorithms they asked me.
8:36
Sahil & Sarra
Рет қаралды 650 М.
Maximum Total Importance of Roads - Leetcode 2285 - Python
9:59
Intro to Competitive Programming
11:41
Junferno
Рет қаралды 775 М.