Відео

Great explanation. I still wonder why that Pos was given so much importance there in the the problem?

Amazing explanation, thank you.

which whiteboard tool do you use?

❤

Got the logic, thanks 👍

I think recursively is easier

I practiced it more than 10 times now I can solve in a heartbeat in different ways

how can leetcode regard this as easy

Great video!!!

unreal explanation! thank you for the clarity!!

Really appreciated, this channel is a treasure for everyone willing to master problem solving! I hope U back soon and continue teaching us these amazing techniques

appreciated! actually it's amazing content, that's insane .. thx a lot for your effort

Small request, please use night mode, otherwise it's difficult to read

Simply checking if the value at buy index is greater than value at sell index seems a bit more intuitive to me, as the goal is to get the high sell value to the right of the buy index. var maxProfit = function(prices) { let buy = prices.length - 1; let sell = prices.length - 1; let profit = 0; while(buy > 0 && sell > 0){ if(prices[buy] > prices[sell]){ sell = buy; } else { buy--; profit = Math.max(profit, prices[sell] - prices[buy]); } } return profit; };

can't you also set negative numbers at the index, and if you come across a negative value, that's the dupe?

The second swap throws me this error: [nums[i], nums[j]] = [nums[j], nums[i]] ^ TypeError: Cannot set properties of undefined (setting '3')

Why is it 9? Isnt that the max left and right + 1? then isnt that shoud be 6?

Thankyou so much for creating these videos, these are so helpful

Hi Andy, Plz make more in js, you explaination is very good and easily understandable

Time Limit Exceeded

Awesome, thank you

Using a string to check parenthesis pairs is very clever. I would have jumped straight to making a hash map without considering simpler options.

Andy, what's the book you recommend to learn all the graphs concepts you mention? See, I have the issue that I have plenty of experience with building distributed services, serverless, APIs, databatases, infrastructure, etc, etc, but, in interviews I usually always fail because they request these types of algorithms problems that I just don't know how to traverse and that puts me down. I'm a self taught person, I didn't graduate as a software engineer as others might have so I didn't see graphs theory of anything of that at a university, just learned what the market was demanding for a job, and it feels bad that I cannot pass interviews because of these.

Andy, what's the book you recommend to learn all the graphs concepts you mention? See, I have the issue that I have plenty of experience with building distributed services, serverless, APIs, databatases, infrastructure, etc, etc, but, in interviews I usually always fail because they request these types of algorithms problems that I just don't know how to traverse and that puts me down. I'm a self taught person, I didn't graduate as a software engineer as others might have so I didn't see graphs theory of anything of that at a university, just learned what the market was demanding for a job, and it feels bad that I cannot pass interviews because of these.

Thanks

what is the whiteboard app name which you were using to draw the dfs tree?

thanks for you,your solution deserves much more elegant

You make things extremely overcomplicated for literally no reason man. For example, sofar should be named as maxSum or currentSum etc. If you can't even name something properly then it is only going to confuse everyone. For the max, you could have written maxAverage, finalAverage, etc. Nobody is going to know what you are naming what for what. Learn basic naming sense dude.

no need to sort the input array

some people using recursion or while(true) approach and yours has prev. which one is better?

The best solution I've ever seen; it's better than AI answers. Great explanation

Easiest medium leetcode exercise I have seen so far, not sure if they forgot to add some test cases?, it passes even with just this: const findPeakElement = nums => nums.indexOf(Math.max(...nums));

This is a dope solution. How do you even think of that

can you show me how to also do it with hash or sets please.

best teacher for leetcode in youtube

Thanks so much

Thank you very much

Simple solution: /** * @param {number[]} nums * @param {number} k * @return {void} Do not return anything, modify nums in-place instead. */ var rotate = function (nums, k) { k = k % nums.length; nums = nums.slice(-k).concat(nums.slice(0, -k)); };

Please continue the series sir more leetcode solution please

I wish the helper functions would've been explained more, you just built upon the fact that everyone has read the book.

I understands codes more when it's been coded than explained on paper or board. You explained it very well, and it's actually easy to comprehend. Thank you!

thats was soo poorly explained

the audio is so low I can't hear you. but great job!

left + (right - left) === right

great explanation

Man, thank you so much. I am beginning to get pretty comfortable with linked lists, but this problem turned my brain into mush and I finally decided it was better to just see it demonstrated and then use that knowledge in future problems. Your explanation was so clear and concise, I finally actually understand this fully.

Best vid I found today for understanding quick sort. Thank you!

I hardly heard your voice, I don't know if it is from your microphone or you are not speaking louder...

hello, /** * @param {string} s * @return {boolean} */ var isValid = function(s) { let input=s.split(""); let count=0; for(let i=0;i<input.length;i++) { for(let j=i+1;j<input.length;j++) { if(input[i]=='('&& input[j]==')' || input[i]=='[' && input[j]==']' || input[i]=='{'&& input[j]=='}') { count++; } if( input[i]=='(' && input[j+1]==')' || input[i]=='{' && input[j+1]=='}' ||input[i]=='[' && input[j+1]==']') { return false; } } } if((count*2)==input.length) { return true; } else { return false; } };

thank you so much for this video!!!! helps me a lot