LeetCode Odd Even Jump Solution Explained - Java
Vložit
- čas přidán 6. 09. 2024
- The Best Place To Learn Anything Coding Related - bit.ly/3MFZLIZ
Join my free exclusive community built to empower programmers! - www.skool.com/...
Preparing For Your Coding Interviews? Use These Resources
--------------------
(My Course) Data Structures & Algorithms for Coding Interviews - thedailybyte.d...
AlgoCademy - algocademy.com...
Daily Coding Interview Questions - bit.ly/3xw1Sqz
10% Off Of The Best Web Hosting! - hostinger.com/...
Follow Me on X/Twitter - x.com/nickwhit...
Follow My Instagram - / nickwwhite
Other Social Media
----------------------------------------------
Discord - / discord
Twitch - / nickwhitettv
TikTok - / nickwhitetiktok
LinkedIn - / nicholas-w-white
Show Support
------------------------------------------------------------------------------
Patreon - / nick_white
PayPal - paypal.me/nick....
Become A Member - / @nickwhite
#coding #programming #softwareengineering
How in the name of god can anyone solve this question in a 45 minute interview, if they hanvet already done this question before.
lol, i agree man
yeah 30 mins in i was like “what the fuck am i doing with my life this is so pointless lol”
we can atleast we can come up with a o(n^2) solution in that time
well you are supposed to solve it beforehand if ur not a genius
thats the point , someone told me if an interviewer gave u to solve dp ques then he/she hates u already🤣
The description of the problem given in leetcode is really bad, once you understand the problem it's not difficult to formulate and code.
For Pythonic candidates, don't worry about not having TreeMap, I've build minimal version that fit's for this solution,
import sys
def get_higher(entry, val):
min_val = sys.maxsize
for k, v in entry.items():
if k >= val:
if k-val
i think you need to explain it on white board
its difficult to understand large problem with expression only.
Can anyone tell me why our answer is getting only updated in the case of higher[i] is true and not in the case of lower[i]
Because you always start with an odd transaction (start with an even transaction does not count, per the question rules).
great explanation...keep it up. you really explain the solution very well. Love from India.
Good job Nick !
Really great explanation of wtf dynamic programming is.
how come index 0 is being treated as odd index? Don't we treat 0 as even number?
if i is odd index, then find larger values and then choose smallest among them
if i is even index, then find smaller values and then choose largest among them
for index 0, this finds larger values (which are 13, 12, 14, 15) and then find min (13, 12, 14, 15) = 12
so i'm confused, since index 0 is treated as odd index.
The index means nothing really. It is just where you are starting. You are counting the jumps you make(i.e. The first jump from index i is odd and the 2nd is even and so forth). I had the same issue understanding the question as well.
It's not about the index but about the number of jumps. For example, if you start at 14 to arrive at 15 you are on your 1st jump so you treat as an odd jump. However, if you arrive at 14 due to another jump 14 forward will be your 2nd jump which is an even jump. It took me a while to realize this as well.
We can use ceilingKey and floorKey instead of ceilingEntry and floorEntry
Why use a treemap here? Can we not just store the smallest number, index and largest number,index above the current index? At 12 this would be 14,3 and 15,4. This would give us the next jumps for even and odd jumps at every index going backwards. Does that make sense?
Sorry I misunderstood the problem!
why did leetcode removed the editorial solution from site ?
Great explanation!! Keep it up!! Your videos are amazing.. I have one question though. Wouldn't ceilingEntry(A[i]) would always return index of 15 in this case? Or in general case when higher number is actually somewhere in between, it would return index of that number right? Then why not get the index of it in the beginning by sorting array (best is log(N) ) and then pass that value in comparisons?
Notice that we are moving from right to left. So any element before the current element is not inserted into treeMap yet. So it wont be looking backwards
Great explanation... It really helped me in understanding the question and the approach..
Great Explanation
You make it so easy
Thank you for saving me so much time to figure it out on my own
amazing, bro. You explained well, preparing for the upcoming google interview
That was the best explanation. PERIOD.
I really liked you explained the solution. However, in the interviews, if i directly jump into the solution, it will be evident that I knew the solution and hence that'll impact negatively. It'll be great if you could've explained how the solution can be evolved from a brute force solution. Thanks again for explaining DP solution.
really amazing pls uplod more dynamic programing problem
great ques explanation !!!
wonderfull explaination believe me u r doing a great job
Thank you for the explaination.
Really appreciate this video.
Can someone help understand the real life application of this problem?
Increasing your TC
thanks great explanation.
great explanation
thnaks a lot bro! :)
You are a saviour !
Great, now figure it out in 30 minutes of interview time LOL
Thank you so much, your explanation was great and you made it very easy to follow! As for the problem itself, I think it was invented by Satan himself
clap
This problem is a crap