Your channel is the best channel in my subscription list. Usually i get bored listening to the solution videos, but surprisingly that doesn't happen during your videos. Keep posting videos for the people like me so that i can also end up in the place you are currently in🙌🙌
Thanks for this! Really like the brevity of your walk-throughs on these questions, and it helps me a lot to try and translate them to different languages like C or C++ to better understand your explanations. Keep it up! :D
I'm glad that I solved this question on my own which I think is a result of following your channel. Even though the code that I wrote is a lot less elegant than yours but I'm glad that my thought is pretty much the same as yours and the time complexity is the same. Thank you for doing these videos!
You have superpower of explaining difficult things in easy words. The best part is you are teaching "how to think". BTW, what tool you use for drawing ?
Ah leetcode daily challenge questions are the best soln to provide. Love your content. Had a question regarding your Google interview, what if one cannot come up wid something better than sub optimal soln in limited time. What's the best way to optimise for time? Thanks!
Thanks for the videos. I have a much better understanding of programming because of videos like this. Could you explain why at 8:15 you need to do the for loop with the - 1? Is it because if we didn't we would have an extra for loop we would go through?
i love your channel neetcode. it’s been super helpful and i’ve made it to the final round at google in large part due to your help. thank you. do you think you’ll ever cover System Design questions?
Thanks for the video and for sharing your solution! Question: Isn’t changing the state of an input for a method that is supposed to check its state bad practice?
My solution cleared 320 test cases out of 335. And I wasn't able to come up with a way to handle edge cases like [3,4,2,3]. It feels bad when you are this close!! Although good explanation!!!!!
Assuming you are writing code which potentially should be possible to handle same task with 2+ substitutions. In such case you rather should go for increasing right number. This way you don't need to re-check numbers on left side again and can proceed validating numbers on the right which are still not verified. So your alg will be smth like O(n) with modifying right number and O(n)*log with modifying left.
Thank you so much for your videos! I'm an incoming cs major at Georgia Tech. I want an internship with a FAANG or hot startup company for summer 2023. I currently don't have any knowledge of data structures and algorithms. How long do you think it would take to be confident for interviews at such companies if I spent 10 hours every week learning and leet coding? If it helps to know, I'm doing The Odin Project, which I hope to finish before school starts in late August, and I also need to build 3~4 personal projects before I start preparing for these interviews.
thanks for the efforts. i'm curious, what tools are you using to make the videos? i love the online whiteboard/blackboard i think it might be pretty good to practice with one self
How about this solution? find the length of non-decreasing subsequence in the array. if it is + 1 >= length of original array (which means we need to change atmost one element) then return true or false. complexity is (nlogn)
We sent the left pointer to go up and the right pointer to go down. Case 1: left == right -> true Case 2: right-left > 1 -> false Case 3: left + 1 == right if left == start point -> true if right == end point -> true if nums[left - 1]
Will I get offer from google or any faang company? Pls, pls, pls say. My Career: Education : CSE 2nd Year (2022) Codejam rank: 523. (2021) 2 yrs+ experience in data science, web development with django, software development using c#. Langs: c,c++,python,java,c#
![BLACK BAG - Official Trailer [HD] - Only in Theaters March 14](http://i.ytimg.com/vi/Du0Xp8WX_7I/mqdefault.jpg)
Leetcode + Neetcode = Success !
I got selected in Amazon thanks to you 😊
Your channel is the best channel in my subscription list. Usually i get bored listening to the solution videos, but surprisingly that doesn't happen during your videos. Keep posting videos for the people like me so that i can also end up in the place you are currently in🙌🙌
Glad they're helpful!
Please never stop making these. I really like them.
Thanks for this! Really like the brevity of your walk-throughs on these questions, and it helps me a lot to try and translate them to different languages like C or C++ to better understand your explanations. Keep it up! :D
Thanks!
watched it 3 times , neat and clean explanation
I'm glad that I solved this question on my own which I think is a result of following your channel. Even though the code that I wrote is a lot less elegant than yours but I'm glad that my thought is pretty much the same as yours and the time complexity is the same. Thank you for doing these videos!
Thanks for going over the daily leetcode challenge
Never thought of using index - 2. I feel like I would never come up with that in an interview
Bro I just love the way u explain things by considering various types of test cases. Mad Respect for your efforts. Seriously !
You have superpower of explaining difficult things in easy words. The best part is you are teaching "how to think". BTW, what tool you use for drawing ?
i'm curious about that too does anyone know the name of the tool?
Can a stack be used to eliminate the edge cases?
Ah leetcode daily challenge questions are the best soln to provide. Love your content.
Had a question regarding your Google interview, what if one cannot come up wid something better than sub optimal soln in limited time. What's the best way to optimise for time? Thanks!
Best suggestion I have is to talk about possible ways to improve it with the interviewer and they might point you in the right direction.
Thanks for the videos. I have a much better understanding of programming because of videos like this. Could you explain why at 8:15 you need to do the for loop with the - 1? Is it because if we didn't we would have an extra for loop we would go through?
Basically to avoid array index out of bound since we are using comparing the current element with next element
Thanks for such an easy explanation 🙌
Love you man thanks a lot for these videos. Even my friend didn't help me but you are doing it.
Neighbour's lawn mower is becoming a frequent guest 😂 BTW great explanation as always 🙌
I know, I was almost finished too 😭
i love your channel neetcode. it’s been super helpful and i’ve made it to the final round at google in large part due to your help. thank you. do you think you’ll ever cover System Design questions?
Yeah I've been wanting to do it for a while but been busy. I will definitely start by August tho!
@@NeetCode Awesome! Looking forward to it. Thank you = )
wht you are doing is amazing man! keep it up
Shoutout to NeetCode for helping me get a much better job!
Congratulations 🎉
Thanks for the video and for sharing your solution!
Question: Isn’t changing the state of an input for a method that is supposed to check its state bad practice?
My solution cleared 320 test cases out of 335. And I wasn't able to come up with a way to handle edge cases like [3,4,2,3]. It feels bad when you are this close!! Although good explanation!!!!!
Same buddy 😂
same dude and then I started thinking about 3 pointer and O(n^2) solution's xd
Assuming you are writing code which potentially should be possible to handle same task with 2+ substitutions. In such case you rather should go for increasing right number. This way you don't need to re-check numbers on left side again and can proceed validating numbers on the right which are still not verified. So your alg will be smth like O(n) with modifying right number and O(n)*log with modifying left.
Thank you so much for your videos! I'm an incoming cs major at Georgia Tech. I want an internship with a FAANG or hot startup company for summer 2023. I currently don't have any knowledge of data structures and algorithms. How long do you think it would take to be confident for interviews at such companies if I spent 10 hours every week learning and leet coding? If it helps to know, I'm doing The Odin Project, which I hope to finish before school starts in late August, and I also need to build 3~4 personal projects before I start preparing for these interviews.
your videos are extremely helpful to me!! thank you
Hey man you are so cool and the best coding teacher of all time. Could you also solve 797. All Paths From Source to Target some day. Thx
So well explained! I'm going to crush my Amazon interview because of you! I'll send you a postcard if it happens :D
thanks for the efforts. i'm curious, what tools are you using to make the videos? i love the online whiteboard/blackboard i think it might be pretty good to practice with one self
How about this solution? find the length of non-decreasing subsequence in the array. if it is + 1 >= length of original array (which means we need to change atmost one element) then return true or false. complexity is (nlogn)
Why pick a more inefficient solution?
@@fa11en1ce nlogn is very close to n. also it is easy to think when you know the classical solution.
Thanks, nice explanations as usual!
Could this be optimized with binary search?
4 Lines JS code! After watching this video I discovered something deadlock 4 pattern! :
var checkPossibility = function(nums) {
let breakage = 0;
for (let i = 0; i < nums.length; i++) {
const num = nums[i]
if (num < nums[i - 1])
breakage++
if (breakage > 1)
return false
if (nums[i - 1] > nums[i + 1] && num > nums[i + 2]) //[4,9,2,5] //deadlock 4 pattern
return false
}
return true
};
We sent the left pointer to go up and the right pointer to go down.
Case 1: left == right -> true
Case 2: right-left > 1 -> false
Case 3: left + 1 == right
if left == start point -> true
if right == end point -> true
if nums[left - 1]
why it's not working if i just flip the if cond
i==0 || nums[i-1]
thanku so much
What is the program name that you use to draw ?
AWESOME 🍎
My goodness this was very wel explained
You can do only the else part because all this function has to do is to check the possibility. It is not necessary to make array non-decreasing.
Why are we adding 3 in the begining of the array? Please, anyone can explain it to me.
amazing!!!
Hey can you please do a video on leetcode problem: 968 (Binary Tree Cameras). It would be very helpful
Can you solve some question about binary search trees?
when we realise
nums[i+1] >= nums[i] and nums [i-1]
then why are we doing
nums[i] = nums[i+1]
Isn't this already non-decreasing in nature?
understood
hey bro please make a solution of problem leetcode 686 (repeated string match)
Java solution, much easier approach without even changing the input array.
class Solution {
public boolean checkPossibility(int[] nums) {
boolean status=true;
for(int i=1;i
Shouldn't this be an easy question?
try testing [4,2,1] with your code
please solve this problem 🙏 44. Wildcard Matching
I kind of get it. But can't see it clearly in my head
Can you solve leetcode 328.
好像很難, 不是很明白!
Will I get offer from google or any faang company? Pls, pls, pls say.
My Career:
Education : CSE 2nd Year (2022)
Codejam rank: 523. (2021)
2 yrs+ experience in data science, web development with django, software development using c#.
Langs: c,c++,python,java,c#
if you really rank top 500 in Google code jam you probably won't be so dumb to ask thos question