Youtube comments of Kevin Naughton Jr. (@KevinNaughtonJr).

  1. glad you're doing better dude and that you left and environment that wasn't healthy. life's too short to deal w stuff like that
    1000
  2. Do you guys prefer me going through 2 different solutions? I.e. the "naive" approach and the improved approach?
    255
  3. literally the best website you'll ever see in your lyfe - https://K2.codes/ what video should I make next???
    203
  4. IF THIS COMMENT GETS 100 LIKES I SWEAR I’M BUYING AND SHIPPING A RUBBER DUCK TO ONE OF MY PATRONS ON PATREON.
    181
  5. If you guys prefer longer videos like this with a little bit more explanation please let me know and I'll continue doing this! I typically try to make them a little on the shorter side so that people don't get bored 🙃
    175
  6. THERE IS NOTHING WRONG WITH GOING TO THE MOVIES ALONE
    160
  7. it's so hard to force yourself to make videos which inherently requires creativity. happy you're finding joy in coding again and doing what's best for you!
    134
  8. HOW DOPE IS MY SKI MASK
    123
  9. Do you guys want to see more videos like this? If so what video should Carly and I make together next?
    115
  10. Would you guys want to see another day in the life video but when I go to the office?
    115
  11. Pay no attention to my roommates screaming about the Jets game in the background 😬😂
    104
  12. I’d drink an entire bottle of hot sauce to not have to do that
    102
  13. WORD SEARCHES ARE FUUUUUUUN!!!!!
    75
  14. Did this help you guys understand dynamic programming?
    71
  15. did you like this video??? do you wanna see more of this kinda content???
    70
  16. Do you guys want to see more videos like this?
    68
  17. If I can do it you can do it; hard work always pays off! FAANG Interview Prep - Subscribe to The Daily Byte for $8/month or $80/year https://bit.ly/2DzsBd5
    68
  18. I DARE SOMEONE TO SAY SOMETHING ABOUT THE CANDLES Instagram: https://instagram.com/kevinnaughtonjr/ Twitter: https://twitter.com/KevinNaughtonJr Patreon: https://www.patreon.com/KevinNaughtonJr Merch: https://teespring.com/stores/kevin-naughton-jrs-store
    66
  19. links: https://K2.codes/
    63
  20. thank you so much i really appreciate the kind words! ❤
    62
  21. EVERYONE MAKES MISTAKES
    60
  22. Do you guys prefer videos this long or did that get boring?
    57
  23. STOP READING THIS COMMENT AND SET YOUR HOMEPAGE AS LEETCODE.COM AND WHEN YOU'RE REGINALD T. MONEYPANTS MAKING MILLIONS AT GOOGLE DON'T FORGET ABOUT ME
    55
  24. Was this video too long? Or are videos like this where I take more time to walk through examples and explain better? Let me know in the comments below!
    54
  25. Dynamic programming questions can be tricky so I hope this explanation made sense!
    52
  26. There's a reason why becoming a developer is difficult, but it's so worth it...if it was easy, everyone would do it! If you do successfully switch careers, your only regret will be that you didn't switch sooner. If there's anything I can do to help you guys be sure to drop a comment and let me know. I'm always, always, always, happy to help!
    51
  27. If you need help passing your tech interviews, check out the interviewing service I created to teach people. We just launched mock interviews too! https://thedailybyte.dev/?ref=kevin
    48
  28. Want to improve your data structures and algorithms skills? Subscribe to The Daily Byte: https://bit.ly/3e0HC53
    48
  29. Failure is part of the process! Learn from your failures and they'll help you succeed!
    46
  30. ERATOSTHENES WAS THE MAN
    46
  31. DO WE WANT COURTNEY BACK FOR OTHER VIDEOS?!!?! BE HONEST. IF YES, WHAT TOPIC SHOULD WE COVER NEXT?
    39
  32. There's always a tradeoff...recursive solutions are great because it oftentimes allows a complex problem to be broken down and solved rather simply (in terms of short, readable code). The downside of recursion is that it can use a lot of memory due to the recursive calls on the stack and therefore might overflow for certain inputs. It's a idea good to mention the pros and cons of using recursion during your interviews :)
    37
  33. As per usual, I forgot to mention time complexity...in my opinion, the time complexity would be O(nmlogm) where n is the max number of words we can receive in "strs" and m is the largest size a word in "strs" can be. Let me know what you guys think!
    36
  34. What kinds of videos can I make to help you guys?
    34
  35. thank you!
    33
  36. Nah don't worry I'm not some sort of genie lol I try to make sure I understand the problem and can solve it well before making a video on it. I never want to be teaching something I don't understand :)
    32
  37. it's coming Ben get ready
    32
  38. Haha don't be Pat!!! These questions are really hard and I definitely struggle with these too (especially when I first started). Just keep practicing and it will keep getting easier!
    31
  39. Make sure you guys know how to solve "Given the string 'Kevin' do something really annoying and totally unnecessary" big question being asked at Google right now...again REALLY big question FAANG interview prep: https://thedailybyte.dev/ instagram: instagram.com/kevinnaughtonjr/ twitter: twitter.com/kevinnaughtonjr
    31
  40. ALMOST AT 10K YOU GUYS ARE THE BEST
    30
  41. Gotta stay in shape during the quarantine
    30
  42. congrats on 1 year clean Dorian massive accomplishment keep it up man
    29
  43. Richard Robinson it makes me feel alive having the flame so close
    29
  44. NOOOO THE VIDEO IS 5 MINUTES AND 1 SECOND LONG. I WAS SO CLOSE. NOW THIS VIDEO IS JUST CLICKBAIT.
    28
  45. Doing mock interviews with the first people who sign up for the annual tier using the link below! https://bit.ly/2DzsBd5
    27
  46. "be the world's worst criminal" that had my dying great vid Steve 😂
    27
  47. Forgot to add a break statement if you find the time you generated to not be valid (i.e. there's no point in checking the rest of the digits if you have already found one that invalidates the current time) so if you guys want to marginally speed up your algorithm go for it. Or if you wanna roast me for forgetting that's cool too I guess your choice
    27
  48. i recorded this video in the fall when i was promoted to L4 but the video wasn't ready to upload until recently. to me, i feel proud of my promotion :)
    27
  49. You unlock big head abilities after solving 100+ LeetCode questions :)
    26
  50. i guess you'll never know, huh J?
    26
  51. If you found this video helpful be sure to check out the interviewing service I made! https://thedailybyte.dev/?ref=kevin
    25
  52. Nice on Garen! For anyone reading this the idea in the solution above is you can leverage the fact that the array is already sorted...so if you start one pointer at the first element and another pointer at the last element and add their values you can adjust the pointers accordingly. I.e. if their sum is too big you can decrement the right pointer and if their sum is too small you can increment the left pointer!
    24
  53. Man. Talk about making my night...I wish I could express how happy I am for you but it's tough to do through a message. I'm happy that all your hard work and preparation paid off and you deserve that internship at Facebook, congrats! The whole reason I made this channel is because I struggled with my preparation and never wanted anyone else to. I'm so happy to hear that you feel my channel made a difference. Best of luck this summer I'd love to hear how it goes! I hope this is the first of many of these kinds of messages...all I want to do is help!
    23
  54. i have the best (girl)friends
    23
  55. such an awesome video with really great advice Steve! i loved the comparison to poker and the reminder that interviewing is a numbers game. interview enough times and you're bound to succeed :)
    22
  56. 11 DAYS TILL GAME OF THRONES IF YOU DON'T WATCH EITHER START OR LOSE MY NUMBER
    22
  57. HOW CUTE IS MAMBO instagram: https://www.instagram.com/kevinnaughtonjr/ twitter: https://twitter.com/kevinnaughtonjr patreon: https://www.patreon.com/KevinNaughtonJr merch: https://teespring.com/stores/kevin-naughton-jrs-store
    21
  58. am i insane or do other people also feel like this?
    21
  59. thanks and glad someone else resonates w this too! best of luck to you too! :)
    21
  60. Hey Anthony, good question! I definitely found it confusing at first, but the way I like to think about it is there's no decoding necessary to decode a string of length 0...so the 1 way to decode it is doing nothing (i.e. the decoding of an empty string is an empty string). Hopefully that makes at least a little bit of sense? Otherwise for dp[0] = 1 in this problem and others I think about how the power set in math contains the empy set (sorry to bring in math). Not sure if they're great parallels but that's what my mind thinks of anyways. If anyone else has better explanations I'd love to hear them. I hope that helps Anthony!
    21
  61. LETS MAKE IT HAPPEN
    21
  62. Thanks Samson. Yeah when I think about this base case too much it starts to make my head hurt lol. The way I try to think about it / rationalize it (which may be incorrect) is that if there are no stairs the one way to climb no stairs is doing nothing. I kinda like to think about it like the power set of a set in math. The empty set counts as a set even though it's empty. I hope that makes some sense? If not please lmk and I'll try to find a better way to explain it :)
    21
  63. Yep you're totally right and yeah I think technically what you mentioned about the upper bound being nlogn is correct as well!
    20
  64. What question should I cover next?
    20
  65. IF YOU'VE WATCHED MY CHANNEL SINCE THE CLIP AT 6:43 I LOVE YOU
    20
  66. IS IT JUST ME OR DO I LITERALLY LOOK LIKE A GIANT SITTING AT THIS DESK??? instagram: https://www.instagram.com/kevinnaughtonjr/ twitter: https://twitter.com/kevinnaughtonjr merch: https://teespring.com/stores/kevin-naughton-jrs-store patreon: https://www.patreon.com/KevinNaughtonJr
    20
  67. If there's anything I can do to help you guys be sure to leave a comment and let me know!
    19
  68. 6 reasons*
    19
  69. I definitely agree that a lot of these things aren't stuff we do day to day but I think struggling with the problems and thinking about them for yourself before looking at solutions is crucial to tackling these problems
    19
  70. if my teachers are reading this it's not true if anyone else is it's true
    18
  71. 2:01: *THROWS ROTTEN ORANGE* if you guys need help with interview prep be sure to check out my tiers on Patreon prices are going to be going up soon due to demand and my limited time to give mock interviews etc. patreon: https://www.patreon.com/KevinNaughtonJr instagram: https://www.instagram.com/kevinnaughtonjr/ twitter: https://twitter.com/kevinnaughtonjr
    18
  72. Just gotta keep practicing that's all it is. Start with easy questions and honestly attempt them. Take 30 minutes and try to solve the question on your own without looking at other resources for help. Eventually, easy problem won't be that hard anymore and you can move onto harder problems and do the same thing. Also when you do have to look at a solution, make sure you understand it before moving on the next question, ideally, every question you attempt or review you'll learn something from to apply to other problems. Hope these tips are helpful!
    18
  73. Any advice on how to make these videos better / more helpful?
    18
  74. Hey Balbina! I'd say yes, most of the questions I received would probably qualify as LeetCode medium/hard difficulty (but remember, what is medium or hard is all relative/subjective). All the engineers were very nice and professional I did however, feel that some engineers were more willing to help me / guide me than others. Perhaps this is on purpose? Otherwise it could have just been certain engineer's interview styles or personalities. If you have any other questions or would like to know more I'd be happy to help you out however I can!
    18
  75. Great vid Cole, totally agree working out is all about the mental benefits
    18
  76. Nice!
    17
  77. Thanks! It's a little tricky with this one because different keys have a different number of letters that it maps to (for example, 2 maps to 3 letters, a, b, and c, and 9 maps to 4, w, x, y, and z) but I believe it's ~3^n where n is the number of letters we're given. You can think of it like this...for every letter we have to make ~3 recursive calls, 1 for each letter that the current number maps to. I hope this explanation makes sense!
    17
  78. If there's anything I can do to help you guys leave a comment below and lmk!
    17
  79. Hey Nader thanks for the additional info! The only reason why I opted to utilize the matrix we're given is to optimize our memory usage :)
    17
  80. Thank you! I'll try to but just remember that the classifications of these problems are relative. i.e. what you might think is easy could be hard for me and vice versa!
    16
  81. NO WAY ALAN CONGRATS I'M SO HAPPY FOR YOU!!!!! :)))))
    15
  82. LMK if there's anything I can do to help you guys!
    15
  83. If there's anything I can do to help you guys be sure to leave me a comment and I'll see what I can do!
    15
  84. So so so so SO happy to hear that!
    14
  85. Hey Dom, these questions are hard, don't beat yourself up!!! It's so normal to struggle with these questions and I often do, especially when I first started. I think recognizing possible solutions to these questions definitely comes easier as you practice. Chances are if you solve one question, there's 5 other questions that you'll be able to use the same approach for. Otherwise in general, if I don't have an idea right away, I try to systematically go through data structures and think..."can a stack be useful here...no...ok, can a binary search tree be useful here" etc. I hope this helps!
    14
  86. If there's anything I can do to help you guys let me know in the comments!
    14
  87. FAANG Interview Prep: https://thedailybyte.dev/?ref=kevin
    14
  88. If you guys need any help with interviews leave a comment and let's find a time to connect!
    13
  89. What other problems should I go over?
    13
  90. Haha nah she said "coding"
    13
  91. What topic do you guys want me to talk about next?
    13
  92. I believe the runtime is O(N) where N is the number of nodes in the tree. It helps me to think about it logically instead of in terms of code so maybe that will help you too. For this problem, I think to myself, "what's the worst possible scenario" to which I think the worst possible scenario is that we go through checking all the nodes in the tree but still don't manage to find a path that adds to the desired sum. So with that logic I say it's O(N). Does that make sense?
    13
  93. Awesome optimization and thanks for sharing! I'd heard and read about this interview but I've never actually implemented it, nice work!
    13
  94. everyone needs help sometimes
    13
  95. What problem / topic should I cover next?
    12
  96. TDB: https://thedailybyte.dev/?ref=kevin twitter: https://twitter.com/KevinNaughtonJr insta: https://www.instagram.com/kevinnaughtonjr/
    12
  97. darkvader13 I pretty much always mean to but just forget I'll try to make sure I start always doing it thanks for the advice!
    12
  98. hey John sorry I meant to touch on that and forgot to in the problem. The reason for using the integer array instead of an integer is because integers are passed by value (not reference like an integer array) so therefore it doesn't retain it's value throughout all the recursive calls
    12
  99. I hope to see you guys in the Discord channel! What else could be helpful for you guys? Let me know and I'll try to make it happen!
    12
  100. Subscribe to The Daily Byte: bit.ly/2BaaSaK
    12
  101. BE SURE TO GIVE THE VIDEO A LIKE AND SUBSCRIBE IF YOU THOUGHT IT WAS EGGCELENT instagram: https://www.instagram.com/kevinnaughtonjr/ twitter: https://twitter.com/KevinNaughtonJr
    12
  102. Let me know how I can help you guys!!! Also if there's anything else you guys would want to see on this channel, leave it in the comments!
    12
  103.  @Aripoma  haha just WAIT until my next vid
    12
  104. "The present is the same for everyone; its loss is the same for everyone; and it should be clear that a brief instant is all that is lost. For you can’t lose either the past or the future; how could you lose what you don’t have?" - Marcus Aurelius
    12
  105. Thanks! And yeah, that's what I try to do, I want people to be able to take at most ~10 minutes, watch my video and walk away understanding the problem and hopefully underlying concepts!
    12
  106. Make sure to sign up for The Daily Byte to learn how to pass your coding interviews - https://thedailybyte.dev/?ref=kevin
    12
  107. Hey Girai! I'm happy to hear my channel has been helping you! I'm sorry to hear you're going through a rough patch, but things get better! Use this time to invest in yourself and do things that YOU love to do. Keep your head up and keep working hard and good things will come, I'm sure of it :)
    12
  108. lol whattttt?!?!!
    12
  109. 100k subs it gets released J
    11
  110. thanks really appreciate that and yep, just wanna be helpful!
    11
  111.  @mayankdevnani894  Awesome idea, I'll see what I can do with that :). I will continue these videos don't worry thank YOU for the support!!!
    11
  112. you got this 🤝
    11
  113. also peep the 100k plaque in the background thank you all so much for supporting me and my content i love you all ❤ Socials - https://linktr.ee/kevinnaughtonjr
    11
  114. I like living on the edge
    11
  115. LYFT > UBER FIGHT ME IN THE COMMENTS BELOW instagram: https://www.instagram.com/kevinnaughtonjr/ twitter: https://twitter.com/KevinNaughtonJr patreon: https://www.patreon.com/KevinNaughtonJr merch: https://teespring.com/stores/kevin-naughton-jrs-store
    11
  116. 10% OFF ROOFTOP SLUSHIE: bit.ly/kevinnaughton instagram: https://www.instagram.com/kevinnaughtonjr/ twitter: https://twitter.com/KevinNaughtonJr patreon: http://patreon.com/kevinnaughtonjr merch: https://teespring.com/stores/kevin-naughton-jrs-store
    11
  117. Thank you! Yeah definitely the reverse() with StringBuilder I just doubt the interviewer would want you to use that :)
    11
  118. yes I misspoke, we used a dfs here :)
    10
  119. Sorry for the sniffling...think I might be getting sick 😰
    10
  120. YOU CAN DO IT!!!!
    10
  121. If you need help with anything feel free to shoot me a message on Instagram or scope my Patreon to join the Discord server (links are in the description)!
    10
  122. EVERYTIME I SAY FAANG TAKE A SHOT/FOLLOW ME ON SOCIAL MEDIA instagram: https://www.instagram.com/kevinnaughtonjr/ twitter: https://twitter.com/kevinnaughtonjr patreon: https://www.patreon.com/KevinNaughtonJr merch: https://teespring.com/stores/kevin-naughton-jrs-store
    10
  123. Harshal Patil thanks Harshal I really appreciate that thanks so much for your support!
    10
  124. If you guys need any help leave a comment and let me know!
    10
  125. Anytime and just keep practicing! I couldn't solve any questions when I first started so don't get discouraged, just stick with it and keep working hard!
    10
  126. GO SUBSCRIBE TO NICK AND WATCH HIM MOCK INTERVIEW ME: https://www.youtube.com/watch?v=q4-n4KCqC8k INSTAGRAM: https://www.instagram.com/kevinnaughtonjr/ TWITTER: https://twitter.com/kevinnaughtonjr
    10
  127. Hey Nitish, yeah it can be tricky trying to pick bfs or dfs. Generally speaking when you're trying to find the shortest path from point A to point B you should opt to use BFS (assuming all edge weights are 1) , it'll help ensure that you don't go down any crazy rabbit hole like you can in DFS. So, in retrospect, although the runtimes don't differ in the worst case, it probably would've been best to use BFS in this problem
    10
  128. You can use either but bfs avoids using recursion which I think generally scales better (with dfs if you have a really large tree, you could run into a stack overflow)
    10
  129. instagram: https://www.instagram.com/kevinnaughtonjr/ twitter: https://twitter.com/kevinnaughtonjr
    9
  130. what was your first job like?
    9
  131. WE HAVE TO PLAY AGAIN BUT YOU HAVE TO SOLVE THE PROBLEM NEXT TIME
    9
  132. Awesome question and I meant to address it in the video...what I normally do is say something along the lines of "I don't feel I have enough information right now to accurately answer that question" and sometimes recruiters still push me on it and I'll basically reiterate the same thing in a different way politely. I don't really think it will be looked upon unfavorably (or at least it hasn't been in my experiences) I think you just need to do a good job of explaining why you feel you can't answer that question and you'll be fine! I hope that helps :)
    9
  133. i got 1
    9
  134. You're my BOY Dom
    9
  135. Hey Suhas, I do my best to explain while also keeping the video short and hopefully amusing. I think some people will get bored if I take too long to explain something so i do my best to explain quickly or explain as i go!
    9
  136. I've had a video up every day for the past 10 days???????????
    9
  137. If you guys need any help be sure to leave a comment below and consider joining the Discord channel (link in the description)!
    9
  138. SHE'S THE BEST!!!!
    9
  139. THANKS FOR 3K <3 LET'S KEEP IT GOING
    9
  140. what?????
    9
  141. That's awesome, congrats!!!
    9
  142. SMASH LIKE, SUBSCRIBE, AND LEAVE A COMMENT LETTING ME KNOW WHAT PROBLEM YOU WANT ME TO MAKE A VIDEO ON NEXT instagram: https://www.instagram.com/kevinnaughtonjr/ twitter: https://twitter.com/kevinnaughtonjr
    9
  143. Patreon: https://bit.ly/2Li2kAo - if you guys need help preparing for your interviews check this out! instagram: https://bit.ly/2SM8SLZ twitter: https://bit.ly/3fAcv18
    9
  144. Haha I'm sure the channel will get there soon enough, thanks Mihir!!! :)
    9
  145. Thanks and keep working hard it’ll pay off!
    8
  146. If you guys need help with anything leave a comment and let me know!
    8
  147. Haha thanks Kevin and nice name!!! I bet you're more awesome!!!
    8
  148. DM ME YOUR FAVORITE VEGETABLE ON INSTAGRAM OR LEAVE IT IN THE COMMENTS BELOW 10% OFF ROOFTOP SLUSHIE: https://bit.ly/kevinnaughton instagram: https://www.instagram.com/kevinnaughtonjr/ twitter: https://twitter.com/kevinnaughtonjr patreon: https://www.patreon.com/KevinNaughtonJr merch: https://teespring.com/stores/kevin-naughton-jrs-store
    8
  149. Chicken Dolo lots of practice and thanks :)
    8
  150. Great idea I'll start doing that!
    8
  151. 10% OFF ROOFTOP SLUSHIE: https://bit.ly/kevinnaughton instagram: https://www.instagram.com/kevinnaughtonjr/ twitter: https://twitter.com/kevinnaughtonjr patreon: https://www.patreon.com/KevinNaughtonJr merch: https://teespring.com/stores/kevin-naughton-jrs-store
    8
  152. Zeo Life it helps prevent running into overflow problems for large values of left and right
    8
  153. thanks John and yes nice catch!
    8
  154. sri Vaishnav the beats are essential to interview prep
    8
  155. Agreed Conor, good point. There's no substitute for hard work
    8
  156. Check out my github repo and lmk if that helps! https://github.com/kdn251/interviews feel free to ask me any questions too!
    8
  157. Any questions or optimization idea, leave them in the comments!
    8
  158. yes it can def be overwhelming. my advice would be to follow what you're interested in! if you don't know what you're interested in, try a couple and see what does piques your interest. remember you can always change your mind good luck! :)
    8
  159. Great question! It really depends on parameters you need to pass to the function and what the function needs to remember...for example if it needs to remember or add something to a previous result, you might have to make a helper function that takes an array of number (because the array will be the same for all of the recursive calls since it's passed by reference, not value). LMK if that makes sense, if it doesn't I'm happy to explain further :)
    8
  160. smash like and leave a comment to help ~the algorithm~ instagram: https://www.instagram.com/kevinnaughtonjr twitter: https://twitter.com/kevinnaughtonjr
    8
  161. hahahahah
    8
  162. WE LOVE DOMINOS instagram: https://www.instagram.com/kevinnaughtonjr/ twitter: https://twitter.com/kevinnaughtonjr patreon: https://www.patreon.com/KevinNaughtonJr
    8
  163. That would be some solid click bait
    8
  164. you da man
    8
  165. You too mate
    8
  166. having worked at both startups and large companies now i think the most important things to prioritize (especially early in your career) are receiving good initial training and mentorship. gonna make a video on this soon
    8
  167. What problems do you guys want to see?
    7
  168. You're right but typically with these kinds of problems you normally aren't allowed to use that kind of stuff :)
    7
  169. Yeah I've been meaning to do that thanks for reminding me
    7
  170. Haha thanks man!! Not 100% about the podcast rn but, definitely down, I think we should do something together! Let's discuss!
    7
  171. falling in love w everyone who follows me on twitter: https://twitter.com/KevinNaughtonJr
    7
  172. doing left + (right - left) / 2 helps prevent overflow if you're given really large arrays :)
    7
  173. I hope this doesn't come off the wrong way, but I actually didn't even think of using a stack...and unless I'm not thinking about your suggestion the right way, I think a stack would actually make things more complicated. If we were simply asked to reverse a string then great a stack could work because we just have to push every letter into the stack and then pop everything from the stack into a string, but in our problem here there's the added complexity of needing to determine if a character is a letter. I think this added complexity can cause a bit more of a headache if we were to use a stack. Generally speaking too, I try to keep the videos shorter and what I think to be more "entertaining" I'll oftentimes try to mention the brute force solution but I think giving something that is more optimal might be more helpful for people since during interviews the more efficient the solution you're able to present, the better your chances are at landing the job (including other factors of course).
    7
  174. What’s your biggest regret as a computer science student?

 FAANG Interview Prep - Subscribe to The Daily Byte 
 https://bit.ly/2DzsBd5 

Socials 
Instagram: https://bit.ly/2SM8SLZ 
Twitter: https://bit.ly/3fAcv18 
 Patreon: https://bit.ly/2Li2kAo 
 GitHub Interviews Repo - https://bit.ly/3fwMekq
    7
  175. Check out my Patreon, but I can try and make a vid on it too!
    7
  176. man this made my day Mike, couldn't be happier for you. Best of luck at Apple and lmk how it goes!!!
    7
  177. Hey Anthony! Sorry I always mean to but forget to. The runtime for this solutions would be O(n*m) or O(n^2) depending on if the matrix is n x m or n x n. The space complexity is a bit tougher to calculate because of the recursion but I believe it'd be the same because the worst case would be the entire matrix contains only 1s
    7
  178. Carly works with children and is working to become a clinical psychologist!
    7
  179. My interviewing service: https://thedailybyte.dev/?ref=kevin instagram: http://bit.ly/2SM8SLZ twitter: http://bit.ly/3fAcv18 patreon: http://bit.ly/2Li2kAo merch: http://bit.ly/2WBtyZo
    7
  180. Right hash maps don't maintain insertion order so that's why I have the second loop iterating over the keys looking for all values greater than -1 and less than our current min. Honestly I don't have a particular reason why I don't use a linked hash map here I'd have to learn a little bit more about how they work to make sure they're not incurring too much overhead cost to keep the items in a particular order.
    7
  181. Nice!!! And it can definitely be tough for problems like this...I try to think about it using how many elements you're dealing with and the branch factor. So here it'd be something like x^n where x is the number of choices we have for any state and n is the amount of numbers we're given, I hope that makes sense!
    7
  182. yours is doper everyone go watch: https://www.youtube.com/watch?v=q4-n4KCqC8k
    7
  183. ahhh that's amazing congrats!!! Be sure to send me a message on Chime once you join! :)
    7
  184.  @Garensonic  You should just have to .toLowerCase() or .toUpperCase() every character before incrementing the count of that character in our array
    7
  185. this is so awesome Steve can't wait for this next chapter and congrats on taking the leap super inspiring!! :)
    7
  186. Thank you so much I really appreciate it! Thanks for the suggestions, I'll see what I can do!
    7
  187. why is this channel so good
    7
  188. Hey Sarbjit, thanks for chiming in! I think in the example you gave the max profit would actually be 9 (i.e. buy at 1 sell at 2 for a profit of 1 and then buy again at 2 and sell at 10 for a profit of 8). Also for buying and selling on the same day is allowed as long as you sell before you buy back. I hope that makes sense and if it doesn't lmk and I'd be happy to explain further!
    7
  189.  @bodhure  Hey just ran that test case with my code and it worked still. What about the algorithm do you think is problematic exactly? I'd love to hear your thoughts!
    7
  190. i got you
    7
  191. haha thanks Abhishek
    7
  192. i just can't believe that I'm gonna be the new CEO of Amazon :')
    7
  193. This one is tricky!!! The format of binary search is often pretty simple but small curveballs like this make them tough don't be hard on yourself!
    7
  194. Good question and no. I solve the questions and then make sure I understand it enough to explain it back while I code the solution again
    7
  195. Stay safe guys!!! instagram: https://www.instagram.com/kevinnaughtonjr/ twitter: https://twitter.com/kevinnaughtonjr patreon: https://www.patreon.com/KevinNaughtonJr merch: https://teespring.com/stores/kevin-naughton-jrs-store
    7
  196. Marissa Lanza that’s ok! College is crazy expensive and luckily for our field a degree from a university isn’t really required. If you’re able to maybe get into a boot camp that can be a good option? Otherwise there are tons of free resources online for learning how to code :)
    7
  197. First, I'd make sure you have a solid foundation in general programming, knowing things like function, object oriented programming, etc. Then I would suggest watching lectures. Here's a link to MIT's algorithms lectures: https://www.youtube.com/watch?v=HtSuA80QTyo&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb&index=1. There's other links to helpful material on my interview repository: https://github.com/kdn251/interviews#video-lectures
    7
  198. spirals are FUN instagram: https://www.instagram.com/kevinnaughtonjr/ twitter: https://twitter.com/kevinnaughtonjr
    7
  199. haha thanks Christian I really appreciate that. Lmk if there's anything I can do to try and help you!
    6
  200. I definitely struggled with essentially any question didn't really matter the difficulty
    6
  201. Thank you I really appreciate that! I hope these videos are helpful and if you have any advice on how I can improve / what I can do better please let me know!
    6
  202. thanks Rodrigo and I should have a new mic within the next week or two :)
    6
  203. The idea here is that the array is definitely sorted up to a point (pun not intended) so we can leverage binary search. Does that make sense? If it doesn't please let me know and I can explain further! :)
    6
  204. If you guys need help with anything lmk!
    6
  205. Thank you! Just checked out your channel looks like you're doing some great things keep up the good work!!! Happy to see we're both trying to help people!
    6
  206. niiiice
    6
  207. Amy, you're kidding!!!! That's incredible, I'm so so so happy for you congrats!!!! Thank you so much for your support and best of luck in your next opportunity! Which one are you going to take?!?!
    6
  208. Still trying to finalize a schedule but I'm most likely going to be trying to do 2-3 videos a week, 2 which are solving LeetCode questions and 1 that is more talking about interviews / engineering in general!
    6
  209. That's definitely a good idea! I think during interviews it's a good idea to offer multiple possible solutions and choose one after discussing that particular solutions benefits! Great question!
    6
  210. Nah I just went for a general solution. I feel like typically during interviews that kind of constraint isn't usually enforced from the beginning of the problem but normally put into place after you've come up with some sort of solution to see if you can further optimize
    6
  211. Jack Wu OMG IT IS
    6
  212. that's not a valid input because the string we're given must be balanced
    6
  213. We are giving away AnkerWork Speaker/Webcam series, and you stand a chance to win these awesome products. HOW TO ENTER GIVEAWAY ⬇ 1. Subscribe! 2. Like this video! 3. Comment why you want to win! Socials Twitter: https://twitter.com/KevinNaughtonJr Instagram: https://www.instagram.com/kevinnaughtonjr Patreon: https://www.patreon.com/kevinnaughtonjr
    6
  214. Of course! My advice would be... 1. stay calm! These questions can't be THAT hard if they're just a coding assessment so try to remember that when you're going through them! 2. Read up on the most asked questions on LeetCode before taking it (hopefully you've been doing this :P) 3. don't sweat it. What i mean by this is if it doesn't work out it's ok! There's tons of other incredible companies out there and you can always reapply. Remembering this tends to help me out. I hope these help and I'd love to hear how it goes tomorrow! Best of luck, you've got this!
    6
  215. I use java personally but just cuz that’s what I’m used to. I recommend using what you’re comfortable with or python cuz it’s so concise and has very little syntax
    6
  216. arup chakraborty yes you’re totally right that would be a better more extensible approach thanks for sharing :)
    6
  217. Hey! Anytime I'm so happy to hear that you're enjoying the videos. You're totally right it's very possible that could be how insert works under the hood. With a normal string I would guess that would be the case with StringBuilder I would hope it'd be more efficient / smart but it might not be. If it does degrade the runtime it'd prob be best to build the string backwards and then reverse it at the end, what do you think?
    6
  218. Hahah that's a great idea!!!
    6
  219. i've heard that microsoft has great work life balance but i can't say it does from personally experience. luckily, i have great work life balance at my job
    6
  220. Pedro Silva anytime and good stuff that's an awesome optimization!!! And good idea I'll see what I can do about mentioning potential improvements during vids :)
    6
  221. That's awesome Drew super happy to hear that good stuff!!!!
    6
  222. Accidentally put two spaces in the first return statement OooOooof instagram: https://www.instagram.com/kevinnaughtonjr/ twitter: https://twitter.com/kevinnaughtonjr
    6
  223. I’m safe don’t worry just had to get out of NYC with all the craziness going on thanks for asking hoping you’re safe too!
    6
  224. Haha thanks and I wish I could!
    6
  225. Thanks Kuppuraj I'm happy to hear my explanations are helpful :)
    6
  226. You’re not the only one hahaha watching this back it looks so close but in reality it’s not bad
    6
  227. I guess it depends on the kind of stack the company uses, but generally I think companies just wanna see that you're working on your own passion projects and that you're passionate about programming
    6
  228. Thanks so much I really appreciate that and thanks for always supporting me and my channel!
    6
  229. The logic should be the same regardless of the language!
    6
  230. thanks for supporting the channel! I'll put this on the list I love this idea thank you! If you have other vids ideas please feel free to comment them as well :)
    6
  231. Good point and yes I did I have multiple offers in hand
    6
  232. Not necessarily...the reversed number could still produce an overflow when it's reversed. For example think about a number that has the maximum number of digits an integer can have and it's within the int data type limit. Once it's reversed it's possible that it creates a larger number. It's the same idea that when you reverse a number like 36 you get a larger number (63). Does that make sense? If it doesn't please lmk and I can explain further :) thanks for watching!
    6
  233. What LeetCode interview question should I cover next?
    6
  234. good to know i'm not alone and i'm sure we'll both figure it out :)
    6
  235. I won't!!! And even if I did for some reason my goal would still be the same as it's always been...to help people so if that's with interviews, engineering advice, etc. it doesn't matter I'll still always be here to help with it :)
    6
  236. pls like and subscribe to make me feel good Socials - https://linktr.ee/kevinnaughtonjr
    6
  237. omg pls no
    6
  238. thank YOU for watching!
    6
  239. I've solved these problems before so I expect the code to pass. Yeah I forgot time complexity again :( it would be O(nmlogm) in my opinion where n is the total number of words we're given and m is the max size a word can be
    6
  240. Nishad thanks Nishad I really appreciate that! My #1 goal is always to help people so as long as I’m able to do that I’m happy :)
    6
  241. Sorry I always forget to mention it...I believe time complexity would be O(nlogm) where n is the length of the string and m is the number of distinct characters in the string. I think memory complexity would be O(m) where m is again the number of distinct characters in the string
    6
  242. Thanks so much Marina and best of luck on your phone screen! Let me know how it goes! A couple last minute tips if you’re interested... 1. Don’t do anything until you understand the problem entirely! 2. Ask clarifying questions - companies want to see you think before you code and think about edge cases! 3. Once you finish writing you code don’t assume it’s right! Run a couple test cases on it if possible as well as talk through the logic of your code line by line out loud (it’s like proof reading an essay, if there’s a mistake chances are you’ll catch it while reading out loud) 4. Be confident you can do this!!!!
    6
  243. instagram: https://www.instagram.com/kevinnaughtonjr/ twitter: https://twitter.com/kevinnaughtonjr patreon: https://www.patreon.com/KevinNaughtonJr merch: https://teespring.com/stores/kevin-naughton-jrs-store
    6
  244. vidzpk anytime happy to hear it was helpful :)
    6
  245. TDB: https://thedailybyte.dev/?ref=kevin twitter: https://twitter.com/KevinNaughtonJr insta: https://www.instagram.com/kevinnaughtonjr/
    6
  246. I've got it on my list :)
    6
  247. Nah no worries Neal happy to answer your questions I've gotten to final rounds of several "big N" companies but haven't received a full time offer quite yet but that's why I made this channel so that you guys can all get the offers and not be like me :)
    6
  248. Thank you so much that means so much to me I really appreciate it! Stick with it it'll pay off in the end!!!
    5
  249. thanks so much Pooja! :)
    5
  250. Hey Afzal, I think the biggest thing I'd suggest (besides just practicing) is to try and get good at recognizing what ds / algos are useful for what problems...understand when a hash map, stack, heap, etc is useful in certain situations and why! Let me know if you have any other questions or if there's anything I can do to help you!
    5
  251. Definitely! And don't worry these questions are hard! I would check out cracking the coding interview and elements of programming.
    5
  252. That's a possibility too nice idea! Generally speaking, I think it's better to knock the runtime down at the cost of using extra space (space nowadays is pretty abundant), but maybe it's a good idea to clarify with your interviewer whether or not you can use extra space.
    5
  253. Ashraf patel thanks for the suggestion Ashaf! Maybe I'll make a video like that soon :)
    5
  254. Nikhil Mathur haha no way that’s amazing I’ll put it on my list
    5
  255.  @JaspreetSingh-bh5hc  Hey Jaspreet if you want to check out my newest video it's a graph problem: https://www.youtube.com/watch?v=4LvYp_d6Ydg (dfs)! Otherwise when a matrix is involved it usually has to do with graph or when you're asked is one thing reachable from a certain point, or you're asked to find a path or paths in a problem. I hope this helps!
    5
  256. Thanks so much Saurabh I'm so happy to hear that! Lmk when you hear back I've got my fingers crossed for you!!!
    5
  257. Hey Dhruv, yeah some of my older videos I hadn't totally figured out my mic problems, but all my more recent videos have louder audio now
    5
  258. You're my BOY Dom
    5
  259. Hey Pawel I'm so happy to hear that. Thank you so much for the kind words they mean the world to me!!!
    5
  260. ellisa khoja I'll put it on my list thanks for the suggestion!!
    5
  261. i think the hiring process will continue to evolve at a slow rate on it's own so i don't think chatgpt will affect it really. i think AI tools will help devs do their jobs more efficiently
    5
  262. Hey Flo thanks for the advice. From my experience interviewing, naming data structures their name is actually pretty common and I've never had an interviewer complain about that. Typically I use their names because otherwise, it can become pretty confusing throughout the rest of the code (it's nice to know that your stack will always be stack, map will always be map, etc. etc.). I'm still working on my explanations, but honestly, I don't want things to be scripted. I want people to see what it's like truly explaining things on the fly (sometimes even messing up) because that's what it'll be like during real interviews! I'm still working on my production quality and editing so I'll be sure to keep that stuff in mind for future videos, thanks again!
    5
  263. The Daily Byte: https://thedailybyte.dev/?ref=kevin Twitter: https://twitter.com/KevinNaughtonJr Instagram: https://www.instagram.com/kevinnaughtonjr/
    5
  264.  @evanxg852000  I just ran all the test cases and my code works and passes all of them. I also ran your test case and it passes as well. In your code you're only making one transaction but the problem description says that we can complete as many transactions as we'd like. I think you're thinking about a slightly different problem where we can make at most one transaction.
    5
  265. Hey George, anytime! Another great question, I've had this happen to me before as well. In these scenarios (where recruiters literally refuse to move forward unless I answer) I again first deflect the question once, twice, if necessary, and then eventually say something like "what do people normally say" and go with that answer. If I'm not happy with the number, I tend to just use that interview as practice for other interviews (in my experience this has never happened at company that I've been super interested in so it's worked out), otherwise, if it's a number I'm happy with I go through the rest of the interview process as usual and then still negotiate at the end. I hope this helps!
    5
  266. Sometimes you just get lucky! Also, I feel like this question is probably rarely asked if ever
    5
  267. I HOPE EVERY SYSTEM DESIGN INTERVIEW YOU HAVE NOW YOU JUST THINK OF SQUIDWARD DABBING instagram: https://www.instagram.com/kevinnaughtonjr/ twitter: https://twitter.com/kevinnaughtonjr
    5
  268. thank YOU! Hearing responses like this is exactly what makes me want to make more of these videos!!! Also, don't worry about 1 line solutions on LeetCode I would never opt for solutions like that because 99% of the time they're either not readable or they're solving the question in a way that you're not supposed to. If there's anything else I can do to help lmk!
    5
  269. Madiyar Kaskabayev you got it! I’ll try to do more dp problems thanks for the input!
    5
  270. if i can do it you can do it! just work hard and it'll work out. best of luck! :)
    5
  271. YEEEE WE BACK
    5
  272. haha easy is relative!!! Thanks :)
    5
  273. Haha you're the best Dom as always thank you so so much for your support
    5
  274. Aside from the companies you mentioned I can't say I've been asked DP problems explicitly, but you never know so I think it's best to prepare for them. Furthermore, chances are if you can do the dp problems you can do any other problems so it's always good to study the hard stuff :)
    5
  275. Thanks! Yeah I think this problem is a little tricky
    5
  276. Huge milestone congrats Clement!!!
    5
  277. What's your favorite productivity tool? FAANG interview prep -https://thedailybyte.dev/?ref=kevin Try Notion: https://bit.ly/kevinjrnotion Try Git: https://git-scm.com/ Try Vim: https://www.vim.org/ Try Screen: https://screen.so/ Try Flux: https://justgetflux.com/ Socials Instagram: https://bit.ly/2SM8SLZ Twitter: https://bit.ly/3fAcv18 Patreon: https://bit.ly/2Li2kAo GitHub Interviews Repo - https://bit.ly/3fwMekq
    5
  278. I'll add it to my list
    5
  279. Sathesh Balakrishnan Manohar hey! Good question...in my head this is taking the x values and multiplying them by themselves (to ensure they're positive) and then adding the y values multiplied by themselves (again to ensure they're positive) then we are comparing this result to the same arithmetic performed on the other point which is effectively determining which point is further from the origin. Does that make sense?
    5
  280. Good stuff!
    5
  281. Talked to Praneeth earlier today, if you guys wanna chat let me know!
    5
  282. SECOND
    5
  283. You're my BOY Dom this is hilarious I'm laughing so hard rn
    5
  284. instagram: https://www.instagram.com/kevinnaughtonjr/ twitter: https://www.instagram.com/kevinnaughtonjr/
    5
  285. niiiiiiiice
    5
  286. STYLE POINTS NICK
    5
  287. This is amazing.
    5
  288. the daily byte (redesigned) 🔥🔥🔥: https://thedailybyte.dev/?ref=kevin twitter: https://twitter.com/KevinNaughtonJr instagram: https://www.instagram.com/kevinnaughtonjr/
    5
  289. i love you all and thanks for watching :') <3 - https://twitter.com/KevinNaughtonJr
    5
  290. What kinds of problems / topics do you guys want me to cover next?
    5
  291. Thanks so much Dom I really appreciate the support! Yes absolutely I actually made a Discord channel for this exact reason. This way I can respond to people quickly and efficiently. Also, it's nice to have everyone in one chat so that we can all help each other but everyone is welcome (and encouraged) to PM me as well! I also offer other tiers for further help like study plans and mock interviews if that's of interest to you. Either way here's the link to join I hope to see you in the Discord server! https://www.patreon.com/KevinNaughtonJr
    5
  292. Thanks so much! I do but I don't feel that it's my place to share honestly. What I can tell you is that several people have reached out to me telling me they have received offers from placing like Facebook and that my channel has helped them which is awesome to hear!
    5
  293. Thanks Atif and nice! Yeah these problems can be tricky without converting it back to a string but % is normally a good way to avoid having to do that!
    5
  294. Monday, Wednesday is LeetCode, Friday is more general videos :)
    5
  295. quitting vim is impossible 😂
    5
  296.  @crazychase443  thanks so much! i appreciate the kind words and i'm happy you found the video helpful :)
    5
  297. Kevin Murimi looking forward to that coffee :) best of luck!!! If you want additional help preparing check out my Patreon page https://www.patreon.com/KevinNaughtonJr
    5
  298. Idk how I never responded to this, my bad!!! Thanks so so much for the kind words they mean a lot to me. So happy to hear my videos are helping :)
    5
  299. Haha thanks Ayeman hope you enjoyed the video!
    5
  300. 50% off sale on The Daily Byte annual plan until the end of tomorrow make sure to sign up to learn how to pass your coding interviews - https://thedailybyte.dev/?ref=kevin Once you get offers be sure to check out levels.fyi to know your worth and negotiate for more money - https://www.levels.fyi/services/?ref=Kevin%20Naughton Twitter - https://twitter.com/kevinnaughtonjr Instagram - https://www.instagram.com/kevinnaughtonjr/
    5
  301. Thanks Austin! I tried a few different sites and books but I found LeetCode to be the most helpful. After doing a handful of interviews too I realized that LeetCode is very accurate in terms of the questions you can expect to receive.
    5
  302. yep you're right, nice!
    5
  303. thanks so much Srejon! glad you enjoyed it :)
    4
  304. Thanks Pawel it's good to be back!!! haha I'm happy to hear that thanks for the support!
    4
  305.  @phanichoragudi57  No way! Def a good one to know then!
    4
  306. Safi Muktadar Abdul something in is coming just gotta work hard and believe it!!!
    4
  307. You've got it and thanks Shubham I appreciate it!!!
    4
  308. Mohammed Nadeem thanks so much Mohammed I really appreciate your support!!!
    4
  309. Anytime Shilpa! What's the problem number? I'll add it to my list :)
    4
  310. WE BACK
    4
  311. Dovahkiin anytime!
    4
  312. If the kth character in the ith word is less than the kth character in the jth word then we know those two words are in lexicographical order so we can stop there
    4
  313. follow me to make me feel good pls: https://linktr.ee/kevinnaughtonjr
    4
  314. Haha thanks Irfan and yeah Carly's the best a definite hire :)
    4
  315. Thanks AJ :) good point, nice optimization!
    4
  316. Thanks really appreciate that!
    4
  317.  @jlecampana  The worst kind of exception lol
    4
  318.  @ninjadotdev  Anytime Mohammad I hope you enjoyed the video and thank you so much for the kind words! That's an awesome idea I'd be happy to make a video on that. A few quick tips I would give are....1) have a schedule. If you have a schedule and treat it as such you'll be able to get things / work done. 2) I think sometimes the hardest thing to do is start something and when you don't want to start countdown from 3 and once you get to 0 just force yourself to start whatever it was you said you were going to do. 3) Separate work from other things. i.e. when you work, work hard and focus and when you're not working, don't think about it. In college this was a big thing for me...if I chose to focus for an hour straight most of the time I could get done what I normally would in several hours when I would get distracted, talk to people, check my phone etc. I hope these help!
    4
  319. Ankit Mishra so happy to hear that Ankit thanks!!! I'm happy the video was helpful :)
    4
  320. primitives (like ints) are passed by value and not reference integer arrays are passed by reference and that's what we need to be able to properly update the value throughout our recursive calls
    4
  321. thanks for watching Ajay 😃
    4
  322. Thanks Dom! I do my best to keep the videos short, entertaining, and comical (if possible) :)
    4
  323. Kousthubha Kumar thanks and nice! If you need help with these kinds of questions check out the interviewing service I released (I recommend joining the annual tier) https://thedailybyte.dev?ref=kevin
    4
  324. Thanks and she's about to start her PsyD in school and community psychology and she's gonna start working in a clinic for children on the spectrum!
    4
  325. some companies ask system design questions regardless of experience and others wait until you have a certain number of years of experience normally to ask them. I've interviewed at both types of companies
    4
  326. so simple and so true, if you spend enough time you'll eventually solve the problem at hand
    4
  327. I would suggest starting to learn about (and maybe even code) data structures like linked lists, trees, stacks, and queues! Learn their properties, how they work, their runtimes, etc. Once you feel comfortable with some of those, then maybe move towards algorithms. If you need any help, let me know!
    4
  328. Hey Soundarya, yeah let's do it! Shoot me an email and let's find a time to talk! kdn251@nyu.edu
    4
  329. Hey Atif, it just takes practice! Also it's important to note that during interviews it's ok to start with a slower solution if you have to and then optimize. A good interviewer will help you and give you hint if you're stuck. Otherwise, it just comes from experience and practicing problems. Let me know if there's anything I can do to help you and thanks for your support!
    4
  330. classic two month break Instagram: https://www.instagram.com/kevinnaughtonjr Twitter: https://twitter.com/KevinNaughtonJr Patreon: https://www.patreon.com/kevinnaughtonjr
    4
  331. Thanks Steven really happy you're enjoying the content! I know it's hard to, but try to brush it off I've been through a lot of rejections and "failed" interviews but it always works out for the best! I wouldn't be surprised if in a couple months you're working at Facebook, Google, or some other awesome company and think about how you're actually happy you ended up failing that Amazon interview :). Absolutely, there's some stat actually that around ~60% of Googlers get in at their 2nd onsite interview. Thank you so much for your support and kind words and please lmk if there's anything I can do to help you prepare for your other interviews!
    4
  332. divyatejaswini vengada thanks and the sound should be better in more recent vids :)
    4
  333. Haha sorry Alp (I knew I'd get roasted)
    4
  334. Hey Pawel, I've never heard of anyone having problems opting to use Python for interviews. I think Google and other companies generally have the view that if you know one language you can pick up another one pretty easily, so they don't tend to worry if you don't know a particular one. I would actually recommend it just because it's so concise, which helps when you do your whiteboarding interviews!
    4
  335. Hey don't beat yourself up, these questions are tough! I feel like our interview process is especially hard compared to a lot of other professions. If I'm understanding you correctly, there's no way you could've worked at Facebook and other top companies if you're not a good engineer! You might just have imposter syndrome (I definitely do). These questions are all practice, try to do a couple a day and spend time really thinking about them without looking at the solution. If you have any questions or need help I'd be happy to talk with you!
    4
  336. You can pass Collections.reverseOrder() to the constructor or pass a custom comparator
    4
  337. a good logo :)
    4
  338. These problems are tough don't beat yourself up just keep at it!
    4
  339. find what topic/part of software engineering interests you and start building. literally just google things that you're interested in ("how to build a website with python"). most people fail in my opinion because they get paralysis. there's no "best" place to start, just start. i think web dev is worth pursuing if it interests you. the "best" field imo is again the one you enjoy the most/find the most interesting
    4
  340. RIP MF Doom
    4
  341. You don't know that!!! We'll see what they say!!!
    4
  342. Awesome idea but I actually have started putting a link to the problem in the description :)
    4
  343. Akash Rajpurohit that's awesome Akash and anytime I'm happy to hear my vids have been helpful! Good luck with the interview tomorrow and let me know how it goes!!!
    4
  344. No way that's amazing anytime :)
    4
  345. instagram: https://www.instagram.com/kevinnaughtonjr/ twitter: https://twitter.com/kevinnaughtonjr
    4
  346. currently laying in my hotel room in my pajamas 😂
    4
  347. hahah great song...I hope you found the video helpful Jeremy!
    4
  348. Yeah sorry I'm working on it, I think I might need to order a new mic :(
    4
  349. you're right i don't really need it
    4
  350. Swagato Chatterjee I think I’ve watch every episode of spongebob about 7 times and I’m very proud of it
    4
  351. Monali Mhetre hey! Typical no (unless your solution isn’t very optimal to begin with) but if you have extra time after you’ve solved the problem it’s not uncommon for them to ask you to try and do it faster/without extra memory/etc
    4
  352. Thank you! I just tried your suggestion with changing dp[0] = 0 and it fails :(. Same with initializing dp[0] = 0, dp[1] = 1, and dp[2] = 2 and then starting the loop at 3. I know it seems confusing but I still believe it makes sense. Dp always makes my head hurt lol
    4
  353. Yeah it's insaneeeeeeee
    4
  354. Jaspreet S depends on the question in my opinion. If you need help with questions be sure to sign up for the interviewing service I created it’ll teach you how to solve all kinds of problems like this https://thedailybyte.dev/?ref=kevin I recommend joining the premium tier if you can
    4
  355. Anytime! I've been thinking about doing a doing a tutorial on DP for a while now, I'll see what I can do :)
    4
  356. Hey Anurag! Personally, I don't mind the if-else chaining here but you're totally right a switch statement might help readability here!
    4
  357. Hey Frank I know what you mean...there are so many problems and it can def be overwhelming at times. Like you said I don't really suggest memorizing, but I would suggest (similar to what you're saying about understanding a bank of questions) understanding / knowing certain algorithms / techniques that you can apply to a handful of problems. I hope this helps and lmk if you have any other questions and as always thanks for your support!
    4
  358. thank you i really appreciate the kind words and your support!!
    4
  359.  @atift5465  I could be wrong who knows
    4
  360. No way that's awesome Nishad! Best of luck I've got my fingers crossed for you too :) lmk what happens!
    4
  361. haha thanks and agreed hard work always pays off
    4
  362. Yep I got there at the end :)
    4
  363. Tmux is the best
    4
  364. Yooooo Daniel you just made my day dude :') I really appreciate you and everyone else who takes the time and leave a comment letting me know you appreciate the content I provide. I'm super happy to hear that you landed a job you love last year and I'm sure you're about to land another great gig I have venmo/paypal if you feel more comfortable sending money there! You can also sign up for Patreon and then cancel immediately and this way you get charged once and only once. This is my Patreon if you're interested in signing up and canceling https://www.patreon.com/KevinNaughtonJr, but if you want my venmo/paypal just lmk. Either way whatever you decide I appreciate you even considering donating and helping me out it means a lot to me!
    4
  365. thanks and hopefully I'll be making system design videos soon :)
    4
  366. hb nguyen expect more of them!
    4
  367. You're my BOY Dom
    4
  368. Thanks Cesar! I think it depends on each company's policy of how they do promotions. A lot of companies I've worked at have only promoted someone is they're already doing next-level work. Meaning that if you get promoted you theoretically just need to keep performing at the same level you have been
    4
  369. Yep which in the worst case all strings are the same length :)
    4
  370. hahahahhaa
    4
  371. uber it is then i guess???
    4
  372. when i think too much about how computers work it hurts my head, great work!
    4
  373. Thanks Karthik! That's a great idea I'll try to start making playlists based on topics as well thanks for the great suggestion!
    4
  374. I actually use Firefox now :O
    4
  375. I just knew the fundamentals enough to get by but didn’t really internalize them which I should have
    4
  376. that will have to be the next video
    4
  377. haha thanks Atif! It's so important (in my opinion) to do your own work and apply what you learn outside of your classes. Totally agree too that if you want to land a job you need to go the extra mile the degree isn't enough!
    4
  378. Viktor Karpov haha maybe I’ll do that for next vid
    4
  379. Thanks Pavan and don't worry I won't the whole purpose of my channel is to help people so I'm super happy to hear it's doing that! I'll make sure to put that problem on my list :)
    4
  380.  @pallavipandey796  I'm sorry to hear that Pallavi but just keep working hard and something better will come along! Thanks so much!!!
    4
  381. The lofi is essential
    4
  382. great vid Steve! i'm still trying to find the balance between saving money and enjoying it. also super excited for your launch!!!
    4
  383. Hey, I didn't and it's pretty normal for these companies to not provide feedback unfortunately, but it's ok! And I don't think so honestly, they just set extremely high hiring bars because they'd rather pass on a good engineer as opposed to accidentally hire a bad one
    4
  384.  @atift5465  Anytime Atif I'm glad you enjoyed the video!!!
    4
  385. Dean careful because dfs still uses extra space because of the recursive calls on the stack!
    4
  386. Third🥉
    4
  387. that's awesome and ty!
    4
  388. Good looks J
    4
  389. instagram: https://www.instagram.com/kevinnaughtonjr/ twitter: https://twitter.com/kevinnaughtonjr patreon: https://www.patreon.com/KevinNaughtonJr merch: https://teespring.com/stores/kevin-naughton-jrs-store
    4
  390. I think you could probably just iterate through the stock prices like we're doing here but try to find the min instead of the max?
    4
  391. Sure! What this solution is doing is actually greedily calculating different possibilities and then taking the minimum of all of them. At every iteration of the loop it assumes that you have picked the red house, green house, or blue house on the previous iteration and therefore takes the minimum of the remaining two houses you can pick from (because you can't pick red twice, green twice, or blue twice). We are overwriting the values in the costs array just so that we don't have to allocate extra memory (all the info is already in that matrix so why not use it). Once the loop finishes all that's left to do is pick the minimum of the costs in the last row in the costs matrix. Hopefully that makes sense?
    4
  392. Chiranjeevi Pippalla Anytime!!!
    4
  393. https://twitter.com/KevinNaughtonJr https://www.instagram.com/kevinnaughtonjr/
    4
  394. I'll look into it yeah I've been told my volume is low newer videos should be better :)
    4
  395. orange you guys glad I did this problem?
    4
  396. haha ty! happy you enjoyed the vid and the technical talk too :)
    4
  397. What coding habits would you recommend someone develop as a software engineer? the daily byte (50% OFF SALE) 🔥🔥🔥: https://thedailybyte.dev/?ref=kevin twitter: https://twitter.com/KevinNaughtonJr instagram: https://www.instagram.com/kevinnaughtonjr/
    4
  398. that's ok just keep practicing :)
    4
  399. Anytime Alan! I'll put course schedule on my list of questions to do, thanks for the suggestion!
    4
  400.  @abdelrahman2348  Good idea! I'll talk to Courtney about it thanks for the suggestion!
    4
  401. Sunil Kumar the prompt says that the numbers will be distinct
    4
  402. Anytime Andrew thanks for the kind words it means a lot to me. I'm super happy the videos have been helpful, that's what I wanted to make them in the first place, to help people :). Ahhh i always mean to mention time complexity but I forget to :( for this I would say it's O(n*m) where n is the max number of rooms and m is the max number of keys any room can have. If there's anything I can do to help you prepare for your interview please let me know (seriously)! If you're interested in joining the Discord channel and discussing further, here's the link to join: https://www.patreon.com/KevinNaughtonJr thanks again for the kind words Andrew!!!
    4
  403. sorry to hear that my condolences to you and your family ♥️
    4
  404. Thank you! And yes I've considered doing naive solutions before improving. In some videos I try to discuss more naive solutions before talking about how once can optimize. Your analysis is correct! We can only really have one candidate since the first loop will check if the candidate knows person i. And, if we've invalidated that candidate in the 2nd loop we simply return -1. Thank you so much for the feedback I really appreciate it!
    4
  405. I'll see what i can do :)
    4
  406. good luck Ethan you've got this! :)
    4
  407. Haha thanks Stanislav, hopefully you also enjoy the stuff between the music as well ;)
    4
  408. Thanks for the kind words Saravanan and yes I totally agree failure can be a good thing it just depends on how you view it and what you choose to do with it!
    4
  409. Yes definitely similar!
    3
  410. the daily byte (50% OFF SALE) 🔥🔥🔥: https://thedailybyte.dev/?ref=kevin twitter: https://twitter.com/KevinNaughtonJr instagram: https://www.instagram.com/kevinnaughtonjr/
    3
  411. Maybe check out problems like how to know if an array is unique, or finding the max / min kind of stuff with arrays. I think that's a good place to start!
    3
  412. hahah ty and thanks for watching!! :)
    3
  413.  @phanichoragudi57  I'll see what I can do thanks for the suggestion!!! :)
    3
  414. Not dumb! I'm assuming you mean [-2,-1,1,2] and it's because the first two (-2, and -1) are moving left (and will never collide with each other) and the other 2 (1 and 2) are moving right (and will never collide with each other). This example of the equivalent of us (representing an asteroid each) putting our backs against each other walking opposite directions i.e. we'll never collide
    3
  415. pretty wild honestly
    3
  416. Hahaha I’ve got a concealed carry ;)
    3
  417. Thanks so much!
    3
  418. I think it depends on what sort of internships you're looking for...for example, making websites and having a portfolio of websites for a web dev internship I think would be super helpful (along with other roles). Otherwise, making a portfolio and building apps is just helpful for you as an engineer and learning and showing companies that you can create things!
    3
  419.  @thekewlwaffle  Anytime!
    3
  420. Hey Ronald! I believe you can actually build a heap in O(N) time where N is the number of elements you are inserting into the heap. The runtime becomes O(NlogN) normally because you remove all the elements from the heap (because the heap has to heapify with every removal). I think in the code I provided the runtime would actually be O(NlogK) because we are restricting the size of the heap to be at most K at any point in time. I hope that makes sense I'd love to hear your thoughts! :)
    3
  421. Nice Garen! Yes this could be solved using bucket sort, radix sort, etc. and the runtime would be O(n) but remember that will only work if there are small number of letters to process i.e. the runtime will degrade at scale :)
    3
  422. wut
    3
  423. Anushree Acharjee hoping to start making them soon!
    3
  424. Fifth?
    3
  425. i'd pick a language/framework that you want to learn and start going through their docs. just start doing something there's no "best" place to start
    3
  426. thanks dawg hold me accountable pls
    3
  427.  @amylee8688  Anytime Amy and thanks for the suggestion I'll throw it on my list :)
    3
  428.  @afzalchishti9092  Anytime Afzal that's all I want to do so I'm happy to hear it's helping!!!
    3
  429. amazing storytelling Cole. This video is making me rethink my entire life
    3
  430. I'll see what I can do!
    3
  431. great video and thumbnail is GOLD
    3
  432. Thanks Deepak and will do :)
    3
  433.  @MehmetSafakAlbayrak  Right which is what my code is doing :)
    3
  434. I'm a simple man :')
    3
  435. We've come a long way since Algorithmic Problem Solving The Daily Byte: https://thedailybyte.dev/?ref=kevin Instagram: https://www.instagram.com/kevinnaughton Twitter: https://twitter.com/KevinNaughtonJr Patreon: https://www.patreon.com/kevinnaughtonjr
    3
  436. Anytime!
    3
  437. thanks!
    3
  438. What happened with your interviews David?!!?
    3
  439. I'll look into it!
    3
  440. I'll add it to my list
    3
  441. Dream Builder that should work too! Might even knock down the space complexity depending on the sorting algorithm used!
    3
  442.  @mohitsaini9148  Anytime! I would suggest just doing their most common questions on LeetCode and otherwise, work WITH the interviewer. A good interviewer will give you hints if you communicate well so make sure you take their hints if they give any! Otherwise, do your best to stay calm and don't start coding until you understand the question entirely (constraints, edge cases, etc). I hope these tips help and if you have any other questions I'd be happy to discuss in the Discord server, best of luck!!!!
    3
  443.  @saloneerege2006  Haha do it!!! This weekend that's your hw :)
    3
  444. Yeah StringBuilder would def help it be that much more efficient :)
    3
  445. Hey Neal! That was actually on a separate submission previous to the video. If I remember correctly it was a small syntax error like forgetting a semicolon
    3
  446. Anytime Saravanan thanks for your support!
    3
  447. That's an awesome idea! Questions that people are seeing during their interviews are discussed in the Discord server but making a video on someone's general experience interviewing would be great!
    3
  448. Hmmm I don't think I understand only storing K elements in your heap will allow you to sort all the numbers? Can you explain a little bit more?
    3
  449. second comment
    3
  450. anytime and yeah Nick is dope
    3
  451. Hey Harsh yeah you're right, I've been trying to be better about that I just forget to sometimes. I'd say this solution's stime complexity is O(N) where N is the number of possible times we can generate and I think the space complexity is constant
    3
  452. Hahahah maybe I should start making my titles more clickbaity thanks Dom as always I appreciate your support buddy
    3
  453. sidhant manchanda  check out my interview repo, it has some a section on data structures and some links to videos that can help https://github.com/kdn251/interviews
    3
  454.  @jlecampana  haha I hope that's what she meant!!!
    3
  455. anytime!
    3
  456. ending "hat" me dying 😂
    3
  457. like and subscribe pls Socials - https://linktr.ee/kevinnaughtonjr
    3
  458. the daily byte (redesigned) 🔥🔥🔥: https://thedailybyte.dev/?ref=kevin twitter: https://twitter.com/KevinNaughtonJr instagram: https://www.instagram.com/kevinnaughtonjr/
    3
  459. that tweet was a joke because i can like every comment and therefore it's impossible to get 0 likes and i'm surprised people didn't get that it was a joke
    3
  460. thanks for the support!
    3
  461. Thanks for the input Neal I'll try to add more videos with those topics. Hmmm it's funny because I've asked myself that before but I guess it's best to do both if possible...otherwise, I think if you choose Facebook from the company tags you'll be able to see questions within a certain time period like questions that have been asked in the last 6 months, 1 year etc if that's helpful?
    3
  462.  @nealpatel7696  I think either one is fine honestly (I think they're pretty similar in terms of questions?). Lmk if you have any other questions :)
    3
  463. niiice
    3
  464. Nocturnal316 thanks so much I really appreciate it! I have a Discord server if you're interested in joining that we can talk there, you can sign up on my Patreon. If not, no worries! My biggest advice is to just stay calm (during interviews) and work hard! Practice doing mock interviews if you can and set up a study schedule to make sure you know all the stuff you need to before your interviews. Best of luck! :)
    3
  465. very appropriate for this vid
    3
  466. weirdly yes, believe it or not my typing speed 2xs when i wear it
    3
  467. haha thanks David it's essential nowadays
    3
  468. thanks! And I use fzf/ctrlp
    3
  469. thanks! And normally I make sure I understand the problem enough to be able to explain it, meaning I've solved the problem previously
    3
  470.  @amylee8688  Amazing!!!! Awesome choice :)
    3
  471. updated the description, thanks for letting me know :)
    3
  472. praveen s thanks Praveen hopefully we'll get there one day!!!
    3
  473.  @nealpatel7696  Yes in all my interviews I give the general time complexity of the algorithm regardless of the language...however, you should understand the language you're choosing to use. What I mean by that is understand how things work under the hood. So in Java is I use the "contains" method I need to understand that that will perform a linear scan of my elements looking for a specific element. My point being that you can degrade your runtime if you don't understand the consequences of using certain functions in your language...so a solution that I thought was O(n) might become O(n * m) because of a function I choose to use. I hope that makes sense, if it doesn't lmk and I can explain more :)
    3
  474. I feel like they're pretty much used interchangeably but after some cursory research it seems like there is a small difference between the two
    3
  475. Haha thanks and yeah I should do that good idea!
    3
  476. CONGRATS I'm so happy for you!!!! I'd love to hear more about the job, maybe we can talk about it in the Discord server and thanks so so much for the Patreon pledge I can't tell you how much I appreciate it. I'm super happy the channel was able to help you Amol :)
    3
  477. Never going back
    3
  478. As always thanks so much Atif! I'd be happy to make another version when I'm in my office. It seems like a lot of people want to see that version as well so I'll see what I can do!
    3
  479. only the semi OGs will remember
    3
  480. no way that's amazing congrats so happy for you!
    3
  481. haha so many people are worried about the candles!!! Feel free to message me on Instagram
    3
  482. Thanks I appreciate it. Hard to say honestly...just because I solved the questions doesn't mean I necessarily passed the interviews if you know what I mean? Also on top of that sometimes there are factors that are out of your control (like I recently heard from a recruiter that during the time I was interviewing with Facebook they had reached their cap on hiring for junior engineers)
    3
  483. yeah i can't stress enough how important fundamentals are
    3
  484. Anytime and in place meaning modifying the original array?
    3
  485. We had soooo much fun, def wanna make more videos with Courtney. Happy holidays to you too Miguel!
    3
  486. Thanks Justin and who knows, maybe you'll win the giveaway!!!
    3
  487. best of luck dude! i'm rooting for you!!! :)
    3
  488.  @jlecampana  The only reason I don't like getting into math is because it's missing the point of the problem (in my opinion). The real meat of this problem is the DFS / backtracking that is being done after the initial "math" check. It's worth noting too that this problem isn't using dynamic programming :)
    3
  489. Thanks Stanislav! The rent just about everywhere in NYC is expensive!
    3
  490. Anytime and thank you! Right now I'm trying to do the most commonly asked questions so it helps the most people (hopefully). I'm happy to try and provide a solution for a question if you have one in mind? Adding comments is a good idea, I'll see what I can do!
    3
  491. Yi Cai you got it Yi :)
    3
  492. Harry Gong lots of practice!!!
    3
  493. NO WAY THATS AMAZING IM SO HAPPY FOR YOU AND IM HAPPY TO HEAR I WAS ABLE TO HELP I LOVE YOU TOO BEST OF LUCK!!!!!
    3
  494. Adrian Rossino in retrospect I totally get what it’s asking but during the video I was so lost haha
    3
  495. Thanks Kevin! Great name btw ;)
    3
  496. Anytime and I’ll add that one to my list
    3
  497. as a multi-billionaire
    3
  498.  @hritikkumar_  thank you! :)
    3
  499. Thanks! Great, idea for a video! Short answer is it really depends on your company / team. My team works in sprints so every 2 weeks we have tickets (tasks) we commit to doing so depending on where we are in the spring we might be finishing tickets, in meetings, or planning for the next sprint. I hope this was helpful!
    3
  500. I’ve got a discord server but it’s an invite only one that you can join through my Patreon
    3
  501. Way better than I explained it lol thanks David!
    3
  502. Thanks Arpit really appreciate that :)
    3
  503. Hahah thanks Atif but don't be fooled I struggle with problems too! I hope we all get those offers soon, just have to keep working hard! I'll see what I can do about a video on OOP / dynamic programming!
    3
  504. If you have to look at the solution, go for it but make sure you gave the problem enough thought (and time) first! If you do look at the solution make sure you don't move on until you understand why it works so you can take that thinking with you to future problems!
    3
  505. So happy you saw the link too thanks for stopping by! Def practice them they're important!
    3
  506. anytime Zaid and thanks I appreciate that!
    3
  507. haha in retrospect the problem description makes sense to me, but during the video I was so lost
    3
  508. twitter: https://twitter.com/KevinNaughtonJr instagram: https://www.instagram.com/kevinnaughtonjr/ the daily byte: https://thedailybyte.dev/?ref=kevin
    3
  509. Gideon Kibet Cheruiyot thanks Gideon I really appreciate it!
    3
  510. Anytime, hope it helped!
    3
  511. Anytime thanks for the support Pawel, I'll be sure to make more videos like this!
    3
  512. Pratik Chowdhury start with the easiest of problems and build from there! These questions are hard so don’t beat yourself up just keep practicing you can do it!!!
    3
  513. Hey Ishita! I think I might know the question you're talking about, but I'm not sure honestly sorry :( if there's anything else I can do to help or if you have any other questions lmk and I'd be happy to try and help :)
    3
  514. chinmay swaroop saini haha thanks
    3
  515. Wooooo second
    3
  516. instagram: https://www.instagram.com/kevinnaughtonjr/ twitter: https://twitter.com/kevinnaughtonjr patreon: https://www.patreon.com/KevinNaughtonJr
    3
  517. Fred Wu oh no...I’m gonna have to buy more eggs...
    3
  518. I think long term everything will be fine
    3
  519. Neal Patel totally agree Neal and thanks for the support!!!
    3
  520. Hi Adelson
    3
  521.  @hacker-7214  haha all good yeah recursion is tricky for sure and I got you I'm always reading my comments :)
    3
  522. Thanks dude!
    3
  523. Thanks Dasha I really appreciate it and don't worry I'll keep the videos coming!!!
    3
  524.  @panzabamboo1901  No problem and yes I'd be happy to explain that part...that part is what's actually going to find us our "K closest points". It will do this by keeping track of this by using a max heap (I know, sounds backwards). The reason this works is the following...imagine if I asked you to find the K smallest numbers in a list...once you see the K + 1 item you no longer care about one of your items (since you only want the K smallest, not the K + 1 smallest items) and which item don't you care about? The largest. So using this max heap will allow us to always remove the largest element we currently have when we are considering too many items (hence if(maxHea.size() > k). So by the time we've actually processed all our items, we will actually have the K smallest items inside of our heap. The while(K-- >0) ... is just responsible for getting the points we just found. i.e. removing them from our heap, placing them in a 2d array, and returning them
    3
  525. Thanks so much Saloni I really appreciate the support!!!
    3
  526. Yeah as terrible as all the stuff is going on rn it’s def a good buying opportunity
    3
  527. NO WAY
    3
  528. devansh yep!
    3
  529. I think to include unicode characters you'd just need a bigger array to keep track of the additional characters' counts. I think this code should handle case sensitivity now since 'a' and 'A' will map to different indexes in our counts array since they have different ASCII values. For ignoring non alphanumeric characters I think we'd just need an if statement to skip them. Let me know your thoughts!
    3
  530. Working on it!
    3
  531. thanks Abhimanyu!
    3
  532. Thanks Brandon appreciate the support! :')
    3
  533. That's awesome super happy I was able to help :) If you need help with more questions like this check out the interviewing service I created https://thedailybyte.dev/?ref=kevin I'd recommend joining the annual tier if you can!
    3
  534. Thanks Atif! And yes, very subjective I try not to pay attention to what LeetCode classifies the problem as!
    3
  535.  @atift5465  I think it's by the number of submissions vs the number of accepted submissions. Which isn't that accurate either because someone can just sit there spamming an incorrect solution I feel like lol
    3
  536. Thanks Rajeev and I'll see what I can do!
    3
  537. Anytime and I'm so happy to hear that share it with others I wanna help as many people as possible and thanks for your support!!!
    3
  538. I don't know much about order statistics but I think it's just what the question is asking i.e. find the kth largest element in a set of numbers. If I did know more about it maybe I would make a video :)
    3
  539. The runtime is actually O(nlogk) i mispoke sorry about that. nlogk because we have to go through n elements placing at most k of them into a heap I hope that makes sense if it doesn't lmk and I can explain further :)
    3
  540.  @vigneshse  it's a bit better, but it does depend on what k is (so technically it can degrade to O(nlogn) if k = n). Sorting will be O(nlogn) (or N^2 depending on the sorting algorithm used) regardless of the value of k
    3
  541. Thanks Kevin dope name btw
    3
  542. Thanks Chemil!!! :)
    3
  543. Great tips Clement!!!
    3
  544. Gautham Padmakumar huuuuge crossover
    3
  545. thanks!
    3
  546. Thanks Seunghun! And yes you're correct, it uses dfs :) did I say it was a bfs in the video?
    3
  547. anytime! Best of luck you've got this!!!
    3
  548. awesome vid Dorian excited to keep following this new journey :)
    3
  549. :')
    3
  550. Thanks Karthik and I'm working on it!
    3
  551. Thanks Ray means a lot to me!
    3
  552. I love NYC I've lived in NY my whole live, come join me!!!! I've also thought about moving to silicon valley idk if I'd like it though?
    3
  553. Hey Soumya, you're totally right we definitely could. I thought it might just be best to break it up for clarity. I actually tried to do something fancy like A[i][j] ^ 1 to switch ones to zeros and zeros to ones but for some reason it didn't work :(
    3
  554. definitely, memoizing would help limit the runtime to be bounded by the number of unique subproblems you'd just have to determine how you wanna represent your state (probably the index you're at and the string you currently have)
    3
  555. You gotta know it it’s so important...it’s asked during just about every interview nowadays
    3
  556. like and subscribe to make me feel good Socials - https://linktr.ee/kevinnaughtonjr
    3
  557. Thanks for the advice Equaco! I'd always thought about putting diagrams or graphics on the videos maybe I'll start doing it!
    3
  558. you've got this!!!
    3
  559. Hey Ezequiel thanks for the support! I'll put that problem on my list and see what I can do! Best of luck on your interview Tuesday!!!
    3
  560. my ds class aged me like 3 years for sure 😂
    3
  561. Hey! Anytime; I hope you stick around and subscribe! I received something similar during my on-site in June. Hard to remember for sure but I think I mentioned dynamic programming first. In retrospect, it's probably better to talk about a recursive solution (without memoization) and then explain how it can be optimized with dp. For that round I believe I only received one problem. Once I had the dp solution we ran through some test cases and then talked about other potential optimizations.
    3
  562. maybe email me or something and I can try and help you more!
    3
  563. thanks and best of luck if you go for the BA! :)
    3
  564. Yep that's correct!
    3
  565. I think I’m gonna make another video solving that problem
    3
  566. SHIVAM SACHAN we wanted to make sure we store tree nodes in our queue so that inside our while loop we can have references to the current node’s children (we couldn’t do that if we stored something like integers in our queue) and linked list is just how you initialize queues in java (under the hood a queue is just a linked list with certain properties/abilities)
    3
  567. I try to think of it like the power set in math.The empty set counts as a subset. It's confusing but essentially I think the 1 way to climb 0 stairs is basically by doing nothing (which just counts as a way)
    3
  568. Thanks so much Puneet I really appreciate it! I'm happy you found the video helpful :) thanks for your support!!!
    3
  569. Google workspace
    3
  570. Anytime! I believe the solution i provided is O(nlogk) where n is the number of points. If you disagree lmk I hope this helps :)
    3
  571. Anytime!If you need help with more questions like this and like my explanations check out the interviewing service I created https://thedailybyte.dev/?ref=kevin I'd recommend joining the annual tier if you can!
    3
  572. Oh they’ll be back don’t worry
    3
  573. sri Vaishnav nah NYC but I loooove Denmark why do you ask?
    3
  574. 🤣🤣🤣
    3
  575. thanks so much Eduardo!
    3
  576. FAANG Interview Prep - Subscribe to The Daily Byte https://bit.ly/2DzsBd5​​ What's my desk setup missing???? Let me know in the comments!
    3
  577.  @kennygunderman  gonna have to invest in a second 34 inch curved monitor to put sideways
    3
  578. They're tough just have to keep practicing :)
    3
  579. can't tell from the way this shot is framed but when i'm actually sitting at my desk my eyes are aligned with the top of the monitor
    3
  580. Thanks Siddhant I'm sure the subs will pick up soon just have to keep making "good" content! And thanks for the suggestion I'll try to spend a little more time on the logic!
    3
  581. SECOND
    3
  582. Nice! Yes that also would have worked :)
    3
  583. Shalini Negi anytime! If you like my explanations be sure to sign up for the interviewing service I created https://thedailybyte.dev/?ref=kevin I recommend joining a premium tier if you can!
    3
  584.  @nickpappas6109  thanks Nick! hoping to make more videos like this! i appreciate your support as always :)
    3
  585. instagram: https://www.instagram.com/kevinnaughtonjr/ twitter: https://twitter.com/kevinnaughtonjr
    3
  586. Thanks Derek I really appreciate that! That's exactly what I'm trying to do...make this stuff fun and understandable :)
    3
  587. thank you!!!
    3
  588. Anytime Tony thank YOU for the support. Just remember work hard and it will work out for the better...so far me being laid off is one of the best things that has happened to me in my career. Please don't hesitate if there's anything I can do to help you prepare!
    3
  589. Notion is amazing and don’t worry a desk setup vid is coming very soon :)
    3
  590.  @prakad97  Haha not a bad idea :)
    3
  591. Thanks David and happy to hear it! The time complexity is O(n) where n is the number of nodes in the tree!
    3
  592. I LIVE for danger
    3
  593. Haha says the kid who I helped get into Microsoft AI...
    3
  594. Yeah I figured it's probably a phone screen question, something tells me you solved this no problem :)
    3
  595. Jan Michael Austria thanks and anytime! If you need help with these kinds of questions and like my explanations check out the interviewing service I created https://thedailybyte.dev/?ref=kevin I’d recommend joining the annual plan if you can!
    3
  596. Don't beat yourself up, these questions are hard!!! It took me a lot of practice and a lot of hours of studying to do these kinds of problems so don't worry just keep working hard!
    3
  597. Hmmm interesting my code passes for all their test cases...I see what you're saying but I'm we'll never run into that case because we would never encounter 2 commas in a row in the English language? What do you think?
    3
  598. i love you more
    3
  599. Thanks so much! I'm sure the channel will continue to grow, just have to keep working hard and putting out good content! :)
    3
  600. Careful 2 loops doesn’t mean n^2 you have to think about what each of the loops are doing
    3
  601. It's tough Salonee, don't beat yourself up, just keep practicing! :)
    3
  602. anytime Omar and thanks for the support!
    3
  603. i'm ready to retire
    3
  604. I def think LeetCode is best
    3
  605. haha maybe one day!!!
    3
  606. Think I missed this comment Neal sorry about that, I'll put that on my list :)
    3
  607. Thanks so much I'm happy to hear you're finding my videos helpful! For DP, I would suggest to start you look at a simple problem that is solved "top down" and understand that when a problem is solving using top down processing it's really just using recursion but never solving any sub problem twice. I'm hoping to make a video on explaining DP in depth soon!
    3
  608. Love that idea, but isn't it possible that you could have a word that let's say has one character whose "unique" hash (aka sum of all characters) is 40 and then some other word, let's say with 2 characters that together sum to 40 causing a collision (i.e. saying two words are anagrams when they're not)? LMK your thoughts!
    3
  609. Thanks Stanislav! At work I use a language called Groovy which is like Java but with more forgiving syntax :)
    3
  610. If anyone has questions/wants help HMU on instagram or twitter https://instagram.com/kevinnaughtonjr/ https://twitter.com/KevinNaughtonJr
    3
  611. literally better than me present day
    3
  612. Hey Ryan sorry for the late reply. Thanks! I'm happy to hear that you're finding the videos helpful. I haven't taken an online assessment with them in years but my general advice would be... (if you haven't taken it already) 1. Make sure you 100% understand the question before coding 2. Include error checking before the "meat" of your program / algorithm 3. Don't be nervous! I know this is almost impossible to do but just remember it's just an online assessment. Any question they ask with the ~30 minutes you have can't be too hard so don't overcomplicate / "over engineer" your solution. If you have any other questions or want help practicing lmk and we can discuss! Good luck!!!
    3
  613. Anytime! I would def check out more graph problems then that focus on BFS / DFS!
    3
  614.  @jlecampana  In my experience, yes they do but if you don't get one the LeetCode problems you've seen...the problems that you've practiced are definitely transferable to other problems and will help you!
    3
  615. Thanks Ian I really appreciate it hope you're doing well buddy!
    3
  616. "i'm not defined by my job or how much i make and neither are you", great quote. As always awesome video thanks Steve!
    3
  617. 2x speed is dope
    3
  618.  @nishadkumar7322  ah nice
    3
  619. Anytime Uma and keep at it something good is coming :)
    3
  620. you got it
    2
  621. I've been to Munich, but Amsterdam is still on my list!
    2
  622. I'll add it to the list, thanks for the suggestion Aman!
    2
  623. Rajat Semwal the index variable tells you where to place the next unique item
    2
  624. Planning to at some point :)
    2
  625. oh yeah
    2
  626. Hey Soumya! Thanks for the input, I'll try and start throwing some harder problems into the mix!
    2
  627. Anytime and I'll see what I can do!
    2
  628. Thanks man! :)
    2
  629. Yeah should have said that the runtime is the max of the lengths of num1 and num2 my fault!
    2
  630. Haha thanks and I will don't worry :)
    2
  631. Manish Tiwari ahhh I see
    2
  632. Konrad Onbal that’s amazing Konrad nice work keep it up!!! :)
    2
  633. Make another video with me Car!!!
    2
  634. you got it!
    2
  635.  @rahulnirmesh3388  definitely! Check out my Patreon page and sign up for the tier that’ll be the most helpful for you! I also do mock interviews. If you’re interested in mock interviews we can discuss once you join the Discord server :) https://www.patreon.com/KevinNaughtonJr
    2
  636.  @rahulnirmesh3388  anytime :)
    2
  637. Abhay Tiwari anytime
    2
  638. hang in there and keep working hard it'll get better. good things take time ❤️
    2
  639. OH YEAH WE'RE BACK
    2
  640. personally I don't
    2
  641.  @ismailelhabbash  I'll add that to my list!
    2
  642. thanks Thomas!
    2
  643. awesome and powerful video prime really goes to show you you can change your life by deciding to work hard and putting in the work over time
    2
  644. great vid steve, also you look great in maize and blue :P
    2
  645. I would say so! Good point :)
    2
  646. Anytime!
    2
  647. nelsonthekinger thanks so much really appreciate that :)
    2
  648. Thanks Swagato :)
    2
  649. Safari Star ahahah
    2
  650. i think it always looks good to know the syntax of the language you choose to code in because that helps demonstrate your proficiency in it, but most interviewers are ok if you know that a certain method exists that you can use, but forget the name of it for example
    2
  651. Anytime! Got a problem number? I'll add it to my list!
    2
  652. thanks!!! :)
    2
  653. thanks Deshmukh!!!
    2
  654. i don't think ai will replace engineer, i think ai will help engineers be more efficient. learn how to work with ai tools
    2
  655. I'M BACK
    2
  656. thanks for the support David!
    2
  657. I'll check it out thanks for the suggestion!
    2
  658. Anything in particular? In general if you're stumped I'd recommend having a systematic way to go through each data structure and think about if they could be useful for the problem at hand. If you have any other details you could give me about when you get stuck I'd be happy to try and give you more advice!
    2
  659.  @blasterzm  Hey Mircea thanks for chiming in! I definitely mispoke in this video and the runtime is O(nlogk) i agree. I like to think that I understand heaps and I do know about "floating up" and "sinking down" nodes in the heap. From what I understand you're able to build a heap in O(n) time. If you have more thoughts I'd love to hear them!
    2
  660. khalid hossain anytime! If you liked this explanation check out the interviewing service I created https://thedailybyte.dev/?ref=kevin I recommend joining one of the premium plans
    2
  661. Thanks Ayeman!
    2
  662. Thanks Soumya! I'll try to do some more graph problems for you!
    2
  663. coder2701 rocks thank you!!! If you like my explanations be sure to sign up for the interviewing service I created https://thedailybyte.dev/?ref=kevin I’d recommend joining the annual tier if you can!
    2
  664.  @coderrocks  It definitely will be and amazing can't wait to see you join :)
    2
  665. they were SOOOO good
    2
  666.  @gurdoman  sorry to hear that Adrian but keep working at it and something better will come along!
    2
  667. this vid is pure art Cole absolutely loved it
    2
  668.  @Jonathan-qz9td  next vid I got you ;)
    2
  669. I think this just about sums up everyone’s reaction
    2
  670. I think I might have a vid on that one?
    2
  671. thanks :D
    2
  672. it's a good one for sure
    2
  673. That's ok Atif it just takes practice keep working hard! What I normally try and do for dp problems is kinda what I did in this video...I try to think abou the simplest case. So whenever approaching a dp problem (and using bottom-up processing), I try to think about the absolute simplest case and build from there!
    2
  674. Thanks and anytime! I hope you enjoyed the video!
    2
  675. Zeo Life replace all I think will slow down your runtime because strings are expensive in Java
    2
  676. devansh hahaha thanks dude
    2
  677. Taz Saraf agreed I’m on Firefox now :)
    2
  678. anytime Sai and I will don't worry, have another video going live tonight at 9pm ET :)
    2
  679. thanks Nikhil! If you like my explanations, be sure to check out the interviewing service I made to teach people how to pass technical interviews. I recommend joining the annual tier: https://thedailybyte.dev/?ref=kevin
    2
  680. Nishad thanks Nishad and anytime!
    2
  681. daro d that’s awesome congrats!!! If you need help preparing check out my Patreon page: https://www.patreon.com/KevinNaughtonJr. I’d recommend the “study buddy” or “onsite” tier!
    2
  682. Anytime Mohammed thanks for the support I really appreciate it!!!
    2
  683. Hey Rahul, I def recommend using LeetCode to prepare...if you want specific help preparing check out my Patreon page where I have tiers to help people get ready for technical interviews: https://www.patreon.com/KevinNaughtonJr
    2
  684. I don't think we'd be able to get anything done haha
    2
  685. League is ESSENTIAL
    2
  686. Hey Arup, sorry for the late response! I hope the interview went well if you already had it! If not, I offer help like that in my Discord server. If you're interested in joining check out my Patreon page! https://www.patreon.com/KevinNaughtonJr
    2
  687. Thanks Achyut really appreciate it and anytime! :)
    2
  688. Nice!!!
    2
  689. Hey Ishita I've got a video like this coming soon don't worry thanks for your support!
    2
  690. i had a lot of trouble finding jobs especially earlier in my career! i even got laid off from my first engineering job out of college. hang in there and work hard it gets better you can do it!
    2
  691. thanks!
    2
  692. Thanks! I believe this would technically be a dfs because each recursive call will go to its neighbor below it (i.e. keep going down whenever possible) :)
    2
  693. congrats to both of us for making it : ' )
    2
  694. You get the point and either way meetings IRL do get booked back to back in the same room i.e. my meeting in room #1 is from 12pm-1pm and you book room #1 for 1pm-2pm
    2
  695. Jonnalagadda Gopi krishna haha I'll try to churn out vids more often but no promises yet :)
    2
  696. I used to feel the same way. It's super important to check in with your manager and understand what your expectations are. Once you have those nailed down, communicate early and often about them so that if your performance does slip for any reason you can address it right away. I hope this helps; remember, you're not alone with how you feel. I figured it out and so will you!!
    2
  697. Anytime I hope it helped!
    2
  698.  @pamfan221  Thanks for the advice and letting me know! I'll try to fix the sound stuff ASAP
    2
  699. hydration is key
    2
  700. Anytime I hope it was helpful!
    2
  701.  @thekewlwaffle  I'll see what I can do thanks for the suggestion!
    2
  702.  @rahulshrivastava3040  You got it!
    2
  703.  @rahulshrivastava3040  You got it!
    2
  704.  @thekewlwaffle  Thanks and I'll see what I can do!
    2
  705.  @Erkotak  Thanks and I'm so happy to hear that. Thanks for the suggestions I'll see what I can do!
    2
  706. great class, not a programming class 😂
    2
  707. hmmm that's interesting....at a quick glance I'm not sure. It looks very similar, << 1 should be the same as multiplying by two.
    2
  708. Anytime Alan and I respect that so much. I can't even imagine having to try and do CS with English not being my first language, but good for you! How did the Amazon assessment go?
    2
  709. thanks John will do :)
    2
  710. i think you actually need that check to bottom out your recursion in some instances
    2
  711. Thanks Jon!
    2
  712. Hey Hari, I just a stack because we don't know how many valid positions we'll have so we don't want to have to declare a ton of variables
    2
  713.  @swagatochatterjee7104  ohhh right, that's why we have our heap it takes care of it behind the scenes :)
    2
  714. yes definitely and thank you!
    2
  715. ashish kumar thanks Ashish and yes I’ll see what I can do!
    2
  716.  @jak0495  Pls no J that's what your channel is going to be fore
    2
  717. Thanks Michael I'm happy to hear the videos are helpful! If there's anything I can do to make them better please let me know!
    2
  718.  @jlecampana  No way!!! Bogota was SO cool!!!! That's a great video idea, I'll jot it down and see what I can do thanks for the suggestion!!!
    2
  719. Arvind Raju anytime! Check out the interviewing service I created if you like my explanations! https://thedailybyte.dev/?ref=kevin I recommend joining a premium plan if you can!
    2
  720. thanks Sai and yes I definitely should! :)
    2
  721. lalit borse I’ll see what I can do
    2
  722. Mohammed Almukhtar haha thanks Mohammed and happy to hear that :)
    2
  723. thanks Ivan! i'll remember this advice for the next vid :)
    2
  724. Hey Olivia idk the names of the restaurants besides Andres and crepes and waffles but the hotel was hotel click clack and all the restaurants around the park next to that hotel are great!
    2
  725.  @oliviachapman6572  Anytime!
    2
  726. i love nadeshot! watched him growing up :)
    2
  727. thanks man happy to hear it was helpful!
    2
  728.  @algorithmimplementer415  Thanks and yes, I generally try to keep the vids shorter and hopefully more "entertaining" than other vids out there. When starting this channel I knew I wanted to try and keep the vids shorters to hopefully give people the info that they want as fast as possible
    2
  729. Thanks and I'll see what I can do!
    2
  730. That's amazing AJ!!! Good luck! I'd love to hear how it goes! Hope my Amazon playlist has been helpful :)
    2
  731. It's coming Alp
    2
  732. Best of luck! I would just recommend knowing their most frequently asked questions on LeetCode. Lmk if you have any other questions!
    2
  733. Sorry to hear you're in a tough spot Tara but keep working hard and I'm sure something better is coming! :)
    2
  734. before you report pls make sure to like the video and subscribe
    2
  735. It happens to the best of us! And after a certain amount of time, there's no benefit to continuing to sit there and stare at the screen. I think my point is really just to let yourself struggle (at least for a little bit) so that you have experience racking your brain for coming up with potential solutions because worst case scenario that can be what happens during the real interview :)
    2
  736. i appreciate you coming and checking out the vid!
    2
  737. yeah tying them to specific accounts would help too
    2
  738. Phani Davuluru haha same
    2
  739. Hey Siddhartha, I'm not sure I understand. The second loop here is just used to find the 1st unique character. It does so by setting the min variable to the smallest number that is greater than -1 (-1 means that character is not unique). I hope that makes sense? LMK your thoughts!
    2
  740. Check out my latest video I just talked about it but it’s an Acer 34 inch curved gaming monitor
    2
  741. Awesome! These kinds of questions are all about recognizing patters so that's great you see it! :)
    2
  742. Yeah I'm working on it Ashiwad, thanks for letting me know and thank you!
    2
  743. Thanks for the suggestion Poornima I'll see what I can do!
    2
  744.  @JohnWick-zc5li  Thanks for the input! I'm also hearing from other people that they like the music (I kinda think about it as elevator music, something to just play in the background), but maybe we can find a happy medium where I turn it down more :)
    2
  745. Thank you so much for the kind words :) don't worry I'll keep the LeetCode videos coming and thank you so much for your support!!!
    2
  746. Hopefully I'll have something and anytime I'm happy to help thank YOU for your support!
    2
  747. Anytime Parshhuram! I hope you enjoyed the video!
    2
  748.  @yjc2403  Thank you so much for the support! I'll see what I can do about that LeetCode question, thanks for the suggestion! :)
    2
  749. Thank you Sumit!
    2
  750. ty Akash i really appreciate your support :)
    2
  751. thanks!
    2
  752. I’ll see what I can do!
    2
  753. looking into supporting multiple languages soon but for now it's just java. The explanations should make it clear enough to understand how to solve the problem in any language though
    2
  754. That's awesome super happy to hear that :) GL mentoring!
    2
  755. SANA JAHAN thanks Sana I really appreciate it! In more recent videos I talk about time and space complexity at the end :)
    2
  756. newer vids the volume should be better now
    2
  757. thank you Jason! :)
    2
  758. thank you happy you enjoyed it! :)
    2
  759. Chirag Chatwani THANKS CHIRAG!!!
    2
  760.  @atift5465  Anytime I'm always happy to help! :)
    2
  761. My Google interview?
    2
  762.  @rajivranjan6268  Don't worry I won't and thanks for understanding!
    2
  763. Anytime Rupal and thanks! I actually offer services on my Patreon page for mock interviews as well as other interview prep if you're interested in checking it out here's the link: https://www.patreon.com/KevinNaughtonJr if not, no worries, best of luck with the Google onsite!!!
    2
  764. Kamal Mahmud yeah that's a good idea maybe I can try and add some visuals
    2
  765. it's the math/cs building of the college i graduated from (nyu)
    2
  766. the struggle was very real 😂
    2
  767. Thanks Tren :')
    2
  768. Instagram: https://www.instagram.com/kevinnaughtonjr Twitter: https://twitter.com/KevinNaughtonJr Patreon: https://www.patreon.com/kevinnaughtonjr TDB: https://thedailybyte.dev/?ref=kevin
    2
  769. naruto is so good, never finished it though :(
    2
  770. You're totally right, good call :)
    2
  771. Thanks I really appreciate that!
    2
  772. I've uploaded literally every day for the past 10 days????
    2
  773. I'm happy to help you however I can!
    2
  774. this vid was incredible and also gave me instant anxiety from assignments i had to do like this in college in c
    2
  775. Jeet Patitundi amazing and anytime!
    2
  776. Jeet Patitundi anytime and congrats Jeet super happy for you!!!
    2
  777. They fixed it!
    2
  778. Hey! If you have a premium subscription you can sort by them. If you don't have a premium subscription I'd be happy to try and help :)
    2
  779. It depends on how you define the variable n honestly...if you define n as in all the cells in the matrix then yes you are traversing all the cells in the matrix once so O(n) (I believe), but if that's the case you could also define traversing all the cells in the matrix as O(nm) where the matrix is m x n or O(n^2) if the matrix is n x n. In regards to the space complexity, the recursion uses stackframes so that's technically using memory. I hope that made sense please lmk if it didn't :)
    2
  780. Anytime! Thank you for your support!
    2
  781. Pallavi Varshney check out my Patreon page and join the tier you’re interested in and we can connect! https://www.patreon.com/KevinNaughtonJr
    2
  782. Anurag Mishra thanks for the detailed explanation! I guess I didn't go into as much depth as you but that's what I meant by 0 minus 0. I was referring to the offset that would be generated by the ascii values
    2
  783. it was me
    2
  784. Hey Wilson, nice solution! I don't think the memory would change since you'd pretty much be passing around a reference to the same object. I think it'd probably be better in a real world setting to pass a custom object around instead of an array, but I've used the same trick before too :) thanks for your support!
    2
  785. Thanks! I'll see what I can do :)
    2
  786.  @nealpatel7696  In my interview experience it's typical to use N to describe the number of nodes in a tree :). LMK if you have any other questions Neal!
    2
  787. I actually work at a start up :) I hope you're enjoying the channel so far!
    2
  788. anytime!
    2
  789. Chicken Dolo lots of practice and thanks
    2
  790.  @esotomay21  anytime! Thank YOU for the support!!!
    2
  791. thanks for watching and supporting the channel Atul! :)
    2
  792. Thanks Ved and will do :)
    2
  793. me too they're coming back with me don't worry
    2
  794.  @imtiazmohamed5756  That's an awesome idea thanks for the suggestion I put it on my list!
    2
  795. Hey Anthony thanks so much and you've got it!!!
    2
  796.  @zombnie  That's insane congrats I'm so happy for you!!! And anytime I'm always happy to help :)
    2
  797. Hey Rachna sorry for the late response!! If you already had the interview I hope it went well!!! If not, I'd be happy to discuss the question with you in my Discord channel if you're interested in joining!
    2
  798. Anytime!
    2
  799. congrats!!!
    2
  800. Lofi is dope
    2
  801. definitely! An else block helps it reads a little better good call!
    2
  802.  @philrod1  You'd need an else to make sure only one of the things happens though
    2
  803. awesome vid steve :)
    2
  804. Anytime Pawel that's awesome, data science is hard!!!
    2
  805. Ok by me! I want everyone to help each other :)
    2
  806. Anytime Adam! So smart thanks for awesome optimization!!!
    2
  807. Rajath Nayak thanks and I’ll see what I can do!
    2
  808. Srinivasan Ramu hey Srinivasan congrats on getting the phone interview with google that’s amazing! I offer services to help people prepare for technical interviews on my Patreon page if you’re interested in checking it out here’s the link! https://www.patreon.com/KevinNaughtonJr
    2
  809. Thanks Abhinav!
    2
  810. exactly! work hard and it'll work out 🤝
    2
  811. Thanks Mustafa and anytime!!!
    2
  812. Thanks Spark! I just liked video games when I was younger so I was interested in programming so I gave it a shot in college and loved it
    2
  813. Thanks Bo!
    2
  814.  @cc.forbes  WOW thanks Chris def just saved me some cash!!!
    2
  815. For this service no although you can always reach me on Twitter and Instagram @kevinnaughtonjr. If you do want to talk to me personally check out the tiers on my Patreon page https://www.patreon.com/KevinNaughtonJr
    2
  816. Hey Pooja what's the problem number? I'll see what I can do!
    2
  817. Think I'm a little confused by what you mean, sorry....because I am starting my loop at i = 2?
    2
  818. Alam Jim luckily it did not :)
    2
  819. dude i had the SAME fear as a kid about going to sleep at night
    2
  820. Thanks and I'll see what I can do! :)
    2
  821. that's what I meant to do :/
    2
  822. Thanks Saurabh and do you have the problem number? I'll put it on my list :)
    2
  823. Thanks Atif!
    2
  824.  @FrankLi92  Haha thanks for the kind words. Honestly it's just practice (and that's not to say that I'm good) stuff like this takes time. Make sure that when you go over problems, you spend the time to understand why the solutions work. If you have any other questions, feel free to ask and if you need any help lmk and we can find a time to talk! Keep working hard it pays off!
    2
  825. haha thanks dude, btw just ordered the Anne Pro 2 and I can't wait for it to get here
    2
  826. Liam Atkins anytime Liam and you’ve got this just take it one step at a time :)
    2
  827. Rohan Manatkar check the description for the songs
    2
  828. Anytime, I'm happy to hear the videos are helping you! I'll throw that problem on my list and see what I can do :)
    2
  829. Shubham Kumbhalkar anytime thanks for your support!!! :)
    2
  830. Looking to make a Q&A video soon! Follow me on Instagram and shoot me a DM with your question if you're interested in participating!!! https://www.instagram.com/kevinnaughtonjr/
    2
  831. Thanks Luccas I really appreciate that! If you need help with interview questions be sure to check out the interviewing service I created: https://thedailybyte.dev/?ref=kevin I recommend joining a premium tier if you can :)
    2
  832. Shain Dholakiya hey Shain that’s awesome! I have some tiers to help people prepare for their interviews on my Patreon page if you’re interested in joining one! Here’s the link: https://www.patreon.com/KevinNaughtonJr
    2
  833. Generally speaking, I wouldn't always count that in the runtime (although I guess it kinda depends on the case). Here I would just say the runtime is O(n) where n is the number of nodes in the tree but you're right technically because add(0, node) is probably shifting all the nodes in the list down, it might be O(n^2)
    2
  834. Anytime and nice looks good!!
    2
  835.  @loveyagrawal8873  Hey Lovey I'm so happy to hear that that means so so much to me thank you! Please let me know if there's anything I can do to make the videos better and thank you so much for your support!
    2
  836.  @jlecampana  Anytime and I would suggestion mentioning the "naive" or brute force solution so that your interviewer knows you're aware of it and then from there you can talk about optimizations. I think if you're able to talk about the brute force and how / why it can be optimized i.e. what work you're repeating that is unnecessary I think the interviewer will appreciate that and I think it'll definitely show that you know what you're talking about!
    2
  837.  @nathann4291  Thanks Nathan and thanks for the input I'll be sure to keep it in mind :)
    2
  838. Anytime and thanks for letting me know I'll try to be more detailed in the future!!!
    2
  839. Haha anytime!
    2
  840.  @cbjueueiwyru7472  Yeah tbh, I probably should've done it without extra memory cuz of the prompt I'll make sure I stick to what the problem description says in the future (unless it says it as a follow up maybe). Thanks so much I'm happy to hear my videos have been helpful. That's awesome! Good luck! If there's anything I can do to help you please let me know. Also if you're interested in joining the Discord channel and chatting there here's the link to join: https://www.patreon.com/KevinNaughtonJr
    2
  841. Harsh Thakkar thanks dude!!
    2
  842. atif tirmizi thanks Atif I'm happy to be back and leaving is not my plan just couldn't upload for a bit unfortunately with the stuff I had going on
    2
  843. atif tirmizi thanks Atif :)
    2
  844. Hahahha thanks Weiqi and I totally agree, who knows maybe she'll change career paths :)
    2
  845. Thanks so much I really appreciate that!
    2
  846. Anytime Andy I'm super happy to hear the video was helpful! Lmk if there's anything I can do to hel you prepare and best of luck!
    2
  847.  @sohamharnale2878  looking forward to it :’)
    2
  848. Cookie Boy check out the interviewing service I created it’ll teach you how to solve these kinds of problems https://thedailybyte.dev/?ref=kevin I recommend joining a premium plan if you can
    2
  849. thanks Tru! shout-out trash 🫡
    2
  850. thanks for watching!
    2
  851. Mihir Phatak thanks Mihir! Happy to hear the video was helpful :)
    2
  852. Nice! Just remembered that with recursion it won't scale as well!
    2
  853. Thanks Atif yeah I'm very thankful to have been able to go to Bogota it was super cool!
    2
  854. Thanks Jon :)
    2
  855. raam2508 thanks so much I really appreciate that!
    2
  856. Anytime :) and be careful just because you have nested loops doesn't mean your runtime can't be O(N). In this solution, we have two loops but we still only touch every element once. The inner loop starts j at i + 1 and increments to some point further into S and then when the inner loop breaks we set i = j. Hope that makes sense!
    2
  857.  @divyabharti9879  you got it :) if you need help with interview prep and like my explanations check out the interviewing service I created https://thedailybyte.dev/?ref=kevin
    2
  858. Thanks Xavier :')
    2
  859. Anytime. I really appreciate you leaving a comment and letting me know the videos are helpful; that's why I'm making them! I'd love to hear how your interview went if you feel comfortable sharing? Otherwise if you've got any suggestions on how I can make these videos better I'd love to hear it!
    2
  860. "boiii I think they like me, yeah they like me diamonds on me ice cream"
    2
  861. Ajay Puri thanks :) if you need help with interview prep be sure to join the interviewing service I just created The Daily Byte! I recommend joining the annual tier https://thedailybyte.dev/
    2
  862. Shishir Aithal agreed
    2
  863. haha thanks Atif
    2
  864. Rashedul Rony nice! Thanks for sharing!
    2
  865. Thanks Mohak! I think the volume is better in my more recent videos :)
    2
  866. personally, i'm not affected by any "politics" at work. My best advice to you would be to come up with things you need to do to get promoted with your manager and have it in writing. Obviously they can't guarantee it'll happen, but having things you need to do to get promoted in writing and then accomplishing them will make it very hard for them to say no. Worst case scenario you can try switching teams, but I recommend trying the first piece of advice before that. Good luck!
    2
  867. Yeah sound quality wasn't great when I first started because I was using my laptop mic, but now I have a real mic so it's better :)
    2
  868. NO WAY
    2
  869. Nice!!!!
    2
  870. Thanks Patricia!
    2
  871. Anytime and that problem is on my list :)
    2
  872. thank you Jack i really appreciate it! i hope you're enjoying your coffee :)
    2
  873. Pavittar Kumar Azad anytime! If you need help with these kinds of questions sign up for the interviewing service I created https://thedailybyte.dev/?ref=kevin I recommend joining on of the premium tiers
    2
  874. Thanks and anytime! Sorry not sure how I've missed this comment but the space complexity is a bit tricky to determine but it's def bigger than O(1) because of the recursive calls :)
    2
  875. thanks!
    2
  876. Thank you and anytime!
    2
  877.  @venkatsai5013  Thanks Venkat :)
    2
  878.  @nealpatel7696  how did it go?!
    2
  879. hahahahha
    2
  880. they were able to see the timer the entire time so they were stressed enough as is 😂
    2
  881. pls yt gods
    2
  882. Haha thanks man I really appreciate it! I'll see what I can do in terms of the font size etc. thanks for the advice!
    2
  883. Just added it to my list, thanks for the suggestion!
    2
  884. Ashwini Upadhyay anytime and thanks for the suggestion I'll see what I can do!!!
    2
  885. Thanks Eugene!
    2
  886.  @alphabet_soup_69  haha gotcha. Yeah I don't always trust LeetCode if you just resubmit a lot of times it'll actually change the percentage. On top of that a lot of the "top" solutions are solutions that actually aren't great in an interview setting...i.e. they're one line and totally unreadable or do something that defeat the purpose of the actual question (like using the division operation when asked a question like "how would you implement a function that performs division?")
    2
  887.  @goro7379  dude facts that guy's a nut he's crazy good
    2
  888. I'll put it on my list!
    2
  889. i think you're asking which is harder: getting into the company or staying in it? if this is the question i think getting in is mostly about practicing and staying in is just about learning and working hard. i guess if i had say it's probably harder to get in since once you have the job you just need to deliver the things you're responsible for
    2
  890. WheresTheBeach013 the video I uploaded yesterday has Carly in it too if you wanna check it out!!!
    2
  891. Thanks Sridhar!
    2
  892. Thanks Atif!!! :)
    2
  893. Definitely, I'll see if I can make a video on that one next week thanks for the suggestion!
    2
  894. Hahah I love this idea Arjun, thanks for sharing!!!
    2
  895.  @21arjundubey  Definitely, only thing is idk if Carly actually wants to / def doesn't have the time to learn how to code :(. But maybe we can still do a video around what you explained :)
    2
  896.  @evanxg852000  Yeah you're looking at a different problem check the link in the description to get to the problem I solved in this video
    2
  897. Chidi java but looking to expand to other languages as well
    2
  898. Hey Johnny, very similar definitely the same concepts / data structures involved :)
    2
  899. Jayesh Borgaonkar thanks Jayesh I really appreciate it! I made one video to try and design some basic concepts if you wanna check it out!
    2
  900. Anytime thank YOU for supporting my channel and taking the time to comment :)
    2
  901. omg it was so good
    2
  902. Anytime Robert!!!
    2
  903. Amanpreet Oberoi like make playlists based on topic?
    2
  904. thanks for the feedback i really appreciate it :)
    2
  905. aw man sorry Alper :( thanks though!
    2
  906. Anytime Adrian! If you're looking for more help check out the interviewing service I made to teach people every day The Daily Byte: https://thedailybyte.dev/?ref=kevin. I'd recommend joining the annual plan if you can! :)
    2
  907.  @bonkers4490  Exactly! Anytime!!!
    2
  908. it was hilarious making this vid 😂
    2
  909. thanks Jacob and nice that's awesome!!!
    2
  910. Robert Kim thanks
    2
  911. you are always welcome in my home Pan ♥️
    2
  912. Thanks so much!!! I would say time complexity is O(n*m) and the space complexity is a bit harder to calculate because of the recursion but i guess in theory it could be O(n*m) as well because we can have at most n*m recursive calls?
    2
  913. Thanks for sharing Garen! Nice work!
    2
  914. good call
    2
  915. Prakash Jha anytime and will do!
    2
  916. Might have to join my onlyfans for that
    2
  917. Awesome optimization Vitor thanks for sharing! Don't worry I'm going to keep posting these videos!
    2
  918. Thanks Prakad and nice!
    2
  919. they're the geniuses
    2
  920. Long Chen thanks Long! If you need help preparing for interviews be sure to subscribe to the interviewing service I created, The Daily Byte! I recommend joining the annual plan https://thedailybyte.dev/
    2
  921. I'll see what I can do :)
    2
  922. thanks Matt! Really appreciate it dude :)
    2
  923. Anytime thanks for sharing your thoughts! If I'm understanding your approach correctly, I think this could totally work the only thing is I think it'd be a little slower because to remove a word that is banned from the stack this could take a bit of time if we've pushed several allowed words on top of it. I encourage you to give your approach a try and let me know what happens!
    2
  924.  @atift5465  Sounds good and anytime! :)
    2
  925. instagram: https://www.instagram.com/kevinnaughtonjr/ twitter: https://twitter.com/kevinnaughtonjr patreon: https://www.patreon.com/KevinNaughtonJr merch: https://teespring.com/stores/kevin-naughton-jrs-store
    2
  926.  @iamabean  If you need help preparing for your interview check out my Patreon page: https://www.patreon.com/KevinNaughtonJr
    2
  927. HIMANSHU SINGH thanks for reaching out! Check out my Patreon page if you're looking for help with preparing for your interviews! https://www.patreon.com/KevinNaughtonJr
    2
  928.  @paulydavis1685  thanks! I totally agree I think if they asked you to optimize and you gave the O(1) solution you're in great shape!
    2
  929. Thanks Spark I really appreciate it!
    2
  930. thanks mate :)
    2
  931. crazy awesome vid Cole this must've taken so much work to make, respect
    2
  932. Rushil Thareja anytime!!!
    2
  933. Haven't tested this solution, care to explain what it's doing exactly? Sorry for the late response!
    2
  934.  @ShravanBelde  Anytime and thanks for the support! Wow, nice solution and great explanation :)
    2
  935. thanks! https://amzn.to/3NpJpoH (affiliate link)
    2
  936.  @ishitarathi1186  Anytime!
    2
  937. Anytime Sateesh and thanks :)
    2
  938.  @sateeshtata  Anytime Sateesh and thanks for the suggestion I added those problems to my list :)
    2
  939. :')
    2
  940. ty Nang ♥️🥹
    2
  941. Komal Bhalge older vids on in lower volume cuz I didn’t realize but now the volume is better on more recent vids
    2
  942. Whole lotta red about to drop
    2
  943. thanks and glad to know i'm not alone 🤝
    2
  944. follow me on twitter and instagram so that you can be following me on twitter and instagram: https://twitter.com/KevinNaughtonJr https://www.instagram.com/kevinnaughtonjr/
    2
  945. thanks!
    2
  946.  @ArvindVerma-ct7oq  Thanks, I added them to the list :)
    2
  947. Anytime and will do!
    2
  948. IPhone Apple thanks! And these questions are hard don't be fooled!!! It takes a lot of practice!
    2
  949. i am beginning to deflate
    2
  950.  @asphix  Yeah I try my best to keep them short and to the point because I worry that people will get bored if the explanations are too drawn out
    2
  951. yep! i've always been in nyc and luckily i'm pretty much able to work whatever hours work best for me which is awesome
    2
  952. YOU THE MAN TREY thanks so much I really appreciate your continued support!!! :)
    2
  953. Trey Quattro love to hear that let’s keep growing the channel :)
    2
  954. thanks Winston!
    2
  955. Miguel Manchola if you help with these kinds of problems be sure to subscribe to The Daily Byte! https://thedailybyte.dev/
    2
  956. This was good J
    2
  957. I'll see what I can do, thanks for the suggestion!
    2
  958. Nice! And yes if the interviewer asks for that we can just throw it in the priority queue constructor like you did :)
    2
  959. haha thanks so much I really appreciate that. I would suggest studying up on both if possible but if you have to pick one I'd def go with data structures and algorithms
    2
  960. Anytime Nikita
    2
  961. Oh yeah the edge cases will get you
    2
  962. haha fingers crossed!
    2
  963. Redouane Bali NOOOOOOOOO what song? The crowd cheering noise???
    2
  964. Looking like it
    2
  965. I think I've got that one on my list :)
    2
  966. Nothing really other than just me seeing the date and actually remembering it. I also think it's important to just remind people that stuff happens and you gotta keep pushing forward
    2
  967. Hey David! I'd recommend checking out my Patreon page for some of the services I offer to help people prep: https://www.patreon.com/KevinNaughtonJr. I also do mock interviews if you're interested in that (I'm currently helping 2 other people prep for FB interviews as well!) If you're' interested or have any questions/want to chat reach out to me on twitter: https://twitter.com/KevinNaughtonJr
    2
  968. :)
    2
  969. I've got some on the list!
    2
  970.  @atift5465  Just put it on the list Atif, I'll see what I can do :)
    2
  971.  @atift5465  Anytime Atif, thanks for the continued support as always!
    2
  972.  @atift5465  Thanks Atif :')
    2
  973. Carlos Garcia IT’S ALL ABOUT THE VIBES
    2
  974. Nidhi Singh anytime!
    2
  975. anytime!
    2
  976. Thanks Faraz and anytime!
    2
  977. foreshadowing 👀
    2
  978. Anytime Thomas, thanks for the support!
    2
  979. haha thanks and no real particular reason aeron is solid too
    2
  980. Thank you!!!
    2
  981. thank you!
    2
  982. agreed, no wrong answers :)
    2
  983. Yeah the intro classes are key
    2
  984. Anytime Rohit and thanks so much for supporting the channel it means the world to me :)
    2
  985. Anytime and happy to hear that thanks :)
    2
  986. Anytime Mohammed thanks for supporting my channel!
    2
  987.  @rajivranjan6268  Of course anytime! I'm always happy to help that's the point of my channel :)
    2
  988. Babajide Apata thanks!
    2
  989. Varun Rao I miss the gym :( home workout have been ok but I miss having real weights to lift
    2
  990. ArtByAud anytime! I appreciate you leaving this comment and letting me know. Getting laid off was the best thing to happen to me in my career and I hope that you look back soon enough and think the same. If you need help with interview prep be sure to check out my Patreon page and the interviewing service I made https://www.patreon.com/KevinNaughtonJr https://thedailybyte.dev/?ref=kevin I hope you come back to this video soon enough and tell me all about the awesome new job you landed :)
    2
  991. No worries! It doesn't matter what you leave past the end of the "new array" so it's really just about removing all instances of the value you're given so you basically just place every number in the array that isn't that element at the next "index"
    2
  992.  @jeffge8009  Anytime and thank YOU Jeff for the support :). I'll throw that problem on my list!
    2
  993. Hey Deependra that's awesome congrats on getting the interview! Before I can give advice, is the phone call with the recruiter or will you be live coding with an engineer?
    2
  994. Thanks Nakapeesh!!! I hope other people thing it's a good balance too :)
    2
  995. Thanks Abhishek I really appreciate it!
    2
  996.  @atift5465  I totally agree sometimes I find easy problems hard and vice versa
    2
  997.  @nishadkumar7322  Anytime :)
    2
  998. commit a lot of code, have impact, and make meaningful relationship, but 6 months timeline isn't guaranteed
    2
  999. Hey thanks so much for the kinds words! I'd love to help you prepare for your interviews! In the Discord server you'll be able to ask me any questions you have about interviews, preparation, etc and I'll answer! It's also a great place to discuss with others the kinds of things you're going through / might have questions about! I hope to see you there!
    2
  1000. Ansuman Pati I do in more recent vids :)
    2
  1001. that's amazing congrats!
    2
  1002. Working on it! Will hopefully have a lot more content out this month since I'm taking a month off of work
    2
  1003. thanks Matt and totally agree! so much has come out of failures for me. thanks as always for supporting my channel :)
    2
  1004. Thanks and definitely I always means to but I forget to I'll try to be better about it. I believe the runtime for this is about ~3^n
    2
  1005. thanks!!!
    2
  1006. tysm! happy to hear that you enjoyed hearing me talk about the problems i was solving (or stuck on) :)
    2
  1007. Thanks! And yeah hopefully they'll kick me a few more cleanings or something
    2
  1008. Correct! Sorry I always mean to mention runtime but forget to...the problem doesn't specify if the matrix is n by m or n by n but either way it'd be O(n * m) or O(n^2) thanks for mentioning it Tony :)
    2
  1009. Abhay Tiwari thanks Abhay!
    2
  1010. Nilanjan Chowdhury doing so makes sure you traverse the 4 adjacent cells to the cell you’re currently on (so {0, 1} simulates moving right one cell, {1, 0} simulates moving down one cell, etc)
    2
  1011. Sorry to hear that but keep working hard and something better will come along!
    2
  1012. Henri Herrera yeah it’s chill don’t worry
    2
  1013. FAANG Interview Prep - Subscribe to The Daily Byte https://bit.ly/2DzsBd5 Socials Instagram: https://bit.ly/2SM8SLZ Twitter: https://bit.ly/3fAcv18 Patreon: https://bit.ly/2Li2kAo
    2
  1014. Abigail Gonzalez that’s ok! I was there once too :). I actually recently released an interviewing service to help people with this exact kind of thing; it’s called The Daily Byte and it’ll help you improve your coding skills every day by solving a single question each day. Every day you’ll get a problem delivered to your inbox in an order that makes sense and encourages learning. If you sign up for premium you get a solution to the previous day’s problem including a detailed explanation and solution including time and space complexity. I recommend joining the annual tier, but if you can’t you can still sign up for free to just get the questions. Here’s the link if you wanna check it out, I hope to see you join! https://thedailybyte.dev/
    2
  1015. No problem :) and I’ll add that problem to my list!
    2
  1016. Anytime Hrithik!
    2
  1017. Thanks so much happy to hear the explanations are helpful!
    2
  1018. Thanks for the suggestion I'll see what I can do!
    2
  1019. this question is labeled as "easy" but I don't necessarily think it should be. I don't think the labels on LeetCode mean much tbh
    2
  1020. Oof yeah that’s tough keep working hard though and it’ll work out!
    2
  1021. Thanks Anuja! I would just suggest doing their most frequently asked questions on LeetCode! If you're open to joining the Discord server I'd be happy to discuss more / give more advice there. Thanks so much for your support!
    2
  1022. thank you i appreciate the kind words and i'm happy to know that you enjoyed this kind of vid!
    2
  1023. Hopefully this video helped!
    2
  1024. already watched his return vid soooo good
    2
  1025. Thanks Justin!!!
    2
  1026. daro d thanks! And if you’re debugging and have the capability to run your code then yes they will!
    2
  1027. thank you so much i'm happy to hear you enjoyed!
    2
  1028. Hey Mohammed thanks for sharing! Looks like you and I had a very similar experience, but don't worry I'm sure you're going to end up getting something even better!!! Best of luck and lmk if there's anything I can do to help you!
    2
  1029. Thanks Atif!!!
    2
  1030. Charlie Xiao thanks Charlie I appreciate the support!
    2
  1031. Haha thanks buddy, make sure to message me after and let me know how the studying is going!!! Good luck!!!
    2
  1032. anytime! Glad you enjoyed it :)
    2
  1033.  @ferringxor  Join my Discord if you're looking for advice I'd be happy to try and help however I can, if not best of luck tomorrow!!! Also, an interview on a Saturday?????
    2
  1034. It's all about practice! I recommend attempting and solving a certain number of problems each day when you're actively studying
    2
  1035. Sandip Bhaumik I think that should work fine! Give it a go and see what happens! :)
    2
  1036. you got it! :)
    2
  1037. Sourish Roy it’s on my list!
    2
  1038. Thanks! Yeah :( I def recommend getting premium if you can it's worth it!
    2
  1039. Thanks and best of luck! :)
    2
  1040. i just found the video on your hard drive
    2
  1041. thanks Jack and I think learning the patterns is the most important thing initially and then you can worry about speed/memory!
    2
  1042. Anirudha Talmale I’ve uploaded every day for like the past 10 days???
    2
  1043. anytime thanks for the support Avishek!!!
    2
  1044. haha thanks Rohan!!!
    2
  1045. Thanks for sharing Atif and I totally agree not everything will go our way in life so all we can do is be positive and learn from those experiences :)
    2
  1046. Care to explain the O(n) solution for us?
    2
  1047. banger vid steve
    2
  1048.  @AwesomAJ  I literally just uploaded another video that uses a priority queue if you're interested in checking it out here's the link! https://www.youtube.com/watch?v=trFw8IDw2Vg
    2
  1049. Algorithm Implementer thanks!
    2
  1050. Kunal Nain thanks Kunal I really appreciate it!!!
    2
  1051. i blame vim 🤣
    2
  1052. Priyanka Gokhale - Bapat anytime thank YOU for supporting me! If you need help learning this stuff from the beginning be sure to check out the interviewing service I created it’ll take you through a 12 week curriculum to make sure you’re familiar with the most common interview topics https://thedailybyte.dev/?ref=kevin
    2
  1053. Congrats that’s awesome I’m so happy for you!!! Looking forward to hearing from you in the Discord server :)
    2
  1054. Mohammed Nadeem anytime Mohammed thanks so much for supporting my channel!
    2
  1055. John Kirk thanks John! And the background noise was actually my roommate cleaning up after dinner!
    2
  1056.  @jlecampana  Haha thanks and don't pay attention to the labels they're all subjective! I actually think I already have a video on that problem if you wanna check it out! And anytime, thank YOU for your support!!!
    2
  1057.  @jlecampana  I'll check it out thanks for the suggestion!!!
    2
  1058. I appreciate the concern, but don't be worried about me I'm good! I've been pretty consistent in the gym and I think I'm actually gaining muscle (and therefore weight) despite what it might look like on camera haha
    2
  1059. check the description of the video!
    2
  1060. Hey Mike I actually recently made a Patreon account and one of the tiers for $2 is an invite to my private discord channel where you can contact me for advice directly. You can also talk to other members of the channel about previous interview experiences etc. If you're interested in joining here's the link: https://www.patreon.com/KevinNaughtonJr if you have any questions lmk!
    2
  1061. thanks so much Matt i really appreciate the kind words! i totally agree, we're so lucky to be in nyc and we have to remember not to take it for granted. as always i appreciate your support on my vids <3
    2
  1062. good one J
    2
  1063. Anytime!
    2
  1064. thanks for watching! :)
    2
  1065. it's ok these problems are hard! And no it took me time and a lot of practice if you need help check out my Patreon page: https://www.patreon.com/KevinNaughtonJr
    2
  1066. atif tirmizi thanks Atif as always I appreciate the support!
    2
  1067. Thanks Ayeman!
    2
  1068. Mr. Mystiks you’re welcome to leave the optimized space solution here
    2
  1069. daro d thanks and that’s one of the points of their service!
    2
  1070. daro d yes you could use a global as well I just think using globals (generally speaking) is discouraged
    2
  1071. daro d I think it’s something you can discuss with your interviewer and go from there. You can give them both options and ask what they prefer
    2
  1072. Thanks!
    2
  1073. Thank you! I'm happy to hear my video was helpful. Good luck on your phone screen and lmk if there's anything I can do to help you prepare!
    2
  1074. nishant singh thanks Nishant! If you like my explanations be sure to join the interviewing service I created https://thedailybyte.dev/?ref=kevin I recommend joining a premium plan if you can!
    2
  1075. hahah thanks Neal! Yeah there's a lot of ways to explain it but whatever makes sense :)
    2
  1076. thanks for taking time out of your day to support my content :)
    2
  1077. It's a greedy approach where we use two pointers to continuously look for a container that would hold more water than we have currently found
    2
  1078. I think that should be fine. I normally use something like Integer.MIN_VALUE so that the first time I calculate an area it's guaranteed to be larger and for error checking i.e. if at the end of the function if it's still equal to Integer.MIN_VALUE there's probably a problem.
    2
  1079. Thanks Jovan :)
    2
  1080. Vivek Panchal if you’re having trouble with problems like this check out The Daily Byte! https://thedailybyte.dev/
    2
  1081. Anytime!
    2
  1082. this was a great vid
    2
  1083. Thank you so much Daniel I'm so happy to hear the videos are helpful and thanks for helping spread my channel I really really appreciate that it helps me a lot!!!!
    2
  1084. I’d first watch my video that I have on system design to learn the basics then check out https://github.com/donnemartin/system-design-primer, grokking the system design interview, and read designing data intensive applications
    2
  1085. Thanks Dom I really appreciate it!!!!
    2
  1086. hi melkey
    2
  1087. yep just disguised :)
    2
  1088. Awesome! I hope to see you there! Here's the link if you need it: https://www.patreon.com/KevinNaughtonJr
    2
  1089. they are PAIN (but v important)
    2
  1090. sorry had to report the vid cuz the title contains "rust' omegalul
    2
  1091. thanks! and yes i always forget it's nought/naught 🤣
    2
  1092. Thanks for the comment Jennifer, hope to see more in the future from you!!! :)
    2
  1093. Prakad Alpha thanks Prakad and anytime!
    2
  1094. Thanks Sohbet I'm happy that my video helped :)
    2
  1095. Thanks and anytime Atif!
    2
  1096. Happy to hear we’re not alone in our thinking best of luck with whatever decision you make!!!
    2
  1097. Those questions are tough don't beat yourself up!!!! Thanks for letting me know Frank that's an awesome idea for a video I'll see what I can do!
    2
  1098. Dream Builder thanks!!!
    2
  1099. Ashish Subudhi anytime! If you like my explanations sign up for the interviewing service I created https://thedailybyte.dev/?ref=kevin I recommend joining the annual tier
    2
  1100. i still think a cs degree is valuable for other reasons/going to college in general butt you're right you can def learn to code on your own
    2
  1101. to see if the character I'm at is a letter!
    2
  1102. Thanks Atif, and thanks for the continued support :)
    2
  1103.  @atift5465  :')
    2
  1104. thanks for watching and GL!
    2
  1105. i had effectively 0 knowledge! if i could go back in time i wish i learned things earlier, but honestly things have worked out so far for me and i'm sure they will for you too. hindsight is always 20/20, best of luck! :)
    2
  1106.  @achxr  np and you can do it!!
    2
  1107. Thanks Ayeman!
    2
  1108. Yep :) good points though in your comments!
    2
  1109. Thanks Justin I hope you're finding this channel and the repo helpful!
    2
  1110. Because that's the language I've used the longest/I'm most comfortable coding it/I like to torture myself
    2
  1111. john apatsidis anytime John and thanks!!!
    2
  1112. yeeee
    2
  1113.  @Garensonic  I'm sorry to hear that Garen but don't worry something good will come just have to keep working hard! :)
    2
  1114. I did the more recent vids' audio quality is much better
    2
  1115. anytime and best of luck on your interview lmk how it goes!!!
    2
  1116. sacs tanxiang anytime and congrats on getting the offer super happy for you!!! :)
    2
  1117. Thanks Saravanan same to you!!
    2
  1118. I'm not sure about any particular books or websites but I would recommend trying to trace it on paper I think that helps!
    2
  1119.  @saravanansarangan7035  Happy to help :)
    2
  1120. ty Kenneth ♥️
    2
  1121. Thanks!!!
    2
  1122. scrapy Koko if you’re writing it in eclipse make sure that you’re calling the function you wrote in your main function and that you have print statements
    2
  1123. Thanks so much! Don't worry about having trouble with these problems, they're tough to solve! I actually just launched an interviewing service to help with this exact kind of thing, it's called The Daily Byte: https://thedailybyte.dev/. Joining my service will definitely help you understand how to solve these problems on your own by teaching you one problem at a time in an order that encourages learning. Each day you'll get a problem delivered to your email inbox and if you sign up for premium you'll get solutions the following day including a detailed walkthrough of how to solve the problem as well as an explanation of the runtime and space complexity. I'd join the annual tier if I were you! I hope this helps!!!
    2
  1124. LOVE IT
    2
  1125. Tony P haha these questions are tough Tony!!! Don't beat yourself up :)
    2
  1126. Thanks Keshav :)
    2
  1127.  @valerenegoh6125  if you subscribe for the year now you will not get charged again a year later and yes you will get 365 days worth of questions and more benefits that are listed on the site
    2
  1128. Thanks Aditya and sure I can try and do that!
    2
  1129. Shalini Negi amazing can’t wait to see you join :)
    2
  1130.  @maximtheconqueror  Thanks for letting me know Carlos!
    2
  1131. I make sure I understand the problem enough to explain it and thanks!
    2
  1132. Thanks Ashish!
    2
  1133. Anytime I'm happy it was helpful! :)
    2
  1134.  @jak0495  That's what they call it
    2
  1135. haha I'm sure it was!!!
    2
  1136.  @eviljigglypuff2329  try finding a simple python class online and see how you like it :)
    2
  1137. I think trying to get referrals always works best
    2
  1138. Thanks Anurag! Any reason why it's better to deal with the interface Map as opposed to just making it a HashMap? Also yeah it's redundant since Java 8 I think I've been trying to be better about it! Thanks for the info!!!
    2
  1139. Jamsrandorj Smile haven’t gone back and looked at it again yet maybe I’ll make it my next problem I solve haha
    2
  1140. Hahah yeah sometimes it's a little inconsistent...I would just try to make sure your algorithm is "efficient" and not worry too much about how many ms it takes to run :)
    2
  1141. thanks and I'll see what I can do for you :)
    2
  1142. definitely recommend the mic! The cloudlifter helps boost the gain from the mic which is pretty necessary from my understanding so yes I think you'd prob need it (or another similar device)
    2
  1143.  @MartiinWalsh  anytime!
    2
  1144. Hey Kumaran I'll see what I can do!
    2
  1145. thanks Swati!
    2
  1146. I'll add it to my list!
    2
  1147. You got it!
    2
  1148. Dean all good!
    2
  1149. Sometimes struggling is good! If you're making progress it might be worth trying to figure it out on your own...otherwise I think after you've spend ~45 minutes on a problem (about the length of a real interview) then you can look at a solution
    2
  1150. probably, but it can never hurt to try and help :)
    2
  1151. Nice that's awesome!!!
    2
  1152. That's ok it happens just keep working at it!
    2
  1153. i think there are jobs for pretty much any technology, just pick some and learn them super well
    2
  1154. i'm gonna try sparking some joy thanks J
    2
  1155. Pretty much what I said, just like to write down things I want to learn and / or get done, it feels good to cross things off a list!
    2
  1156. Good one to know!
    2
  1157. Thanks and ahhhh you're right!! Good catch I just fixed it I hope this video was helpful!
    2
  1158. the music is key
    2
  1159. Thanks Prakad I still laugh when I watch it too and I've looked at it like 40 times hahaha
    2
  1160. it's so good
    2
  1161. Yep, thanks for the definition!
    2
  1162. tyty and gl in your 2nd year and beyond! :)
    2
  1163. I think using LeetCode as that notebook is enough!
    2
  1164. is delicious (yes)
    2
  1165. very true
    2
  1166. Sharmila Baskaran anytime happy to hear it was helpful!
    2
  1167.  @bhopalsingh4102  right
    2
  1168. Anytime Abdelrahman! It definitely depends on the company but I imagine a lot of them do. Either way, still can't hurt to apply :)
    2
  1169.  @abdelrahman2348  Definitely I think like I said you should know one language really well (so that you can interview in that language) and definitely check out LeetCode because those are the kinds of questions that most companies ask during the interview process. Let me know if you have any other questions! If you're still in undergrad, I'd def suggest trying to LeetCode questions sooner rather than later
    2
  1170. haha good to know I'll keep making tree problem videos then :)
    2
  1171. Anytime Atif! :)
    2
  1172. atif T. Haha thanks Atif and in retrospect the problem makes sense to me but during the video I was so lost haha
    2
  1173. thanks!
    2
  1174. Steven Curran have a month off before I start my new job :)
    2
  1175. thanks Swapnil :')
    2
  1176. chilling Matt hope you're doing well buddy thanks for checking out the vid! :)
    2
  1177. should be fixed in more recent vids
    2
  1178. xavier cho thanks Xavier hope to see you sign up :)
    2
  1179. I'll see what I can do!
    2
  1180. hahah there's nothing too it you can do it too!!! Anything you need help with in particular?
    2
  1181. i think you have to find what works best for you. degrees aren't required to work as a swe, but some people like the structure. once you get an interview for a company everyone is on the same playing field regardless of their background, etc. find what works best for you to learn and grow as an engineer and stick with it
    2
  1182. That's amazing congrats! Thank you so much! I do know someone who recently interviewed for the Google APM program I can ask them more about their process if that'd be helpful and we can discuss in the Discord server. How does that sound to you? Here's the link to join: https://www.patreon.com/KevinNaughtonJr and don't worry I'll keep the videos coming! :)
    2
  1183.  @atift5465  Anytime!
    2
  1184. uwaish khan anytime!
    2
  1185. Hey Dikshith thanks! I'd be happy to talk with you! If you're willing to join the Discord server (check the link in the description) that would be the best place to do so, I hope to see you there!
    2
  1186. Swapnil Shukla anytime happy it was helpful!
    2
  1187. you can do it!!!
    2
  1188.  @jlecampana  Thanks!!
    2
  1189. Fernando Takeshi Sato haha lets hope they don’t
    2
  1190. hahah that's hilarious. Thanks so much, I really appreciate it I'm happy you're finding the videos helpful. lmk if I can do anything to help you!
    2
  1191. Surendra hahaha
    2
  1192. I'll see what I can do!
    2
  1193. Ayush choukse anytime!
    2
  1194. haha thanks Divya!
    2
  1195. good things take time keep at it!
    2
  1196. Kanika Dawar anytime! If you need help with interview prep be sure to check out the interviewing service I just released The Daily Byte. I recommend joining the annual tier! https://thedailybyte.dev/
    2
  1197. Kanika Dawar you got it :)
    2
  1198. thank you!! :)
    2
  1199. Thanks Aaron :)
    2
  1200. appreciate you Jack hoping to make casual content like this <3
    2
  1201. Liz Rose thanks Liz!
    2
  1202. i hope so
    2
  1203. thanks Rolando get to it!!!
    2
  1204.  @ajr1791ze  Thanks!
    2
  1205. Thanks! I've been thinking about doing that...maybe I'll start doing that soon
    2
  1206. Thanks Shubham! I'm happy to hear my video was helpful :)
    2
  1207. thanks for checking it out :)
    2
  1208. Thank you so much! It's hard to keep track of all the requests that come in for questions...I actually made a Discord server and one of the channels is specifically for requesting questions to be solved, but I'll see what I can do. Thanks for your support!
    2
  1209.  @ajr1791ze  Anytime and that's great keep it up!
    2
  1210. What topic should I talk about in my next video?
    2
  1211. thanks Heli :)
    2
  1212. Thanks for the input, I'll try and start doing some harder problems!
    2
  1213. neosapien247 ITS TRUE!!!
    2
  1214. M (in the runtime) would be the maximum size that an individual word can be because in the worst case we'll have to run through all those M characters for each of the words
    2
  1215. Thank you so much! I'm doing well thanks I'll be uploading again next week!
    2
  1216. deepak jain thanks for explaining :)
    2
  1217. if i can do it so can you!!
    2
  1218. Anytime, I hope it was helpful!
    2
  1219. HI ANNIE
    2
  1220. Abdelrahman Ibrahim anytime and thanks for watching!!! I mentioned some tips in a previous video of mine but side projects, reaching out to companies in unique ways, referrals etc. Otherwise try redoing your resume and reapplying or applying under different emails!
    2
  1221.  @abdelrahman2348  Anytime and potentially, I'll see what I can do but I'm guessing there's some overlap with LeetCode :)
    2
  1222. Hahah I hope that's a good thing?!!?
    2
  1223.  @khurshidallam3966  hahahah in that case let's keep solving these crimes!!!! :)
    2
  1224. totally agree thanks for watching Kenny :)
    2
  1225. Jeff!!! I tried it once when it first came out it was pretty good!
    2
  1226. Anytime Lakshmi, thanks for the support! I think removing the '-'s before should work too and then we wouldn't have to worry about the '-'s in the loop I think :)
    2
  1227. Working on it don't worry
    2
  1228. anytime and i'll add it to the list
    2
  1229. rafael uresti anytime!
    2
  1230. Thanks! If you need help with these kinds of problems be sure to sign up for the interviewing service I created! https://thedailybyte.dev/?ref=kevin I recommend joining the annual tier if you can!
    2
  1231.  @cnaught0802  CAN'T WAIT COURT
    2
  1232.  @mayankdevnani894  Awesome idea Mayank, I'll bring it up with Court!
    2
  1233.  @seekheart2023  I'll see what I can do!
    2
  1234. Did you end up getting it? LMK if I can help with anything!
    2
  1235.  @saicharan8675  Awesome happy to hear it! I'll try my best to do that sometimes it slips my mind! I actually just uploaded another video if you're interested in watching the latest one! https://www.youtube.com/watch?v=cQX3yHS0cLo&feature=youtu.be
    2
  1236. it's all good there will always be people who will dislike vids so don't sweat it and anytime Mohammed :)
    2
  1237. Anytime and thank YOU I really appreciate the support :)
    2
  1238. we're trying
    2
  1239.  @divyeshkumarbalar7732  Anytime!
    2
  1240. Hey Apratim, yes I totally agree. The solution I provided is exponential
    2
  1241. WE BACK
    2
  1242. Dom YOU'RE MY BOY DOM WE'RE BACK BABY
    2
  1243. That's why I tell people to not pay attention to the difficulty LeetCode tags problems with because it's all relative
    2
  1244. I'll check it out and see what I can do! :)
    2
  1245.  @jlecampana  Always happy to help :) thanks for your support as always!
    2
  1246.  @jlecampana  I'd love to see you as a Patron! I'd love to do a mock interview with you! :)
    2
  1247.  @jlecampana  awesome! Can't wait!
    2
  1248. Hey Neal thanks for reaching out! I would def recommend LeetCode for prep. If you wanna discuss more feel free to join the Discord channel: https://www.patreon.com/KevinNaughtonJr
    2
  1249. I think it probably depends on the level you're at honestly...but if you can buy both that's probably best. If you can only pick one, I'd probably choose EPI
    2
  1250. I NEVER UNDERSTOOD HOW "Y" COULD BE A VOWEL TBH
    2
  1251. Second
    2
  1252. Yeah i don't love it either...i think interview questions, in my opinion, should be super simply and easy to explain because you want to test someone's coding abilities not math abilities / other random things they throw into problems
    2
  1253. I'll see what I can do thanks for the suggestion!
    2
  1254. Valentin Giorgetti the start up I worked for downsized and cut half the people and I was the youngest and newest engineer they made it clear it was nothing I did wrong
    2
  1255. 👍👍👍
    2
  1256. thanks so much and just got busy :)
    2
  1257. Thanks Atif! Helper functions are a good thing! I just think it probably depends no the problem :)
    2
  1258. Thanks for the thoughtful response Atif! Yes I totally agree having a couple opportunities in my first year out of school definitely helped me get exposed to a lot of different technologies, architectures, languages, etc.
    2
  1259. Haha thanks that sounds like a great resolution to me! Thank you so much for all the support and let me know if there's anything I can do to help you prepare for your interview!
    2
  1260. Mohammed Almukhtar anytime Mohammed thanks so much for your support!
    2
  1261. Athul Pramod thanks Athul I’ll see what I can do!
    2
  1262. It needed to be done
    2
  1263. Thanks so much!!!
    2
  1264. deep pande thanks and thanks for sharing your solution!
    2
  1265. Haha why no recursion?!?!
    2
  1266.  @youssefhussein3128  ty for supporting my content! and i'm glad i can help motivate you, keep working hard it always pays off <3
    2
  1267. Kinjal Jain hey Kinjal, anytime and thanks for sharing!!! I'll add those problems to my list and see what I can do :)
    2
  1268. 28
    2
  1269. Happy to hear it! :)
    2
  1270. Nice!
    2
  1271. SWANTAN BARUA RRL is not a valid input because we’re told the string we’re given is balanced
    2
  1272. thanks Jason! :') ♥️
    1
  1273. Anytime Dhruv happy to hear the video was helpful :)
    1
  1274. Personally, I don't know much about this course and therefore can't really speak to if it's good / worth it or not. Part of me kinda wants to make a course, but idk if people would find it helpful or want to purchase something like that...what are your thoughts?
    1
  1275. Anytime Casey!
    1
  1276. From what I've seen yes
    1
  1277. Eric Goto yeah it looks pretty funny haha
    1
  1278. yoooooooo
    1
  1279. Abhishek Kumar TRUE!!! Good stuff :)
    1
  1280. You've got it :)
    1
  1281.  @kunal_chand  I'll try to do some more DP problems then
    1
  1282. i think you need to decide what your number one goal is and do the things that will help you prioritize that goal. i do think that learning things related to interviews are valuable for software engineering though
    1
  1283. Rajat Semwal thanks! If you need help with these kinds of problems I strongly recommend signing up for a premium plan on the interviewing service I created where I teach you how to solve these problems! https://thedailybyte.dev/?ref=kevin
    1
  1284. thanks Rahul happy it made sense :)
    1
  1285. thanks Melkey! shoutout trash
    1
  1286. Anytime! Definitely, I'll shoot you an email and we can find a time to connect!
    1
  1287. Pratik Kulkarni thanks!
    1
  1288. anytime Shubham thank YOU for supporting my channel it means a lot to me!
    1
  1289. Hey Nilanjan I'll see what I can do thanks for the suggestion!
    1
  1290. Good call, I should've done that!
    1
  1291. dark vader thanks!
    1
  1292. oh yeah
    1
  1293. Nice and thanks! Hope you're enjoying your lunch :)
    1
  1294. Hey! Yes I can definitely do that. I'll try to do another tree problem soon! If you have any specific problems about trees that you'd like to see please let me know
    1
  1295. haha thanks :)
    1
  1296. Not sure off the top of my head tbh...think I'd have to see the solution you're proposing to really give an answer sorry if that's not super helpful :(
    1
  1297. Thanks Mohit!
    1
  1298. Manish Tiwari which problem is that?
    1
  1299. it definitely takes time and practice is key. I'd recommend signing up for the interviewing service I created https://thedailybyte.dev/?ref=kevin it'll teach you all the most popular interview topics and questions in a way that makes sense and that encourages learning. I'd recommend joining the annual tier if you can!
    1
  1300. Sateesh Tata anytime and thanks Sateesh!
    1
  1301. Thanks Pooja and don't worry I will :)
    1
  1302. Faraz thanks Faraz I hope you enjoyed it!
    1
  1303. Nice Ralph! Thanks for sharing :)
    1
  1304. Thanks! If you enjoy my explanations i recommend joining a premium plan on the interviewing service I created! https://thedailybyte.dev/?ref=kevin
    1
  1305. Kakarot11 will do!
    1
  1306. Yogesh Kurane anytime
    1
  1307. I'll see what I can do, thanks for the suggestion Naresh!
    1
  1308. What can I do?
    1
  1309.  @abhaytiwari6411  haha thanks Abhay :)
    1
  1310. Shoot me an email and let's set up a time! Don't worry about it Conor you're gunna get something even better!
    1
  1311. Harini Jeyaraman I’d love to help! Check out the tiers on my Patreon page and join whatever will help you most! https://www.patreon.com/KevinNaughtonJr
    1
  1312. I think you can do that but then somehow have to also pass a comparator so the heap knows how to organize elements
    1
  1313.  @pigflying4514  Right yeah we need both i.e. 1. a max heap and 2. a comparator
    1
  1314. Really great tips clement low key think this is your best vid
    1
  1315. yeah wish they gave me more :(
    1
  1316. Anytime! I'm happy they're helping you!!!
    1
  1317. happy i was able to help, thanks for watching :')
    1
  1318. thanks so much! :)
    1
  1319. I'll see what I can do! I've actually gotten this exact question during a real interview and I gave a O(n^2) solution that they accepted (I also think that might be the best you can do, but I'm not 100% sure)
    1
  1320. Chandler Luo VO?
    1
  1321.  @ChandlerLuo  I haven't interviewed with Amazon in years so I honestly am not sure
    1
  1322. haha luckily the computer survived
    1
  1323. omg i found it
    1
  1324. Arthur Damm thanks Arthur!
    1
  1325. thanks Edgard!
    1
  1326. thanks!
    1
  1327. thanks Sumit and if you need help check out my Patreon page: https://www.patreon.com/KevinNaughtonJr
    1
  1328. Thanks Yi!
    1
  1329. Anytime!
    1
  1330. Thanks Dom! I can't wait to hear where you land after graduation I know it's going to be somewhere good!!!
    1
  1331. I'm sorry :( I kept trying to figure out the "white noise" so i tried turning down my mic's sensitivity but I'll turn it back up
    1
  1332.  @MohammedJavid-jz8vi  You've got it Javid!
    1
  1333.  @kuppurajkarthik  I'll add it to my list! Do you have the problem numbers?
    1
  1334.  @SatyanarayanaGokavarapu  I've got a video on that one: https://www.youtube.com/watch?v=21OuwqIC56E
    1
  1335. wooo thanks Yi :)
    1
  1336. Thank you and sometimes I forget to mention time/space complexity sorry about that, if you like my explanations and need help with interview questions like this check out the interviewing service I created https://thedailybyte.dev/?ref=kevin I'd recommend joining the annual tier if you can! (there's time/space complexity mentioned in each of the solutions :) )
    1
  1337. thanks!
    1
  1338. Thanks Andrew I'm so happy to hear that!!! And don't worry I'll keep the videos coming :)
    1
  1339. Haha I'd love to that'd be so cool!!!
    1
  1340. Nice!
    1
  1341. Thanks Royston!
    1
  1342. Thanks and yes that sound about right to me :)
    1
  1343. Thanks Pranav!
    1
  1344. Ousman D I did too
    1
  1345. thank YOU for watching the video
    1
  1346. anytime
    1
  1347. Antime Salonee! I hope you found the video helpful!
    1
  1348.  @saloneerege2006  Happy to hear it and I will don't worry!
    1
  1349. anytime Faraz!
    1
  1350. Don't worry a fix for that is coming soon :) thank you for supporting the service Ivan!!!
    1
  1351. Thanks Mohak!!!
    1
  1352. you got this :)
    1
  1353. Thanks so much! If you're preparing for interview especially large companies/FAANG and you like my explanations I strongly recommend signing up for the interviewing service I created: https://thedailybyte.dev/?ref=kevin I'd join the annual tier if you can :)
    1
  1354. definitely! there are tons of people who work at google who are self taught or have gone to bootcamps. i think in general most companies today care less if you have a cs degree
    1
  1355. Maulik Sakhida thanks for the extra info Maulik definitely good clarification!
    1
  1356. yes, awesome suggestion! We can also use an integer array to track the occurrences of each of our 26 characters :)
    1
  1357. anytime Ankit thank YOU for supporting my channel!
    1
  1358. thanks! If you like my explanations be sure to join the interviewing service I created https://thedailybyte.dev/?ref=kevin I recommend joining a premium plan if you can!
    1
  1359. Rohan Dhekne I'll add it to my list!
    1
  1360. Coding tech no idea tbh
    1
  1361. I'll try to do some of those, thanks for the suggestion!
    1
  1362. Nilufa Islam hey! If you need help prepping for your interviews check out my Patreon page where I offer tons of services to help people prepare :) https://www.patreon.com/KevinNaughtonJr
    1
  1363. Nilufa Islam Anytime! I hope to see you join :)
    1
  1364.  @ronaldmackee3401  Nah I think we're talking about the same thing and it's hard to understand my tone because it's just a message but I don't want you to think I'm trying to prove you wrong or be mean or anything, but I believe building a heap is O(N) time. It's kinda mind blowing and you can look it up but from what I understand the general idea is that yes it takes O(logN) time to insert into a heap but the 1st insertion is constant time (because there are no elements in the heap...the 2nd insertion almost takes constant time...same for 3rd, 4th, 5th, etc...you eventually reach a point where it's it starts looking less like constant time and more like logN time so the runtime to build the heap is O(N) here's a link that will involve math but might help: https://stackoverflow.com/questions/9755721/how-can-building-a-heap-be-on-time-complexity (when I first learned about this it blew my mind). LMK your thoughts!
    1
  1365.  @ronaldmackee3401  Big O def is always worst case and I totally agree with your logic that it sounds like it would make it O(NlogN) but according to math I don't think that is a tight asymptotic bound (which I could reason with the math but not sure i can :( ). I'll have to do some more reading and hopefully I can understand it better then. It definitely seems like building a heap should be O(NlogN) but according to a ton of resources online it can be done in O(N)
    1
  1366. Thanks Jay, anytime! If you need any help please be sure to let me know!
    1
  1367. anytime Yi!
    1
  1368. THE BEST TYPE OF SQUAD
    1
  1369. Thanks and I will don't worry! :)
    1
  1370. Anytime Noushin!
    1
  1371. thanks for subbing and glad you enjoyed :)
    1
  1372. Anytime!
    1
  1373. hahah insane. Hope this was helpful if you were having trouble with it but something tells me you got this one just fine e:)
    1
  1374. thanks!
    1
  1375. just launched some merch check it out! :) https://teespring.com/stores/kevin-naughton-jrs-store
    1
  1376. Anytime dude <3
    1
  1377. thanks!
    1
  1378. Thanks Paul!!!
    1
  1379.  @treyquattro  Thanks Trey :)
    1
  1380. YOU CAN'T STOP ME J
    1
  1381. drop money on buy Fuzz?
    1
  1382. Hey Sarang congrats on getting an interview with Google that's amazing! If you need help preparing for your Google interview check out my Patreon page: https://www.patreon.com/KevinNaughtonJr
    1
  1383. Hahah I hope you get in (but not cuz I want your paycheck!!!) best of luck!!!
    1
  1384. Anytime! Thanks for your support!
    1
  1385. rahul singhai thanks Rahul and you got it!
    1
  1386. Thanks Prageeth!
    1
  1387. Aravindh Saai Ravichandran anytime! Check out the interviewing service I made if you need help with understanding problems like this https://thedailybyte.dev/?ref=kevin I’d join a premium plan if you can!
    1
  1388. imo i don't think you need a masters (or phd) unless you're interested in doing research/going into a specialized field like AI research, etc. if i found a job, so can you :) but with that said, if you're interested in getting a masters/wanna go for it! i just don't think i'll ever cuz i don't think it's necessary for what i'm looking to do in the field (at least right now)
    1
  1389. Anytime! That's awesome that you decided to join a gym. For me I think the gym is really good for my mental health...lets me blow off steam when i need to and othewise it's a good place for me to just think and reflect on stuff. That's an awesome quote and I totally agree...I know our time will come we just have to keep working hard! Thank you for sharing!!!
    1
  1390. Arno Claude thanks Arno!!!
    1
  1391. anytime Jonathan :)
    1
  1392. Anytime I hope it was helpful! :)
    1
  1393. Thanks Justin and anytime!
    1
  1394. Amit Maurya thanks Amit!
    1
  1395. jlstr anytime!!! Glad you enjoyed :)
    1
  1396.  @atift5465  Definitely, it's all about practice and anytime Atif thanks for your continued support :)
    1
  1397. you're crushing it dude really enjoying your content keep it up!
    1
  1398. Yeeeeeee
    1
  1399. devansh same
    1
  1400. That's awesome Pratik, nice work!!!
    1
  1401. Good point, really depends on that underlying algorithm like you mentioned. Off the top of my head, in Java, I believe it's using quick sort or some hybrid between quick sort and tim sort so I don't believe we'd be using extra memory but correct me if you think I'm wrong :)
    1
  1402.  @noushinb4671  I hope it was helpful Noushin!
    1
  1403. Thank you so much and thanks for the suggestion, I'll see what I can do!
    1
  1404. Thanks and anytime I’ll see what I can do!
    1
  1405. Same here! Check out my Patreon page for the tier that’d be the most helpful for you! https://www.patreon.com/KevinNaughtonJr
    1
  1406. Anytime thank YOU for the support!
    1
  1407. great vid Cole definitely think I need to work on the shutting down part at the end of the day
    1
  1408. Hey Zoufishan! I just saw that, I'm sending you an invite now :)
    1
  1409. Thanks!
    1
  1410. haha no way that's amazing
    1
  1411. thanks!
    1
  1412. Thanks Anshika! If you like my explanations be sure to join the interviewing service I created to help people learn the most popular interview questions and topics! https://thedailybyte.dev/?ref=kevin I recommend joining the annual tier if you can! :)
    1
  1413. Thanks!
    1
  1414. Yeah I kinda disregarded what I thought to be the follow up about not using extra space. If you've got a solution without extra space I'd love to hear it!
    1
  1415.  @amitagarwal9572  hmmmm I think that makes sense to me? Sorry I'm a little tired right now, but I trust you :)
    1
  1416. Yeah it's kinda nuts
    1
  1417. Thanks!
    1
  1418. Bolat Dinc I will thanks for the support Bolat!!!
    1
  1419. sarvesh chavan thanks Sarvesh! Diagrams can be tricky but I’ll see what I can do!
    1
  1420. thanks Paco!! :)
    1
  1421. LOVED Berlin it was so cool!!!
    1
  1422. thanks Nick and definitely it's so easy to switch between devices I love it
    1
  1423.  @AwesomAJ  haha all good no worries!
    1
  1424. anytime and I'll see what I can do!
    1
  1425. Thanks!
    1
  1426. Anytime! I hope this was helpful!
    1
  1427. thanks Rafael
    1
  1428. Thanks for letting me know and thanks for subscribing :)
    1
  1429. thanks!
    1
  1430. woooo happy to hear that :)
    1
  1431. Thanks Vinit and anytime! I hope you enjoyed the video!
    1
  1432.  @thestarinthesky_  shout-out Carly
    1
  1433.  @MrNitisharya  thanks!
    1
  1434. thank you i really appreciate the kind words!
    1
  1435. they're hilarious 🤣
    1
  1436. Hey Rony thanks for reaching out! Consider joining the Discord channel: https://www.patreon.com/KevinNaughtonJr we can discuss there and I'd be happy help you however I can!
    1
  1437. Anytime and thank you! I'm looking forward to talking in the Discord channel :)
    1
  1438. Chase Thorpe anytime dude
    1
  1439. Good Wish thanks!
    1
  1440. Brian Goldfarb I’ll put it on the list
    1
  1441. Faraz Anytime Faraz thanks for the support!
    1
  1442. Anytime Akshay! I hope you enjoyed it! :)
    1
  1443. Check out my Patreon page I offer tons of services to help people make sure they're prepared for their interviews! https://www.patreon.com/KevinNaughtonJr
    1
  1444. Tanmay Singh thanks and anytime! :)
    1
  1445. Anytime happy to hear you found it helpful
    1
  1446. xMhnd thanks!!!
    1
  1447. Thanks Deshmukh!
    1
  1448. Hey Saketh, might be a long shot but is it possible that it's the music? I put it really low so it's not distracting. Thanks for the advice!
    1
  1449.  @sakethram1765  Thanks for letting me know. Can you give me an example of a time where you hear it so i can look into it?
    1
  1450. Noooo don’t tell me that!!! I hope you’re staying safe dude!
    1
  1451. Muhammad Farhan thanks Muhammad :)
    1
  1452. Thanks Naveen!
    1
  1453. ty Deni :)
    1
  1454. i should've lined it up :P
    1
  1455. it is, but you can do it!
    1
  1456. thank you :')
    1
  1457. Da Zhang thank you!!!
    1
  1458. anytime!
    1
  1459. relative line numbers are interesting to jump to lines i just use :line_number but maybe i'll try relative line numbers and see what i think
    1
  1460. Thanks :)
    1
  1461. Yeah really should have said that my fault!
    1
  1462. Scala?! I've never used it
    1
  1463. you're the goat Jason ♥️
    1
  1464. Arno Claude big meme fan
    1
  1465. Hahaha thanks Nick :)
    1
  1466. ty for watching! :)
    1
  1467. Cory Catherall thanks Cory!!! :)
    1
  1468. Thanks so much Yo! Super happy that my explanation made sense :)
    1
  1469. That's what's actually helping us walk through the different combination of containers (the left and right form the start and end of our container respectively).
    1
  1470. thanks for reaching out!
    1
  1471. made a vid on that! Just wanted to let you know if you haven't seen it yet :)
    1
  1472. Onion thanks dooooood
    1
  1473. Soon
    1
  1474. Sorry for the late response, Off the top of my head...I think it's possible that that causes a problem because then we will always place the current element in the map with j++ but you're welcome to test it out and let me know! Thanks for the support :)
    1
  1475. Prakad Alpha anytime Prakad glad you enjoyed!
    1
  1476. anytime Jenz! :)
    1
  1477. Thanks for the kind works Shwetz and anytime! :)
    1
  1478. ty for supporting me and my content!!
    1
  1479. That's amazing congrats!!! I normally discuss those kinds of things in my Discord server if you're interested in joining there's a link in the description. Otherwise, is it a phone screen or onsite interview?
    1
  1480.  @mohitsaini9148  Yes $2 membership is to join the Discord server, higher memberships like "Phone Screen" and "Onsite" will get you mock interviews and collaborative problem solving sessions with me if that's of interest to you :)
    1
  1481.  @mohitsaini9148  Anytime and awesome I can't wait to talk more there!
    1
  1482.  @compton8301  Anytime thanks for your support :')
    1
  1483. thanks!
    1
  1484. you won't get the correct answer if you do (unless you declare the int as a global variable)
    1
  1485. Always nice when something from class comes in handy!!!
    1
  1486. Rishabh Sinha anytime! If you need help with interview prep and like my explanation sign up for my interviewing service The Daily Byte! I suggest joining the annual plan https://thedailybyte.dev/
    1
  1487. haha thanks Ben :)
    1
  1488. dude your b roll is unreal i gotta learn
    1
  1489. No worries and yeah tree problems are tough
    1
  1490. Jahan Khan hahaha you’re hilarious J
    1
  1491. Thanks Aaron!!!
    1
  1492.  @jlecampana  Of course! Thank you I appreciate the kind words! Sometimes stuff is just out of your hands and maybe I didn't do as well as I thought I did, you never know with these things...congrats on getting interviews with FB and Google that's amazing! It's tough to get in but I know you can do it just keep working hard and lmk if there's anything I can do to help you prepare!!!!
    1
  1493. Check out my Patreon page! Might be a tier that you can join that would be helpful for you :)
    1
  1494. Yeah so far it’s been awesome, no complaints
    1
  1495. Anytime thanks for the support
    1
  1496. FUZZ
    1
  1497. Thanks!
    1
  1498. Pratik Dekate thanks Pratik happy to hear that :)
    1
  1499. thanks!
    1
  1500. Thanks Eugene and anytime! I'm super happy to hear my channel has been helpful for you :')
    1
  1501. You could but it just seems kinda overkill to only store 1 variable in my opinion
    1
  1502. Good idea!
    1
  1503. Thanks and will do! :)
    1
  1504. thanks Dean!!!
    1
  1505. I missed you guys too! Happy to be back!!!
    1
  1506. WOOOOO YEAH I'M BACK!!!!
    1
  1507. Soooo true I was close with a couple profs and they were very helpful and yes leetcode early for sure
    1
  1508. Riju Ban LOVE IT
    1
  1509. anytime!
    1
  1510. Anytime Marline I hope you enjoyed the video!
    1
  1511. I would suggest reviewing common mistakes that can be made in a program like off by one errors in loops, null pointer exceptions, etc etc
    1
  1512. Anytime! Lmk if you have any other questions!
    1
  1513. Definitely! Check out my Patreon page I offer tons of services to help people prepare for their interviews! https://www.patreon.com/KevinNaughtonJr
    1
  1514. jatin gupta thanks for the suggestion!
    1
  1515. agreed
    1
  1516. I'll see what I can do!
    1
  1517. Haha thanks Nurrizky :)
    1
  1518. thanks Jason glad to be back :)
    1
  1519. You can always write thing iteratively or recursively!
    1
  1520. Thanks Raghvendra!!! :)
    1
  1521. Thanks Grayson I really appreciate it and don't worry I'm not going anywhere! New video is uploading now so get ready to check it out. Thanks so much for your support!
    1
  1522. thanks Pooja! :)
    1
  1523. thank you for coming and checking out the vid i really appreciate it and i'm happy you enjoyed :)
    1
  1524. Anytime!
    1
  1525. Anytime!
    1
  1526.  @ChiragKava  I'll try to keep it in mind for future vids!
    1
  1527. I tested my code against "0" and "0" and it passes :)
    1
  1528. Thanks Rahul!
    1
  1529. Will do Tito lmk if you have any other suggestions!
    1
  1530. If you have the choice and don't feel more comfortable with either one I def suggest python, I just use Java because I'm the most comfortable with it and used it the most but I think python is definitely better to interview with generally speaking
    1
  1531. yep!
    1
  1532. Same here!
    1
  1533. Thanks so much!
    1
  1534. Kimer Seen anytime :)
    1
  1535. :')
    1
  1536. Thanks Parshuram!!!
    1
  1537. I think so
    1
  1538. ty Namanh ♥️🥹
    1
  1539.  @dephc0n1  Anytime!
    1
  1540. ty 🫡
    1
  1541. Haha I FINALLY remembered!!! Awesome I'm happy to hear the solution made sense :)
    1
  1542. thanks!
    1
  1543. great vid Steve :)
    1
  1544. i think some companies might care about this especially if you don't have prior experience because they don't have other things to judge you with, but it really depends on the company
    1
  1545. anytime :)
    1
  1546. thanks! Check out this repo I have still haven't put all my solutions there though so just a heads up: https://github.com/kdn251/interviews
    1
  1547. Thanks for sharing! An iterative solution is definitely awesome to help avoid stack overflows!
    1
  1548.  @UCZpV0fIOlZsL5lj8StLDWSA  true
    1
  1549. thanks! If you like my explanations be sure to join the interviewing service I created https://thedailybyte.dev/?ref=kevin I'd recommend joining the annual tier if you can!
    1
  1550.  @WhatIsThisAllAbout  thanks :)
    1
  1551. Thanks Min! :)
    1
  1552. Thanks for providing such valuable info and advice Meta! Excited for more vids to come!
    1
  1553.  @jak0495  You got it J$
    1
  1554. Richard Lin thanks Richard and don't worry I will!
    1
  1555. thanks!
    1
  1556. Nikhil Pandey thanks!
    1
  1557. haha thanks and I hope so that'd be awesome!!!
    1
  1558. Thanks!
    1
  1559. thanks!
    1
  1560. Yi Cai NO PROBLEM
    1
  1561. so real i love it
    1
  1562.  @chanhiukiadmission  Headaches aren't good I'll see what I can do about that problem! :)
    1
  1563. Thanks Aswin and honestly I think it varies regardless your level of experience...i kind of think the level of difficulty you get is up to chance...but for system design interviews I think the more experience you have the more they'll expect from you!
    1
  1564.  @aswink1505  anytime
    1
  1565. It is :( RIP
    1
  1566. Thanks Shane!
    1
  1567. Anytime John! I'm trying to figure out what people like best. You'd prefer no background music? Any particular reason why? Is it the music choice? Is it harder to hear me? I'd love to hear why!
    1
  1568.  @kde6769  Thanks for the input! Yeah I'm trying to figure out what works best still maybe next video I'll try no music while I'm talking
    1
  1569.  @Nakapeesh  Thanks!!!
    1
  1570. That's totally a normal feeling and I think it's important to realize that! As a junior developer companies are expecting to train you and teach you! My advice would be to relax and be honest...ask questions when you don't understand something and tell people when you need help (after you've tried solving the problem on your own so you can tell them what you've tried). LMK if you have any other questions or if there's anything I can do to help!
    1
  1571.  @st1ncubus  Great advice Pawan I think you touched on some important points :)
    1
  1572. I’ll see what I can do! Thanks for the feedback!
    1
  1573. ohhhh yeahhhhh
    1
  1574. thanks Deependra I appreciate the support! :)
    1
  1575. Johnny Leonardo anytime Johnny super happy I’ve been able to help you! Best of luck tomorrow lmk how it goes and I hope to see more comments from you in the future :)
    1
  1576.  @madisoncool1  Thanks for the feedback! I'll be sure to make more videos like this then :)
    1
  1577. That's a good idea maybe I'll make a video about that :). Thanks for the advice!!!
    1
  1578.  @indraalapati989  I would say it really depends on the stack of the company you'll be working at but it can never hurt to know those things!
    1
  1579. Thanks Ramon!!!
    1
  1580. Anytime! I hope this was helpful!
    1
  1581. love you dawg ♥️
    1
  1582. A max/min heap is a priority queue just based on value! I don't think javascript has a heap library :(
    1
  1583. <3
    1
  1584. Yes you could but you're right you'd have to do it iteratively I believe!
    1
  1585. haha thanks Casey!!!
    1
  1586. thanks Neet!! and good to know i'm not alone haha :)
    1
  1587. totally agree there's a lot being evaluated when you interview not just solving the problem correctly and efficiently...and you're right, sometimes there are factors that are out of your control and that could be why you don't get the job!
    1
  1588. :')
    1
  1589.  @aashrith95  I had an onsite with them back in June but I didn't end up getting it
    1
  1590.  @genki316  Awesome, I'm hoping to see you there :)
    1
  1591. thanks so much for checking it out Tru! :D
    1
  1592. gotta support our friends!! :)
    1
  1593. Hey Bhavik, thanks for the suggestion! I'll see what I can do!
    1
  1594. Nice!
    1
  1595. Thanks!
    1
  1596. Thanks Spark!!!
    1
  1597. it's so important to keep learning and congrats on the offers!
    1
  1598. Anytime!
    1
  1599. Anytime! Unfortunately, I don't think I'm going to upload the same video without audio but maybe you can try watching with no sound and put on the captions? Sorry about the music, I'm still trying to decide if I should include it in the videos or not (I feel like some people might get bored just hearing my voice?). If I do decide to use music I'll try to make sure it's pretty quiet and not distracting, sorry if it bothered you!
    1
  1600. I was VERY worried haha
    1
  1601. Will do!
    1
  1602. thanks and same haha
    1
  1603. thanks Jason!! :)
    1
  1604. Don’t sweat it just keep working hard!
    1
  1605. Anytime!!! I'll see what I can do :)
    1
  1606. Thanks Nick and yeah hopefully they give me a few more!
    1
  1607. Anirudha Talmale thanks!
    1
  1608. So smart!
    1
  1609. John Smith anytime!
    1
  1610.  @waterislife9  Anytime! If this helped you, you should definitely check out https://thedailybyte.dev/ :)
    1
  1611. I honestly don't think they'd expect the O(n) solution. I agree I think it's not obvious at all and kinda overkill
    1
  1612.  @goyatmandeep  I definitely think it depends on the question, but it can never hurt to do better :)
    1
  1613. Should be fixed on newer vids :)
    1
  1614. Usman Bashiru thanks Usman and it’s not dumb, don’t sweat it! :)
    1
  1615. It is but hopefully you found this video helpful! If you like my explanations be sure to join the interviewing service I created https://thedailybyte.dev/?ref=kevin I recommend joining a premium plan if you can!
    1
  1616. John awesome can’t wait to see you join :)
    1
  1617. Thank you! If you find my explanations helpful be sure to sign up for the interviewing service I created https://thedailybyte.dev/?ref=kevin I'd recommend joining the annual tier if you can!
    1
  1618. We don't need to do any stripping in the solution I provide! The idea is that we are building our reversed value. So we iterate through our given number while it is larger than 0. At each iteration we are getting the last digit and adding it (along with the weight that it holds i.e. ones place, tens place, hundredths place, thousandths place, etc) to our reversed integer. Then we truncate the last digit by saying "x /= 10" so that 1. our loop terminates at some point and 2. at the next iteration we of our loop we are evaluating the "next" digit. Hopefully that makes sense!
    1
  1619. really appreciate this comment, tysm for the kinds words :)
    1
  1620. Mohit Garg anytime! If you need more practice with interview prep I highly recommend signing up for premium on The Daily Byte https://thedailybyte.dev/
    1
  1621. Congrats on getting those onsites Vrezh, that's amazing! I offer services on my Patreon page to help with onsite interviews if you're interested. Hope to see you there!
    1
  1622. Thanks Abhay!!!!
    1
  1623. Juliet George thanks Juliet! If you need help with these problems sign up for the interviewing service I made https://thedailybyte.dev?ref=kevin I recommend joining the annual tier :)
    1
  1624.  @qianqianwu7302  Awesome happy to hear that!
    1
  1625. Hey I have a few services and things I offer people to help! Send me a dm on Twitter @kevinnaughtonjr and we can talk about what might be best for you!
    1
  1626. ahhh this is so exciting!!! Best of luck Tina!!!
    1
  1627. Anytime thanks for the support! :)
    1
  1628. Yeah the question was kind of weird
    1
  1629. Anytime and thanks for the suggestion Dhrubo! Is there a problem on LeetCode like that?
    1
  1630. ty Rox ♥️
    1
  1631. Anytime Kevin!
    1
  1632. i'll put it on my list!
    1
  1633. nosoyyotampoco thanks!
    1
  1634. Thanks!
    1
  1635. very raw very real, appreciate the content
    1
  1636. thanks :D
    1
  1637. thanks so much! If you need help with more questions like this check out the interviewing service I created https://thedailybyte.dev/?ref=kevin I'd recommend joining the annual tier if you can!
    1
  1638. thank you!
    1
  1639. wian haha I’m jk
    1
  1640. anytime thanks for supporting the channel! :)
    1
  1641.  @aakashdabas9490  Yeah I really wanna make some DP videos soon thanks for letting me know!
    1
  1642.  @NatureCall11  I'm planning on doing DP stuff soon thanks for the advice!
    1
  1643.  @GauravKumar-by1yt  Awesome thanks Gaurav!
    1
  1644.  @bonkers4490  Awesome thanks for letting me know Akshat!
    1
  1645.  @piyush12121  Perfect I'll try to keep them around this length then thanks for the input Piyush!
    1
  1646.  @weiqing2582  Awesome thanks for letting me know and anytime! :)
    1
  1647. Neel Deshpande anytime! :)
    1
  1648. alan s anytime!
    1
  1649.  @ragingpahadi  Anytime! If you like my explanations check out the interviewing service I created https://thedailybyte.dev/?ref=kevin
    1
  1650. Most companies (especially larger ones) won't expect you to know a particular language they'll trust you to pick up whatever language is necessary once you start the job. So with that being said, focus on whatever language/technologies you feel comfortable with/you want to learn!
    1
  1651. There will be more coding videos soon don't worry :)
    1
  1652. thanks!
    1
  1653. Naman Gupta anytime
    1
  1654. right!
    1
  1655. Of course! If you join the appropriate tier we can find a time to chat and set up a study plan. I look forward to chatting! https://www.patreon.com/KevinNaughtonJr
    1
  1656. Nageen Chand if you need help learning how to solve these kinds of problems sign up for the interviewing service I created https://thedailybyte.dev/?ref=kevin I’d join the annual tier if you can!
    1
  1657. thanks!
    1
  1658. thanks!
    1
  1659. Kamal Mahmud right! BFS I think you'd have to do a little bit more string manipulation so dfs is prob better (if you can incur the overhead of the recursion)
    1
  1660. Anytime! I find getOrDefault() super useful!
    1
  1661. Thanks!
    1
  1662. thanks!
    1
  1663. Thanks Shane I really appreciate it!
    1
  1664. thanks!
    1
  1665. Anytime!
    1
  1666. That's ok good things are coming, I know it! Just keep working hard and lmk if there's anything I can do to help!!!
    1
  1667. great tips Theo!
    1
  1668. Thanks Yoni I really appreciate the kind work and don't worry I'm going to keep the videos coming! <3
    1
  1669. Thanks Amit!
    1
  1670. Thanks!
    1
  1671. haha thanks Amit!
    1
  1672. If you wanna get in contact with me check out my Patreon page and join the tier that you think will be the most helpful for you! https://www.patreon.com/KevinNaughtonJr
    1
  1673. without sorting i think you need to compare each cookie with each child prob
    1
  1674. thanks Pooja!
    1
  1675. They'll be coming soon! Thanks for letting me know what will be helpful!
    1
  1676. Thanks and yes just have to keep trying and working hard!
    1
  1677. Thanks Adrian hopefully the channel keeps growing :)
    1
  1678. Anytime! I'll see what I can do. If you like my explanations be sure to sign up for the interviewing service I created: https://thedailybyte.dev/?ref=kevin I recommend joining the annual plan if you can!
    1
  1679. Thanks Vasanth! Don't worry I'll keep them coming :)
    1
  1680. idk how I missed this YOU'RE MY BOY DOM
    1
  1681.  @philrod1  ahhh gotcha and no worries :)
    1
  1682. yes definitely! i discussed being blocked with people offline about these tests. with integration tests specifically since it involves other teams' services there isn't always an "easy" way to get unblocked from team members since they don't usually have in depth knowledge about these other binaries. integration tests are also pretty heavy tasks in general and take a lot of time to spin up and maintain
    1
  1683. thanks Melkey :)
    1
  1684. varun gupta awesome :)
    1
  1685. Anytime! Hmmm, I'll have to think about that and get back to you...
    1
  1686. Yep I definitely think sorting is a valid solution I just wonder if we could do better than nlogn with constant space 🤔
    1
  1687. Thanks!
    1
  1688. Anytime Suryansh and thank YOU for the support!!! :)
    1
  1689. Thanks Darshan! And in more recent videos I think I'd toned down the volume more :)
    1
  1690. Thanks Kapil! :)
    1
  1691. Anytime Dom lmk if there's anything else I can do to help and good luck! :)
    1
  1692. I'm not sure honestly...I have always used remove() I've seen some people use poll() and as far as I know the only difference is that you'll get null back if there are no values I think?
    1
  1693. Thanks :)
    1
  1694. Thanks Mert I really appreciate it!
    1
  1695. thanks Melkey appreciate you dude :)
    1
  1696. Me too :)
    1
  1697. 0110100111000010101001
    1
  1698. really awesome video Meta! Thanks for sharing!
    1
  1699. ohhhhh are they? I think they're sewed in but i guess i could still replace them somehow???
    1
  1700. Haha anytime Nick!!
    1
  1701.  @gfunkonthecheesetree  anytime!
    1
  1702. Thanks Madhav!!!
    1
  1703.  @PoojaSumann  I'll add it to the list!
    1
  1704. Definitely! Any ideas?
    1
  1705. Nice!
    1
  1706. Anytime dude
    1
  1707. thanks!!!
    1
  1708. niharika patil thanks really appreciate that! If you need help with interview stuff be sure to sign up for the interviewing service I created, The Daily Byte! I recommend joining the annual plan https://thedailybyte.dev/
    1
  1709. I'll see what I can do!
    1
  1710. anytime!
    1
  1711. thanks John! i'm excited to get coffee or sm!
    1
  1712. Vaibhav Singh thanks Vaibhav!
    1
  1713. haha thanks for letting me know i forget sometimes but yeah i guess people can check out the link in the description if they wanna reread the prompt. Up to you! Maybe try switching it up and see how it goes?
    1
  1714. hmmm that's an interesting idea
    1
  1715. just be careful cuz I think using lastIndexOf() will make your runtime O(N^2)
    1
  1716. thank you!
    1
  1717. oh yeah
    1
  1718. Thanks Yi! Really appreciate you plugging my videos in the discussion sections :)
    1
  1719. Don't be sorry I'm always happy to answer questions! As far as I know there's not a real benefit aside from the fact that I imagine a HashMap in Java has more memory allocated to it to begin with than an array of 26 elements
    1
  1720. thank YOU i really appreciate it! :)
    1
  1721. Thanks man really appreciate it! Good luck and lmk if there's anything I can do to help you prepare, you got this!!!
    1
  1722. thank you so much!
    1
  1723. it will teach you using a guided curriculum for the first 12 weeks!
    1
  1724.  @nikitasurya9034  hey! Feel free to reach out to me on twitter and we can chat @kevinnaughtonjr. I'd also recommend checking out my patreon page and signing up for the tier that'd be the most helpful for you https://www.patreon.com/KevinNaughtonJr
    1
  1725.  @marmikshah8373  hey! Send me a DM on instagram or twitter and we can talk about howi could try and help: https://twitter.com/KevinNaughtonJr
    1
  1726. Hey Kumaran, that's an awesome idea, thanks for the suggestion!
    1
  1727. Thanks David!! Where's my update?! What's going on with you buddy?
    1
  1728. Hey Praneeth, good catch you're totally right I misspoke!
    1
  1729. I think you're right! Honestly, I really think if you got the O(nlogk) solution I think you're in great shape, but if you can offer an O(n) solution it can only help :) thanks for the comments!
    1
  1730. haha happy to hear that thanks man! That's amazing congrats!!! Keep working hard it always pays off! I'll take a look at your email now :)
    1
  1731. It's definitely similar but by using the heap we get a slightly better runtime (which is O(nlogk)) because we limit the heap to size k
    1
  1732. In all my interviews I've had no problems using built in data structures / sorting algorithms. I'd be different if I was asked to implement a heap as my question or asked to sort an array of numbers, then I highly highly doubt I'd be able to use those things
    1
  1733. Thanks and don't worry I will!
    1
  1734. Félix Cuello thanks!!!
    1
  1735.  @cbjueueiwyru7472  Totally agree. Thank you so much I really appreciate it. If there's anything I can do to help you prepare for the onsite in the meantime lmk!
    1
  1736. Currently I don't think I'll do but maybe I can make a video on something like that!
    1
  1737. Thanks Darshan!!!
    1
  1738. Thanks Jack miss you bud!
    1
  1739. thanks :)
    1
  1740.  @YogaandLivingwithChai  Awesome I'm looking forward to hearing about the problems you'd like help with, hopefully you can join the Discord channel and put them there? At a quick glance, for the problem you left above, I'm guessing you can use the modulo operator to place each of the elements accordingly? Let me know your thoughts and if that makes sense! pseudo code might follow a form like this for list in lists for item in list add item to list number (item index % list's length)
    1
  1741. Sophia ATN exciting to see you sign up!!! :)
    1
  1742. That's ok! I've never been asked to mathematically prove something during one of my interviews. I think a good way to try and prove that something is optimal is proof by contradiction...i.e. try think of a case where it won't yield the best possible result. I hope that helps!
    1
  1743.  @quocanhhbui8271  awesome lmk how it goes and thank you!
    1
  1744. Anytime and I'll check it out and see what I can do thanks for the suggestion!
    1
  1745.  @jaivasani3773  Thanks for the advice Jai! Yeah I always mean to but I end up forgetting in a lot of the videos I've been trying to be better about it though!
    1
  1746. Thanks!
    1
  1747. anytime and will do!
    1
  1748. haha anytime :)
    1
  1749.  @AwesomAJ  Thanks for letting me know AJ :) I didn't even know that. Yeah, same here every place I've interviewed at has never really told me I can't use a particular language
    1
  1750. 👍
    1
  1751. Nice!
    1
  1752. That's awesome congrats on getting the interview with Google! If you're interested in doing a mock interview check out the "Onsite" tier on my Patreon: https://www.patreon.com/KevinNaughtonJr
    1
  1753. hahahah
    1
  1754. all good!
    1
  1755. thanks Charlie appreciate that
    1
  1756. thanks!
    1
  1757. wow that was amazing so happy it went so well for you :')
    1
  1758. seventh
    1
  1759. i like to think of it as "building mass"
    1
  1760. nvm is nevermind
    1
  1761. Nice! I used it to ensure that I return the first unique character. If there are 2 unique chars in the string I need to make sure I return the first one!
    1
  1762. Gabriel Segatti thanks dude I really appreciate you supporting the channel!!!
    1
  1763. Harpreet Singh if you need help with other stuff interview related be sure to check out The Daily Byte! https://thedailybyte.dev/
    1
  1764. Jairo Rubio thanks Jairo really appreciate that and don’t worry I will!
    1
  1765. Ajay Puri awesome I hope to see you sign up and anytime! :)
    1
  1766. thanks and NO WAY go violets/bobcats/whatever NYU is!!!!
    1
  1767. Yuhe Wang thanks Yuhe :)
    1
  1768. just updated thanks for letting me know
    1
  1769. hahah tysm Pooja!! and i hope both of our plants can survive our parenting lol
    1
  1770. haha thanks Sai and maybe soon :)
    1
  1771. Nishad anytime :)
    1
  1772. yes it was I think I was trying to just explain the logic more
    1
  1773. thanks so much and put in the work and I'm sure you will!!!
    1
  1774. Arvind Verma anytime Arvind! Thanks for watching!!!
    1
  1775. Thanks!!!
    1
  1776. You got it, thanks for the suggestion!
    1
  1777. anytime and yep you're totally right :)
    1
  1778. hi
    1
  1779.  @ThatBigGuyAl  of course! thank YOU for supporting my content!
    1
  1780.  @bilalmolani7268  DM me on Instagram/Twitter and let's talk about it https://www.instagram.com/kevinnaughtonjr/ https://twitter.com/kevinnaughtonjr
    1
  1781. Abdoul Barry currently it’s java but we’re expanding to support other languages as well!
    1
  1782. Swagato Chatterjee I never know what to say to start the vid tbh
    1
  1783. Why haven't you already?!?! We need to make our collab video Court I keep texting you about it!!!!
    1
  1784. My roommate is!!!
    1
  1785.  @Gersssy  Nice and anytime thanks for supporting the channel! hmm sounds like an interesting problem thanks for sharing :)
    1
  1786. thanks!
    1
  1787. Revert Chrispy22 anytime :)
    1
  1788.  @dansal2002  anytime
    1
  1789. it might not be, nice code!!!
    1
  1790.  @Garensonic  Yes I believe that's why Math.abs is necessary :)
    1
  1791. Thanks Harjot really appreciate that it means a lot to me!
    1
  1792. YEEEEEEEEE
    1
  1793. Thanks Court!
    1
  1794. Haha don’t worry the candles are far enough away but rewatching I can see why it’d make you anxious haha and yes stay safe!
    1
  1795. I'll throw it on my list
    1
  1796. Jayesh Borgaonkar thanks Jayesh :)
    1
  1797. Hey Sneha, I'll put those on my list!
    1
  1798. Yi Cai scope the description
    1
  1799. As always awesome response Dom. I totally agree with you and yes staying with a company can definitely be good! Maybe it's most important to be able to realize when a company is good for your or bad for you :)
    1
  1800.  @nealpatel7696  Awesome happy to hear it went well! I've got my fingers crossed for you :)
    1
  1801. I’ll add it to my list
    1
  1802. Thanks for the suggestion Rakshit, I'll see if I can do that in future vids!
    1
  1803. So happy to hear that Vitali, thanks for the support and don't worry we'll keep the videos coming :)
    1
  1804. You're my BOY Dom
    1
  1805. pb&js are delicious
    1
  1806. Josepch Will thanks! If you need help understand and learning these questions be sure to sign up for the interviewing service I created https://thedailybyte.dev/?ref=kevin I recommend joining the annual plan if you can!
    1
  1807. Good idea! I'll see what I can do thanks for the suggestion!
    1
  1808. Woooo so happy to hear that! Thanks for letting me know Kuba :)
    1
  1809.  SUVO TechBrain  anytime! Always happy to help :)
    1
  1810. Hahha thanks!!! I'll try and keep churning them out for you guys!!!
    1
  1811. Thanks Pradosh!!!
    1
  1812. Hey Peter I'm sure you can still work your way out of that! I also have a tier on Patreon for this exact thing if you're interested in joining! A little bit of money now might help you make a lot more money, negotiation is SUPER important!!! https://www.patreon.com/KevinNaughtonJr
    1
  1813. Yeah I should probably start doing that, I do it at work not sure why I don't in LeetCode haha
    1
  1814. Thanks and I appreciate the feedback! I'd love to hear what you think is an acceptable answer and for what it's worth I've actually seen this during a real interview and the interviewer had no problem with this sort of solution!
    1
  1815.  @pizzacat69  Thanks for sharing and wow I had no idea an O(n) solution even existed tbh that's crazy
    1
  1816.  @alphabet_soup_69  haha trust me I've been there but honestly the 1 liners and stuff are def just to make it as short as possible I sure hope no one rights that in their interviews cuz it would be so impossible to read lol
    1
  1817. Can you explain what you mean by that? Is that another question?
    1
  1818. anytime!
    1
  1819. :(
    1
  1820.  @JasonFriedlander  Thanks Jason I really appreciate it. Also never forget pasquito@aol.com we will find out the mystery some day...maybe on our next trip together (we gotta plan it for real)!!!!
    1
  1821. we all came here to see me get egged
    1
  1822. John Kirk just in time for the holidays!!!
    1
  1823. WheresTheBeach013 happy to hear that :)
    1
  1824. WheresTheBeach013 thank you I really appreciate that :)
    1
  1825. hahahahahaha
    1
  1826. thank you Michael!
    1
  1827. Hey Evance, my code ended up passing all the provided test cases so I believe the solution is correct. Any reason why you think it's wrong? I'd be happy to discuss!
    1
  1828.  @ICO_ON1  anytime and thanks! :)
    1
  1829. thanks! If you need help with these kinds of problems be sure to check out the interviewing service I created The Daily Byte! https://thedailybyte.dev/?ref=kevin I recommend joining a premium tier if you can! :)
    1
  1830. Thanks and I agree let's put that work in and it'll pay off!!!
    1
  1831. Thanks so much happy to hear the explanation made sense :)
    1
  1832. I think that's a good call unless you feel comfortable in another language already
    1
  1833. Anytime! If you like my explanations be sure to check out the interviewing service I created https://thedailybyte.dev/?ref=kevin I'd recommend joining the annual plan if you can!
    1
  1834. thanks!
    1
  1835. TY NICK 🤝
    1
  1836. I'll see what I can do thanks for letting me know Arno!
    1
  1837. Anytime! Yeah definitely, wanna shoot me an email and we can find a time to talk?
    1
  1838. hahah thanks Court, can't wait for our video together!!
    1
  1839. Shrimat Kapoor https://teespring.com/stores/kevin-naughton-jrs-store
    1
  1840. good hires new grads so yes!
    1
  1841. Hey Siddhartha thanks for the suggestion I'll see what I can do!
    1
  1842. Anytime thanks for the support I really appreciate it!
    1
  1843. Brandyplays if that’s what you’re looking for you should check out the interviewing service I launched, The Daily Byte! I recommend the annual subscription: https://thedailybyte.dev/
    1
  1844. oof
    1
  1845. NICE
    1
  1846. varun gupta happy to hear that :)
    1
  1847. Thanks for sharing Ralph and yeah I think C# is pretty similar to Java it just has more libraries :)
    1
  1848. wooo happy to hear that thanks for letting me know :)
    1
  1849. I solve the questions beforehand
    1
  1850. thanks!
    1
  1851. Ayush Raj I’ll see what I can do thanks for the suggestion Ayush!
    1
  1852. yeah the layoffs are sad and I'm trying to do the things in my power to help my teammates who have been affected. I've been promoted to customer before in my career, but hopefully I'll never be promoted in that way again
    1
  1853. Nice!!!
    1
  1854. It will always be O(N) because I make sure that i gets set to j so that we only walk through the string once during our while loops. If that doesn't make sense let me know and I'd be happy to explain further!
    1
  1855.  @piyush12121  Yep! Thanks for jumping in Piyush!
    1
  1856. Anytime Pooja thank so much for your support! :)
    1
  1857. Thanks Vibhav :)
    1
  1858. Anytime and thanks Gerard I appreciate the support!
    1
  1859. Thanks Spark and yes it was absolutely incredible!
    1
  1860. Thanks Shalin really appreciate that!
    1
  1861. Thanks Justin and I'm so happy to hear that!!!
    1
  1862.  @GauravKumar-by1yt  Happy tot hear it Gaurav!
    1
  1863. asdfasf the way that we traverse the matrix is using a "graph" algorithm also the matrix can he thought of as a graph
    1
  1864. Anytime!!! Happy to hear you saw something similar :)
    1
  1865. do you have the problem number?
    1
  1866. Happy to hear that Swati and anytime :)
    1
  1867. Correct
    1
  1868. Anytime Shweta, happy to hear it was helpful :)
    1
  1869. I think there are lists you can lookup online that'll tell you the most lucrative languages, but I'd recommend just learning how to develop high quality software since demand for languages/technologies will change
    1
  1870. ty Deni! as always i appreciate the support! :)
    1
  1871. Anytime Oliver and thanks!
    1
  1872. Thanks so much super happy to hear the videos are helpful :)
    1
  1873. Thanks!!!
    1
  1874. :)
    1
  1875. thanks Jason!! :)
    1
  1876. Haha now you have to do it!!!
    1
  1877. thanks Abhinav! :)
    1
  1878. fifth also hi ali
    1
  1879. :O
    1
  1880. Thanks Anirudha!
    1
  1881. akanksha patel thanks Akanksha! If you like my explanations be sure to sign up for the interviewing service I created https://thedailybyte.dev/?ref=kevin I recommend joining the annual tier if you can!
    1
  1882. thanks Abhishek happy holidays to you too!
    1
  1883. Soon!
    1
  1884. Nice :)
    1
  1885. hahaha anything I can do to help explain?
    1
  1886.  @swantanbarua9327  Thanks Swantan and I'll put it on my list!
    1
  1887. I (personally) just think it's a bit more clear not using bit operations but that's an awesome suggestion thanks for sharing that link!
    1
  1888. Generally speaking you're normally able to use just about whatever language you want. Some companies prefer that you stick to things like Java, Python, C, etc but it's pretty much always not a problem
    1
  1889. Thanks!
    1
  1890. Thank you I really appreciate the kind works and the support! :)
    1
  1891. Thanks Alam! That def makes the problem harder :)
    1
  1892. Ashish Chourasia thanks Ashish!!!
    1
  1893. Hey Hiten thanks for letting me know I'd love to hear the optimized version if you're up for sharing it!
    1
  1894. Thanks and I will don't worry :)
    1
  1895. SANKALP TYAGI thanks and just practice!
    1
  1896.  @khurshidallam3966  Thanks Khurshid and anytime! Thanks for your support!
    1
  1897. doing good man hbu? Also the boxes behind me is where I keep all my LeetCode answers ;)
    1
  1898. Thanks Pradosh!!!
    1
  1899. Harinath Reddy Amasa anytime!
    1
  1900. thanks Don
    1
  1901. SpectatorAlius if you like my explanations check out the interviewing service I just released https://thedailybyte.dev/?ref=kevin
    1
  1902. Thanks Vinaya!
    1
  1903. Thanks!
    1
  1904. i never know how high/low to put it i always change it
    1
  1905. Really appreciate that thanks :’)
    1
  1906. Will do and thanks
    1
  1907. Anytime I hope it was helpful! :)
    1
  1908. Thanks Shubham I'm so happy to hear that and don't worry I'm going to keep the videos coming!
    1
  1909. Great idea! And yes rejected by soooo many companies
    1
  1910. Yi Cai anytime dude!
    1
  1911. Thank so much! I'd still recommend joining The Daily Byte because I think interviewing is something you should always keep up with and be practicing. Being able to interview with a company at any moment is really beneficial and landing a big job can really be life-changing. With that said, if you do want something that's faster paced (i.e. more than a problem a day) I'd suggest checking out my Patreon page and joining the tier that sounds most helpful to you (maybe the "study buddy" tier since you might want more problems/day or the "onsite" tier since you're feeling a little axious mock interview with me could help) https://www.patreon.com/KevinNaughtonJr let me know what you think :)
    1
  1912. Just a Polite Commenter awesome! :)
    1
  1913. Thank you so much! It's comments like this that make me want to help you guys as much as I can!
    1
  1914. sure!
    1
  1915. thanks!
    1
  1916. Thanks and I'll see what I can do :)
    1
  1917. Thanks Saravanan I appreciate your support!
    1
  1918. DC / AC definitely it’s always fun to scroll through a subreddit like that
    1
  1919. DC / AC definitely and thanks!
    1
  1920. I'll add them to the list Arvind! What are the problem numbers?
    1
  1921. thanks Luke and go blue :D
    1
  1922. varun gupta thanks Varun!!!
    1
  1923. Yes very similar
    1
  1924. thanks Arpit :')
    1
  1925. it's tough!
    1
  1926. Definitely thanks Zishen! :)
    1
  1927. XDTuber anytime!
    1
  1928. i don't think learning in public is important personally. i think it might help you build relationships/a brand, but the most important thing is simply learning so don't worry :)
    1
  1929. Reddevils123 basically none
    1
  1930. I guess no real reason other than the fact that I assumed random numbers would give me a "true" response faster?
    1
  1931. Jessie Gu thanks Jessie if you want other explanations like this subscribe to a premium plan on the interviewing service I just created The Daily Byte! https://thedailybyte.dev/
    1
  1932.  @prezmoten  ah gotcha, nice!!!
    1
  1933.  @khurshidallam3966  Anytime!
    1
  1934.  @khurshidallam3966  Awesome! Anytime Khurshid I hope the resources are helping :)
    1
  1935. I think if you say word.length() - 1 you won't actually be confirming that you found the last character of the word so effectively you'll be stopping a character short
    1
  1936. thanks
    1
  1937. Mohammed Abdul Khaliq thanks for supporting the channel! :)
    1
  1938. Mohammed Abdul Khaliq thanks so much I really appreciate that :)
    1
  1939. Hahah thanks man happy to help however I can! I'll most likely start uploading again next week
    1
  1940.  @FangChen  thanks!
    1
  1941. Kenan Li thanks Kenan!!!
    1
  1942. thanks Yi!
    1
  1943. this office is looking NICE
    1
  1944. Build any project/idea that interests you! The most important thing is just building in my opinion
    1
  1945. Thanks Subhikaran! I'll keep the videos coming as often as I can :)
    1
  1946. Weibang Zhang thanks :)
    1
  1947. Redouane Bali hahaha oh no you're right I did
    1
  1948. Sure and great question! So this is a "for each" loop and we're saying let's go through each array in our 2d array (a 2d array is just an array of arrays). I used "point in points" because that's what our 2d array represents...our points so therefore each item in our 2d array is a point. LMK if that doesn't make sense and I'd be happy to try and describe further!
    1
  1949.  @panzabamboo1901  Anytime and yes I would def recommend learning a lot about DS because they're the foundation of all these problems :)
    1
  1950. ronald abellano thanks Ronald!!!
    1
  1951. Anytime!
    1
  1952. anytime and thanks!
    1
  1953. Anytime Shhweta! Happy to hear the video was helpful!
    1
  1954. Thanks!
    1
  1955. Thanks Rahul :)
    1
  1956. haha thanks I love my apartment
    1
  1957. Thanks!
    1
  1958. Because you need to check the second condition even if the first if condition trips. If that doesn't make sense lmk and I'd be happy to explain further :)
    1
  1959.  @nicholaslarovere6037  Anytime!
    1
  1960. And I'm still here for you too David! Let's chat soon I'd love another update on where you're at!
    1
  1961. Anytime and thanks for the support!
    1
  1962. Thanks for the thoughtful response Dom!!! I agree sometimes it's tough to determine what is imposter syndrome and what are gaps we should try to fill. Definitely. The key is to just keep learning and if you don't know something that's ok, but make sure to read up on whatever you're in the dark about!
    1
  1963. All settled now, hope you are too!
    1
  1964. this was such an awesome vid Dorian def one of my favs so far. excited to hear more of your stories :)
    1
  1965. Yeah this stuff is hard, it's all a numbers game just have to apply to a bunch and keep interviewing
    1
  1966. Hey Sachin, anytime! I hope you're finding the videos to be helpful. Congrats that's amazing I'm so happy to hear you have a final round with Amazon! I'd be happy to do a mock interview with you if you sign up for the "Phone Screen" tier on my Patreon we can schedule a session before the 14th here's the link to join: https://www.patreon.com/KevinNaughtonJr
    1
  1967.  @sachinrodge3796  Anytime! I can probably do Thursday. Once you sign up I can invite you to the Discord server and we can finalize everything there. I'm looking forward to it!
    1
  1968.  @sachinrodge3796  Sure! Follow this link and sign up for the "Phone Screen" tier: https://www.patreon.com/KevinNaughtonJr
    1
  1969. Nice!
    1
  1970. Thanks Court!
    1
  1971. Anytime!
    1
  1972. thanks
    1
  1973. Thanks Parth and anytime! Thanks for letting me know, I'm trying to figure out the best settings for my sound :)
    1
  1974. spongebob is ESSENTIAL
    1
  1975. anytime Carlos! thank YOU for supporting my content and for the super thanks :)
    1
  1976. I'll put it on my list and see what I can do thanks for the suggestion!
    1
  1977. ty
    1
  1978. Thanks so much Nick!!!
    1
  1979. Thanks Sidney!
    1
  1980. thanks Adam and yes I totally agree it happens A LOT
    1
  1981. 100%
    1
  1982. thanks so much Anshu! :)
    1
  1983. Anytime Arpit thank YOU for the continued support!
    1
  1984. Thanks dude!
    1
  1985. thanks!
    1
  1986. Thanks Tejas, I'm happy to hear that! I'll throw that question on my list!
    1
  1987.  @djfedor  Always, thanks Stanislav!
    1
  1988. jlstr I think I've already covered this one in a video! Check it out on my channel!
    1
  1989. I'll see what I can do Maulik :)
    1
  1990. as long as you got it done! :)
    1
  1991.  @jak0495  it's waaay past my bedtime J
    1
  1992. Thanks for the kind words Raghvendra! I'm so happy to hear that!!!
    1
  1993. Thanks for the support!!! I’ll see what I can do
    1
  1994. thanks Trey!!!
    1
  1995. Anytime! If you like my explanations be sure to join the interviewing service I created where I teach you how to solve questions like these: https://thedailybyte.dev/?ref=kevin
    1
  1996. thanks!
    1
  1997. azeez taiwo I agree :)
    1
  1998. Anytime Pooja thanks I'm so happy to hear the videos are helpful!
    1
  1999. Hey Sunil, which rule is my solution not following?
    1
  2000. Thanks Trey :)
    1
  2001. For real interviewers really care about that part you think???
    1
  2002. Thanks Javid! :)
    1
  2003. Thanks and I'm pretty sure I had a vid on that problem already!
    1
  2004. Congrats!!! So happy for you!!!!
    1
  2005. I don't think it will because on each iteration you're ensuring you start from the last point you were at as opposed to starting from the beginning of the string each time
    1
  2006. Nice!
    1
  2007. interesting!
    1
  2008.  @treyquattro  ahhh ok gotcha
    1
  2009. dm anytime! If you need help with interview prep be sure to subscribe to The Daily Byte! https://thedailybyte.dev/
    1
  2010. Nope it was at will employment so they don't need to give notice
    1
  2011. Just bumped the limit if you wanna join thanks for letting me know!
    1
  2012. Yeah I wish Patreon didn’t do that you can sign up now if you want and I can refund you when they charge you next month on the first or you can just wait until the 1st to join!
    1
  2013. soundcloud if you like the songs I link them in the description
    1
  2014. Aygun Ilkhaszadeh thanks Aygun I really appreciate that!!!
    1
  2015. Yes and yes!
    1
  2016. Thanks I really appreciate the support!!! :)
    1
  2017. Thanks Heewon and thanks for the support!
    1
  2018. haha yeah and thanks!!!
    1
  2019. Thanks Amitrajit!!! I hope you enjoy the service :)
    1
  2020. Haha give yourself more credit!!!
    1
  2021. Anytime John :)
    1
  2022. Thanks you!
    1
  2023. Thanks Gokul!
    1
  2024. mandeep kharb hey Mandeep if you’re preparing for an interview I’d recommend joining the interviewing service I created it’ll help teach you the most common topics and questions https://thedailybyte.dev/?ref=kevin I’d recommend joining the annual plan if you can. I also offer tons of other services like mock interview on my Patreon page if you think that could help you too! https://www.patreon.com/KevinNaughtonJr
    1
  2025.  @nickyshweta  Hey Nicky anytime! Thanks for the suggestion I'll see what I can do!
    1
  2026.  @rajivranjan6268  I would email the recruiter and ask if there will be coding...I think it's best to just ask instead of having to guess. If it's general questions, since it's a technical manager, I'm guessing they'll wanna know how you work with teams etc. so I'd be ready for questions like "tell me about a time you had a disagreement with a coworker and how you handled it". "Do you work well with people?". "How do you manage deadlines?" "How do you prioritize work?". Stuff like that...I hope this helps and let me know if you have any other questions!
    1
  2027.  @rajivranjan6268  interesting...yeah so I guess just prepare as if you were going to do a coding interview but also be ready for other technical questions like "what is inheritance" etc. Good luck LMK how it goes!!!
    1
  2028. Mourning Raptor 3 awesome Hunter thanks for joining and can’t wait to see you upgrade! Yes! Tomorrow you will start the 12 week curriculum :)
    1
  2029. Mourning Raptor 3 thanks Hunter and that’s awesome congrats! And agreed you should always be striving for something better and be working hard to get there :)
    1
  2030. thanks!!!!
    1
  2031. i always forget 😭🤣
    1
  2032. let's goooooooo thanks so much Eliot I appreciate the support
    1
  2033. no problem!
    1
  2034. Cong Do Nguyen anytime Cong and thanks so much I really appreciate that!
    1
  2035. Justin F thanks Jus!!!
    1
  2036. Nuri Jeon anytime! :)
    1
  2037. Thanks Dhruv!
    1
  2038. thanks Adrian!
    1
  2039. Sandip Bhaumik definitely! Check out my Patreon page and sign up for whatever will help you the most: https://www.patreon.com/KevinNaughtonJr
    1
  2040. Thanks!
    1
  2041. Anytime Soumya!!!
    1
  2042. Hey Sam! Thank you so much I'm happy to hear you're enjoying the videos! A little bit...what's the online coding test exactly and when did you receive it?
    1
  2043.  @samsalgado232  Gotcha...yeah I would say to just practice LeetCode questions and chances are if you don't receive a question you've seen you'll still be able to solve it because of all the questions you've practiced!
    1
  2044.  @samsalgado232  Anytime so happy to hear you're finding my videos useful, thanks for letting me know!
    1
  2045. Deni! thanks for checking out the vid i really appreciate it buddy ♥️
    1
  2046. Thanks for letting me know I'll look into it for the next video!
    1
  2047. do we miss the lofi rap!?!?! I figured some people might hate the intro screens etc. what do you think?
    1
  2048. Pulkit Kaushik yoooo so we want the intro screens with lofi then???
    1
  2049. wooo super happy to hear that thanks so much Shrawani!!!
    1
  2050. Thanks David I just updated it nice catch :)
    1
  2051. Sagar Yadav sign up for the interviewing service I just released and you’ll learn all of them! I recommend joining the annual plan https://thedailybyte.dev/
    1
  2052. Anytime Mayank :)
    1
  2053. Thanks and anytime!
    1
  2054. I'm guessing there's a way you can do it that's similar to c where you do something like x ^= y; y ^= x; x ^= y;
    1
  2055. Thanks Soumya!
    1
  2056. basic need anytime!
    1
  2057.  @khurshidallam3966  Yep and anytime! Thanks for your support!
    1
  2058. Thanks Dmitiry!!!
    1
  2059. I actually don't know where it is from exactly...but it's called a carabiner if you wanna pick one up!
    1
  2060.  @strykerzee4309  Anytime!
    1
  2061. thanks!
    1
  2062. Thanks!
    1
  2063. I'll see what I can do. In the meantime if you need help with these kinds of questions be sure to join the interviewing service I created: https://thedailybyte.dev/?ref=kevin I'd recommend joining the annual plan if you can!
    1
  2064. thanks Pooja!! :)
    1
  2065. Nice!!!
    1
  2066. Momentum Wins depends on where you’re working, experience, and other things
    1
  2067. So happy to hear it, thanks so much for your support Arvind!!!
    1
  2068. thanks Mazhar! If you like my explanations be sure to check out the interviewing service I created https://thedailybyte.dev/?ref=kevin I recommend joining the annual plan if you can!
    1
  2069. Ankit Agarwal you’re the best thanks so much!
    1
  2070. Hey Farwa! Anytime thank you so much for the support! I'm emailing you back right now :)
    1
  2071.  @farwaiftikhar2403  Awesome :) I just sent you an invite to the Discord server!
    1
  2072. That’s amazing congrats on getting an interview with Google! I’d be happy to help you prepare! I recommend checking out the “onsite”, “phone screen”, or “study buddy” tier on my Patreon page: https://www.patreon.com/KevinNaughtonJr
    1
  2073. thanks Oscar i'm glad you liked the technical talk!
    1
  2074. sorry to hear but thanks for letting us know!
    1
  2075. thanks!
    1
  2076. Thanks Yi I really appreciate you helping spread my channel!!!
    1
  2077. Anytime I'm so happy to hear that. Let me know if there's anything I can do to help you prepare!
    1
  2078. happy to hear it and anytime :)
    1
  2079. I definitely can't off the top of my head but if I had to guess it's probably even easier in Python! I'd be happy to give you some advice maybe we can chat in the Discord channel if you're willing to join? Here's the link to join: https://www.patreon.com/KevinNaughtonJr
    1
  2080. Appreciate it! And for sure popcorn at the theatre tastes better don’t @ me
    1
  2081. thanks Rahul!
    1
  2082. thanks Pooja!
    1
  2083. Dmitry Karpenko I think if we want nlogk we can prob just adjust my solution to ensure our heap size is at most k when inserting elements
    1
  2084. Dmitry Karpenko anytime!
    1
  2085.  @jlecampana  unfortunately this is the world of interviews atm :(
    1
  2086. Thanks!
    1
  2087. thanks! glad you enjoyed :)
    1
  2088. https://screen.so/
    1
  2089. thanks so much Dorian!!
    1
  2090. Don't sweat it, work hard and something better will come your way! Best of luck!
    1
  2091. Anytime and I appreciate the support! :)
    1
  2092. good points!
    1
  2093. Flux is dope and I love that you can control stuff with nightshift now too
    1
  2094. Thanks Deshmukh!
    1
  2095. shubham jha thanks Shubham and don't worry I will!!!
    1
  2096. Thanks Keon!
    1
  2097. Thanks Johnny and yeah I try to keep it concise, clear, and to the point. My hope is that in less than 10 minutes people can understand how to do the problem at hand and hopefully understand the concept it uses to be able to solve a handful of other problems
    1
  2098. Thanks Noah :)
    1
  2099. good to know!
    1
  2100. Yi Cai anytime and DUDEEEEE can’t wait for that to drop
    1
  2101. Anytime, thanks Justin!
    1
  2102. Hey SJ yeah I see what you mean sorting with a comparator definitely could've worked too :)
    1
  2103. Daniel Tovar thanks so much dude my Venmo handle is @Kevin-Naughton-1
    1
  2104. I'll put it on my list, thanks for the suggestion Nishant!
    1
  2105. thanks for watching Nicky :)
    1
  2106. Thanks for letting me know Kuba I've been having some problems with audio and I've been trying to fix it for a couple weeks now. The problem is if I turn up my voice there seems to be some sort of white noise in the background. I'll keep looking into it sorry about that :(
    1
  2107.  @prajmus  Yeah I'll have to keep messing around with it. It's also hard for me to know what is too loud / too quiet because my volume is probably different than other peoples'. Thanks for the advice :)
    1
  2108. Thanks and definitely very good point!!!
    1
  2109. I've tried using vim binding in Intellij once and didn't love it haven't tried VS though. Do you recommend it?
    1
  2110.  @theronmansilla1676  I’ll take a look
    1
  2111.  @blasttrash  haven’t tried either
    1
  2112. Jigyasu Prakash anytime! If you need help with these kinds of problems sign up for the interviewing service I created https://thedailybyte.dev/?ref=kevin I recommend joining the annual tier if you can!
    1
  2113.  @54v11  Thank you and I'm hoping to do some whiteboarding stuff soon. I'll keep the timed assessments in mind as well!
    1
  2114.  @ethankim3283  Thanks for the suggestion I'll see what I can do!
    1
  2115. I'll add it to the list, anything about recursion in particular?
    1
  2116.  @aashrith95  Good idea I'll see if I can do that and I'll add those problem to the list thanks!
    1
  2117.  @aashrith95  Also I've done 973 if you wanna check it out: https://www.youtube.com/watch?v=1rEUgAG7f_c&t=213s
    1
  2118. thanks!
    1
  2119. What's the problem number? I'll put it on my list :)
    1
  2120. hard to say because it depends on comfortable you are with these questions and topics. If you need help preparing for these interviews I'd suggest signing up for the interviewing service I created https://thedailybyte.dev/?ref=kevin I'd join the annual plan if you can!
    1
  2121. haha thanks and yes definitely trying to!
    1
  2122. hahahah thanks Liyuan I'm sure you're waaaaay cooler :)
    1
  2123. Thanks Vikas and congrats that's amazing!!! Check out my Patreon page I have a few different options that I think could help you prepare for your Google interview!
    1
  2124. Thanks!
    1
  2125. Yep always have to keep learning
    1
  2126.  @seunghunlee6778  Oops hahaha and awesome happy to hear that :)
    1
  2127. Very similar except in this case battleships can only be placed vertically or horizontally whereas in the islands problem islands could be formed in all four cardinal directions
    1
  2128.  @aashrith95  I'd love to that's actually been on my list for a while I think it's not explained very clearly which is a shame imo. I'd be happy to add those problems to the list, what are the problem numbers?
    1
  2129. ty melkey <3
    1
  2130. Thanks Justin and anytime!
    1
  2131. Dean thanks Dean!
    1
  2132. Nachiket Lele happy to hear it! If you need help with other problems and interview prep in general be sure to subscribe to the interviewing service I created, The Daily Byte! I recommend joining the annual plan https://thedailybyte.dev/
    1
  2133. Anytime! Happy to hear it helped :)
    1
  2134. Best Sports what?
    1
  2135. I'll see what I can do thanks for the suggestion!
    1
  2136. Reused a thumbnail for this vid and yes it's true I look v sad, should probably use another one lol
    1
  2137. Thanks!
    1
  2138. About to answer you!
    1
  2139. Anytime Deepak thank you so much for the support!!!
    1
  2140. Thanks!
    1
  2141. Shikhar Saxena haha good I’m happy to hear that Shikhar!
    1
  2142. anytime!
    1
  2143. Teehee Tummytums thanks :)
    1
  2144. Thanks Tu!
    1
  2145. Anytime Tali! This is just simulating a clock and adding a minute every time, but I guess you could of also taken the valid digits and made permutations of those digits and then checked if the time you have is greater than your starting time?
    1
  2146. Thanks Keon!!! Your code is better though :)
    1
  2147. Anytime dude!
    1
  2148. thank YOU for supporting my content! :)
    1
  2149. Thanks so much Nikhil I really appreciate the kind words!!! :)
    1
  2150. thanks!
    1
  2151. ;)
    1
  2152. Anytime!
    1
  2153. Thanks Court!
    1
  2154. just seeing this, but hope you're doing ok Theo. sounds like you have a lot going on and i hope your dad/family is doing as well as possible too ❤
    1
  2155. ty!
    1
  2156. thank you!!
    1
  2157. Thanks I really appreciate that and anytime!
    1
  2158. Thanks Jon! I'm glad you enjoyed the video!
    1
  2159. Thanks Justin!
    1
  2160. anytime Faraz thanks for the support!
    1
  2161. Trey Quattro terrible, terrible people Trey
    1
  2162. Hey Garrett that's ok these questions are tricky! Sometimes it takes a little while to understand the question, but it's important to make sure you understand the question before moving forward during the interview. Half the battle is practice so make sure you're practicing! I think the other half is just being prepared and having a study plan. If you need help in either of those areas be sure to check out my Patreon page where I offer mock interviews and study plans to help people prepare for their interviews! If not, no worries and best of luck! https://www.patreon.com/KevinNaughtonJr
    1
  2163. tysm Madhav i really appreciate it! ❤️
    1
  2164. thank you! :)
    1
  2165. Thanks Yi!
    1
  2166. thanks Manish
    1
  2167. no problem
    1
  2168. Thanks I'll be sure to keep doing it!
    1
  2169. Faraz anytime Faraz!
    1
  2170.  @elgranchuy  Anytime Jesus, I hope you enjoyed it!
    1
  2171. Thanks Abhishek!!!
    1
  2172. Yep totally agree
    1
  2173. Thanks Nishad!
    1
  2174. Hey Mike I make sure to add that last element by doing while(head != null) so that we only stop iterating over the list once we've reached a null node!
    1
  2175. meaning a bit mask?
    1
  2176.  @MadeByDAY  Duly noted Dom :)
    1
  2177.  @jeff9774  Haha thanks Jeff hope you're doing well buddy I miss you we've gotta meet up soon!!!
    1
  2178.  @Timwangmusic  Oh boy working overtime?!?! Why are you working overtime?!
    1
  2179. Anytime Swagato! Best of luck lmk how it goes!
    1
  2180. Thank you!
    1
  2181. thanks Harish!
    1
  2182. Thanks happy to hear that!
    1
  2183. Thanks dude appreciate the support!
    1
  2184. That's awesome I'm so happy to hear the videos have been helpful!!! If you're interested in becoming a member of the Discord channel you can ping me there here's a link to sign up: https://www.patreon.com/KevinNaughtonJr
    1
  2185. Elon Rov Elon!!!!! What’s up?!? How was the boot camp!?!! I wanna hear everything!!!!
    1
  2186. Elon Rov congrats!!!!! And thanks! I’m happy to help however I can feel free to text me and lmk if there’s anything I can do (I mean it)!
    1
  2187. Elon Rov thanks buddy and sounds good looking forward to it!
    1
  2188. :')
    1
  2189. Thanks and yes it was amazing!
    1
  2190. Anytime I hope they're helpful! Thanks for the advice, I'll see what I can do!
    1
  2191. you got it
    1
  2192.  @RafaelBritodeOliveira  anytime!
    1
  2193. Not totally sure what you mean but it's possible!
    1
  2194. Thanks! I believe that the return 1 is necessary otherwise we wouldn't be able to actually count each island. As an alternative though we could move the +1 inside the nested for loop!
    1
  2195. Right I see what you're saying. So we can just make it the inner loop look like numberOfIslands += 1 and then call the DFS function?
    1
  2196. Hey! The problem you received was the same in this video?
    1
  2197. People request videos in our Discord channel! I'll take a look at those problems :)
    1
  2198. Do some Googling as I can't name a ton off the top of my head but I've heard GitHub is very remote friendly!
    1
  2199. Thanks!
    1
  2200. ohhh i'll have to check that out
    1
  2201. Thanks!
    1
  2202. Hey Saumadip, what do you mean by incorrect algo? I believe my code was able to pass all the test cases provided?
    1
  2203. Thanks so much Rajendra, looking forward to seeing you on Patreon!
    1
  2204. Hey Amol I've seen this movie before and it has a happy ending. Keep working hard it's going to work out for the better I'm telling you. I appreciate the kind words. Good luck and please let me know if there's anything I can do to help you prepare for your interviews!
    1
  2205. HE'S SO CUTE
    1
  2206. Anytime :)
    1
  2207. Super happy to hear that Seunghun and anytime!!! :)
    1
  2208. thanks Marco and it stands for "depth first search"
    1
  2209. devansh thanks dude
    1
  2210. daro d if it’s a global then yeah that’d work
    1
  2211. you were supposed to put the computer in the garbage disposal first!!!
    1
  2212. YOU'RE THE BEST ANDREW
    1
  2213. Thanks Steve! Step 2 is a great place to be 🙂
    1
  2214. Thanks and I won''t don't worry :)
    1
  2215. Anytime Rohan!
    1
  2216. I've uploaded every day for the past 10 days or so!!!!!
    1
  2217. thanks Pooja :)
    1
  2218. thanks!
    1
  2219. Totally agree
    1
  2220. man oh man, i don't wanna be original jeff
    1
  2221. Interesting...definitely sounds like an interesting idea and that it might be able to work :)
    1
  2222. Thanks Pradosh and anytime, I'm always happy to help! I'd love to hear your ideas!
    1
  2223. antyime Yi :)
    1
  2224. Thanks Vignesh and don't worry I'll keep the videos coming :)
    1
  2225. thank you for the kind words and for supporting my content i really appreciate it :)
    1
  2226. I think that could work too!
    1
  2227. it's on my list don't worry
    1
  2228. hahah thanks!
    1
  2229. Thanks for the suggestion Garen! I'll see what I can do!
    1
  2230. I personally think LeetCode is the best but you can also check out hacker rank for other questions and pramp for mock interviews! If you need help preparing or want to practice mock interviews etc I offer those services too here: https://www.patreon.com/KevinNaughtonJr
    1
  2231. Nice idea!!!
    1
  2232. Hey Garen thanks so much I'm happy to hear that the videos have been helpful! I believe there are a few sites that offer mock interviews I also offer them on my Patreon if you're interested! https://www.patreon.com/KevinNaughtonJr
    1
  2233. as someone who also has impostor syndrome, it's comforting knowing someone as senior as yourself also deals with it :)
    1
  2234. 100%
    1
  2235. thank you!
    1
  2236. anytime thanks for watching :)
    1
  2237. Thanks Anna and don't worry about it it's a tough problem just keep working at it!!!
    1
  2238. I have a premium subscription (which I recommend getting I think it's def worth it) but I'm not sure off the top of my head if this is a premium problem
    1
  2239. Thanks David!!!
    1
  2240. Hey I'm happy to help!!! Shoot me an email :)
    1
  2241. thanks
    1
  2242. Thanks Yoni!
    1
  2243. Thanks Nick!
    1
  2244. Anytime I hope it was helpful!
    1
  2245. It's a tough one! Interesting modification, thanks for sharing :)
    1
  2246. Anytime! You'll be fine!!! Feel free to reach out if you want any more help / advice.
    1
  2247. check out my interviewing service if you like my explanations! https://thedailybyte.dev/?ref=kevin I recommend joining a premium plan if you can!
    1
  2248. Hey Garrett I’d be happy to help you prepare for your interview! I offer services like mock interviews and study planning for this exact kind of thing. If you’re interested in them check out my Patreon page: https://www.patreon.com/KevinNaughtonJr. It sounds like you’d be most interested in “study buddy”, “phone screen”, or “on-site” although lots of people do a combination of 2 of those 3. I hope to see you join!
    1
  2249. Abdulrahman Tolba anytime!
    1
  2250. Amlan Chatterjee just straight up explaining recursion?
    1
  2251.  @dotnetking12  Hey sorry not sure how I didn't see this comment and yes I do! You can sign up for the "Onsite" tier on my Patreon if you're interested in 1-on-1 coaching! https://www.patreon.com/KevinNaughtonJr
    1
  2252.  @pallavipandey796  I'm sorry I didn't see this comment somehow :( how did the interview go?
    1
  2253. massive congrats prime so happy for you and excited to continue watching/supporting you in what comes next :')
    1
  2254. Nick Moretto anytime Nick! Glad you found it helpful!
    1
  2255. anytime!
    1
  2256. Anytime! If you need help preparing be sure to check out my tiers on Patreon too: https://www.patreon.com/KevinNaughtonJr
    1
  2257. and me for you <3
    1
  2258. thanks Faraz!
    1
  2259. ender2999 I mean I knew I just didn’t expect their name to be on leetcode
    1
  2260. Thanks!
    1
  2261. anytime Faraz!
    1
  2262. Anytime Javid!
    1
  2263. thanks
    1
  2264. Priyansh Balyan I mention it at the end of the video
    1
  2265. Navraj Nat thanks and will do :)
    1
  2266. anytime!!!
    1
  2267. Jonathan Mazala anytime and yeah for sure this is def an intro
    1
  2268. It was awesome thanks for asking! And yeah I def wanna do some collab videos soon. Any recommendations on who you'd want me to collab with?
    1
  2269.  @ShivangiSingh-wc3gk  Nice! Sorry if the explanation wasn't clear, happy to hear you understand it now!
    1
  2270.  @jageenshukla4825  Nah we don't, the idea is that the array is sorted up to a point and therefore we leverage binary search
    1
  2271. You can do it!!!!
    1
  2272. Hey Amit anytime! Yes that's correct, thank you so much for your support!
    1
  2273. hahah thanks
    1
  2274. Thanks Vineet and will do
    1
  2275. haha thanks Ian!!!
    1
  2276. thanks Anirudha, make sure to leave it a like then :)
    1
  2277. I'll see what I can do thanks for the suggestion Eddy!
    1
  2278. got past the issues in this video and am now stuck on other issues still related to integration testing. showering always reveals the answer :P
    1
  2279. this was a good one Cole, good stuff
    1
  2280. it's a loooooot of money
    1
  2281. soledapper haha thanks dude :)
    1
  2282. daro d anytime Daro!
    1
  2283. Life Simply Rocks anytime! If you need help with more problems like this be sure to sign up for the interviewing service I made The Daily Byte. I recommend joining a premium plan if you can! https://thedailybyte.dev/?ref=kevin
    1
  2284. Anytime! I'll check it out and see what I can do :) thanks for the suggestion!
    1
  2285. Omi t these questions are hard don’t beat yourself up! If you need help with interview questions be sure to sign up for the interviewing service I created https://thedailybyte.dev/?ref=kevin I recommend joining the annual tier if you can!
    1
  2286. "I'm one shot"
    1
  2287. Martin Mystery I’ll see what I can do Martin thanks for the suggestion!
    1
  2288. smh I wish I was Nick White
    1
  2289. Harkirat Saluja anytime!
    1
  2290. thanks Arup
    1
  2291. Check the link in the description and thanks!
    1
  2292. Anytime Jayanth! Thank YOU for your support!!!
    1
  2293. Anytime and keep your head up something better will come along :) if you need help prepping for interviews/finding your next gig be sure to check out my patreon: https://www.patreon.com/KevinNaughtonJr
    1
  2294. thank you Arthur!
    1
  2295. anytime!
    1
  2296. pruthvi onkar anytime!!! Thanks for your support!
    1
  2297. These vids are too good
    1
  2298. haha thanks!!!
    1
  2299. Anytime! Thanks for watching!
    1
  2300. Thanks Faizan!
    1
  2301. Anytime David looking forward to another mock interview tomorrow! :)
    1
  2302. No way!!! And yeah it's so pretty around there!
    1
  2303.  @swagatochatterjee7104  you’re right I gotta bring back spongebob but fr philosophy is doooooope
    1
  2304. That's ok Garen it's a tough problem! Keep your head up you'll have plenty of other interviews! I think you mentioned that you have one with Amazon right?
    1
  2305. Thanks so much really appreciate that
    1
  2306. Thanks!
    1
  2307. the vids or Courtney egging me? :P
    1
  2308. Thanks Hamza!
    1
  2309. thanks Pooja! :)
    1
  2310. I do things like that on my Patreon page! https://www.patreon.com/KevinNaughtonJr
    1
  2311. BasedWorldsk8 haha thanks!
    1
  2312. Thanks Paul and anytime! Thank YOU for your support!
    1
  2313. thanks Nicky!!! :)
    1
  2314. bdc225 anytime!
    1
  2315. Yep LES. I've lived in the East Village as well, both are great! Having a roof, elevator, rec room, etc is such a luxury hard to find buildings that have it all. I think you can find some nice spots in LES, East Village, Gramercy, Murray Hill, and I'm sure there are more...I think it really depends on what you want to prioritize...do you want to be close to work? Do you want a lot of space / cheaper rent (Brooklyn might be a good choice then)?
    1
  2316. thanks Soumya!!! :)
    1
  2317.  @hushRD  it's on a monitor arm haha
    1
  2318. Phil Bowden you’d get solutions for the last 30 questions you received by upgrading to a premium plan and you’ll still be at the tree problems the only difference is that you’ll start receiving solutions
    1
  2319. what's happening exactly?
    1
  2320. ty : ' ) @gdthegreat 
    1
  2321. thanks Yi!
    1
  2322. Thanks Jennifer!!!! NO WAY!!!! Maybe I'll see you around campus sometime then, I still walk around WSP all the time. Enjoy it and ping me if you need any advice about teachers/help with classes :)
    1
  2323.  @jenniferzeng2099  Haha maybe you will!!!!
    1
  2324. kevin is just a big dummy
    1
  2325. Thanks! If you like my explanations be sure to check out the interviewing service I created I recommend joining a premium plan if you can! https://thedailybyte.dev/?ref=kevin
    1
  2326.  @Infinitely16  Anytime!
    1
  2327.  @rafalrocks  Totally agree and thanks Ralph!
    1
  2328.  @ishitarathi1186  Anytime!
    1
  2329. Thanks and anytime! I'm happy to hear you're finding the videos helpful :)
    1
  2330. Thanks Kiran!
    1
  2331. Thanks Ayush! Here it's because it's inclusive of the last step :)
    1
  2332. Happy to hear that Cristiano and anytime!
    1
  2333. you got it
    1
  2334. really? That's weird...I just checked again and it still says easy for me
    1
  2335. I totally agree! Success is a necessary ingredient sometimes. Thanks Atif!
    1
  2336. jeezradz thanks! If you like my explanations check out the interviewing service I launched https://thedailybyte.dev/
    1
  2337. I'll see what I can do!
    1
  2338.  @thekewlwaffle  Awesome thank you!
    1
  2339. Prageeth Kumara anytime Prageeth! If you’re interested in a mock interview check out my Patreon page! The link is in the description!
    1
  2340. 🥇😂😂😂
    1
  2341. Anytime! Thanks for the suggestion I'll see what I can do :)
    1
  2342. Haha you might think that based on the standup but my official title is "platform engineer"
    1
  2343. Thanks Justin and the trip was AMAZING
    1
  2344. Is that a different question?
    1
  2345. bread is essential
    1
  2346. Keenal Shah I explain lots of question on the interviewing service I launched https://thedailybyte.dev/ I recommend joining the annual tier
    1
  2347. thanks!
    1
  2348. I think it's prob fair game for either
    1
  2349. Thanks Choi I'll try to!
    1
  2350. Thanks!
    1
  2351. thanks! i normally just use the mic on the headsets i use and that works well for me :)
    1
  2352. Surendra thanks really appreciate the kind words and your support!!!
    1
  2353. WHAT'S. UP. NICKY.
    1
  2354. thanks Neet! :) ♥️
    1
  2355. Anytime I hope you enjoyed :)! Yeah I'll work on the volume sorry about that!
    1
  2356. Yes it is a LeetCode premium problem!
    1
  2357. Anytime! I hope they're helpful!
    1
  2358. Jude Ankrah the music is key
    1
  2359. So it seems!
    1
  2360. naga lakshmi yeah! Try another browser maybe?
    1
  2361.  @nagalakshmi1385  Anytime :)
    1
  2362. One day J
    1
  2363. Yes I imagine you could also use some sort of sliding window approach :)
    1
  2364. Haha thanks happy to hear it :)
    1
  2365. weiqing thanks!!! :)
    1
  2366. chandan kumar anytime! If you need help with more problems like this check out the interviewing service I created! I recommend joining a premium plan https://thedailybyte.dev/?ref=kevin
    1
  2367. Thanks Yi!!!
    1
  2368. hahahaha
    1
  2369. my server is always too small
    1
  2370. instagram: https://www.instagram.com/kevinnaughtonjr/ twitter: https://twitter.com/kevinnaughtonjr
    1
  2371. Anytime! And I’d be happy to take suggestions for other problems you want done if you have any!
    1
  2372. That’s dope thanks for letting me know super happy for you congrats!!!
    1
  2373. Anytime!!! :)
    1
  2374. Thanks Thais!
    1
  2375. thanks
    1
  2376. Thanks and check the description!
    1
  2377. Anytime I'm happy to hear the video was helpful!
    1
  2378. Anytime I'm happy to hear the video was helpful!
    1
  2379. Yeah sometimes the problem descriptions aren’t super clear unfortunately but I still think reviewing what the problem is asking for is super important because otherwise you might accidentally start solving a different problem without realizing it
    1
  2380. Thanks as always Trey :)
    1
  2381. mandeep kharb thanks! If you like my explanations be sure to check out the interviewing service I made https://thedailybyte.dev/?ref=kevin I recommend joining a premium plan if you can!
    1
  2382. Hey Naveen thank you so much I'm happy to hear that because that's exactly what I'm trying to do with these problems (and make them entertaining, hopefully)!
    1
  2383. Thank you so much! What exactly do you need help with?
    1
  2384.  @sachinnayak85  I think you need to make sure you understand every topic before moving on! Start from the basics and build up! If you need any help I'd be happy to discuss with you in the Discord channel! https://www.patreon.com/KevinNaughtonJr
    1
  2385. Anytime thanks for the support! It can be hard to find a mentor sometimes...if you're in school I think it can be valuable to look up to someone who's older than you and has taken classes that you'll take in the future. If you're still in school it's also a good idea to try and keep in touch with people in the industry (maybe people you know from school who have graduated?). Otherwise, if you're not in school, online communities can be good like YouTube or maybe there are meetups or things about engineering and you can meet people there!
    1
  2386. Anytime and thanks for the suggestion I'll see what I can do!
    1
  2387. Thank you Sandeep I appreciate the support! I'd love to hear you opinion on other videos as well :)
    1
  2388. Arindrajit Seal thanks! If you need help with interview prep be sure to subscribe to the interviewing service I created, The Daily Byte! I recommend joining the annual plan https://thedailybyte.dev/
    1
  2389. thanks!
    1
  2390. Thank you so much I really appreciate that! Love from the US :)
    1
  2391. Let me see what I can do, thanks for the input!
    1
  2392. Thanks!!!
    1
  2393. Anytime Prabhnoor, thanks for the support. I'll put that one on my list :)
    1
  2394. Shalaka Virkar thanks Shalaka! :)
    1
  2395. I'll try my best to make another! I use to drink a shake just about every day but nowadays I don't... I'm more or less just trying to maintain not really looking to gain mass atm
    1
  2396. Anytime!
    1
  2397. thanks!
    1
  2398. Raghuraman Swaminathan thanks! :)
    1
  2399. Anytime!
    1
  2400. I think you do cuz otherwise you can't guarantee that the current word is lexicographically sorted with respect to every other word
    1
  2401.  @abdelrahman2348  For the problems you're going to be asked during interviews, yes, I'd focus on LeetCode...but spring might also be good to have experience with if you know what I mean?
    1
  2402.  @abdelrahman2348  Yes :)
    1
  2403. Either is in my opinion I feel but that should work too! :)
    1
  2404. I think we need it cuz otherwise how do we remember what character we're gonna take on each iteration?
    1
  2405. Anytime! I hope it was helpful!
    1
  2406. Will do!
    1
  2407. yeah def applies to more than just tech. thanks for watching!
    1
  2408. thanks Arno :)
    1
  2409. MikePrice888 oh gosh that sounds tough but maybe next time we can try that!
    1
  2410. xavier cho love it!!!
    1
  2411. John J. Thanks John I really appreciate that :)
    1
  2412. Hmmm interesting...I'll leave you to the debugging :)
    1
  2413. Thanks Pooja!
    1
  2414. builder pattern is goated
    1
  2415. Thanks Amit and anytime happy to help!
    1
  2416.  @Mal-wk3uq  Anytime and don't worry I will! I would recommend cracking the coding interview and the elements of programming interviews!
    1
  2417. Hey! I'd recommend signing up for the interviewing service I created https://thedailybyte.dev/?ref=kevin it'll teach you all the most common interview topics and problems one day at a time through a guided curriculum. I'd sign up for the yearly plan if you can!
    1
  2418. I think I have a playlist for Apple on my channel!
    1
  2419. thanks Ashhmin!
    1
  2420. Anytime Dinesh!
    1
  2421. Thanks! I'll see what I can do :)
    1
  2422.  @savithalakshmanan2842  I'll see what I can do! In the meantime if you like my explanations and want to cover DP/graph problems sign up for the interviewing service I created https://thedailybyte.dev/?ref=kevin I'd recommend joining the annual tier if you can!
    1
  2423. Thanks Jeff! I'm happy to hear that because I was afraid that people wouldn't like this video for some reason lol
    1
  2424. Happy to hear my videos was helpful Frank, but don't stress about it it's a tough problem just keep working hard! My initial thoughts on what you're proposing is that...assuming you can't revisit cells (otherwise there would be infinite unique paths) I think it would be pretty similar except you would consider the other 2 directions as well when calculating the unique dp[i][j] and you wouldn't be returning the bottom right corner of the dp matrix anymore. Let me know your thoughts and thanks for the support Frank!
    1
  2425. Also thanks for the problem suggestion I'll see what I can do :)
    1
  2426. not sure tbh
    1
  2427. thanks Tim! we were playing team fight tactics and ori and the blind forest :)
    1
  2428. Anytime!
    1
  2429.  @zishenye3444  Ah i see what you mean...I just made a quick test file trying to print the length of a string that contains only spaces after splitting by space and it prints a length of 0 so I don't think we would actually run into the problem you're describing luckily :)
    1
  2430. Thanks Yashpreet I really appreciate that!
    1
  2431. thanks!
    1
  2432. I also just uploaded a new vid in case you're interested :) https://www.youtube.com/watch?v=XZnWETlZZ14
    1
  2433. ty and i'm so bad at it hahaha
    1
  2434. Thanks!
    1
  2435. Hey Righved, if it's not too late check out my Patreon page! Otherwise I hope it went well! :)
    1
  2436. thanks Akhil, if you like my explanations check out the interviewing service i created https://thedailybyte.dev/?ref=kevin I'd join the annual plan if you can!
    1
  2437. give it a try :)
    1
  2438. Amir LS591 anytime!
    1
  2439. Thanks Fabio!
    1
  2440. You can do it!!!!
    1
  2441. thanks Saurabh!!!
    1
  2442. Thanks for the explanation
    1
  2443. it can never hurt to apply! I say go for it!
    1
  2444. Thanks Kamlesh I'll put it on my list!
    1
  2445. no way!!!!
    1
  2446. Anytime! With all the stuff going on in the world right now, I'd suggest signing up for The Daily Byte to keep your interview skills as sharp as possible: https://thedailybyte.dev/
    1
  2447. Thanks Shery I really appreciate that and I agree! Keeping 6 months of income is a good goal!
    1
  2448. I'll see what I can do thanks Sam!!!
    1
  2449. yeah i've got that one on my list
    1
  2450. Could be a good idea if the tree is really big so you don't have to worry about stack overflows!
    1
  2451. Daniel S ok so it’s not just me
    1
  2452. Anytime I hope it was helpful :)
    1
  2453. Anytime I hope you enjoyed the video! I'll see what I can do about more graph problems in the future!
    1
  2454. yeeeeeeeeeeee
    1
  2455. anytime!
    1
  2456. Thanks Shiva and anytime!
    1
  2457. That's my girlfriend Carly :)
    1
  2458. thanks!
    1
  2459. https://amzn.to/3LCWWYK (affiliate link)
    1
  2460. i think the earlier you can take one the better it can only help :)
    1
  2461. thank you and tbh i have no opinions on them
    1
  2462.  @djfedor  Hey Stanislav sorry for the late response, not sure how I missed this comment. That's a great idea, I'll see what I can do on that thanks for the suggestion!
    1
  2463. Thanks! And yeah I gotta do that
    1
  2464. games are fun
    1
  2465. Thanks dude and super happy to hear that!
    1
  2466. nah :(
    1
  2467. Thanks
    1
  2468. I will soon just been busy. Will most likely start uploading again next week
    1
  2469. Great tips Dorian
    1
  2470. Thanks Haoming and anytime!
    1
  2471. I'll see what I can do thanks for the suggestion!
    1
  2472. The interviewing service I made is perfect for this, check it out! I teach you a curriculum of all the most popular interview questions and topics in an order that encourages learning. I'd recommend joining the annual tier if you can! https://thedailybyte.dev/?ref=kevin
    1
  2473. the corporate world is weird. i got laid off from my first software engineering job out of school and it really gave me impostor syndrome. i'm glad this experience didn't do that to you and you're confident in yourself and your abilities! I'm sure you'll look back on this experience and laugh and be thankful it gave you the push you needed to move onto better things best of luck :)
    1
  2474. hahaha i don't wanna be the ceo of google but ty
    1
  2475. thanks for watching! :)
    1
  2476. Anytime! I'll put that problem on my list!
    1
  2477. Anytime and thank you so much! Best of luck on your onsite with Google and please don't hesitate to reach out to me if there's anything I can do to help you prepare!
    1
  2478. I will don't worry thank you so much for letting me know I'm happy to hear that my videos have been helpful!
    1
  2479. Anytime!!!
    1
  2480. the first number in each of the represents the change we're making to our current row and the second number represents the change we're making to our current column, hope that helps!
    1
  2481. Thanks so much! If you need help with these questions and like my explanations sign up for the interviewing service I created: https://thedailybyte.dev/?ref=kevin I recommend joining the annual tier if you can! :)
    1
  2482. Hahah I think a lot of the problems I've done will overlap so hopefully they're helpful in your preparation!!! :)
    1
  2483. wooooo
    1
  2484. love you Court :) ❤️
    1
  2485. Hey Puneet congrats that's amazing! I'd be happy to help you prepare by doing a mock interview. If you sign up on my Patreon under the "Phone Screen" tier we can get something scheduled right away! Is your interview a phone screen or onsite interview? Let me know! https://www.patreon.com/KevinNaughtonJr
    1
  2486. Anytime! I hope it was helpful!
    1
  2487. Best of luck in Austin Cole I'm sure it's gonna be awesome!!!
    1
  2488. thanks so much Pooja!! :)
    1
  2489. Dev- House thank you!!!
    1
  2490. haha thanks for checking it out Deni really appreciate it dude!
    1
  2491. Happy to help! Check out my Patreon and sign up for the tier that works best for you https://www.patreon.com/KevinNaughtonJr
    1
  2492.  @ambikaiyer29  Yeah that's what I was afraid of, super cool idea though, maybe there is another way to avoid sorting though somehow?
    1
  2493.  @nck87  Nice! Man...sometimes I wonder why I don't use Python for my interviews lol
    1
  2494.  @nck87  Yeah Python is awesome. Thanks and will do!
    1
  2495. 2nd :)
    1
  2496.  @ellamaria187  :D
    1
  2497. Anytime! :D
    1
  2498. Anytime dude thank you so much for the support I really appreciate it!
    1
  2499. Anytime Marlega thanks so much for the support I really appreciate it!
    1
  2500. Thanks!
    1
  2501. Thanks Nikita! If you like my explanations be sure to join the interviewing service I created https://thedailybyte.dev/?ref=kevin I recommend joining a premium plan if you can!
    1
  2502. thanks so much!
    1
  2503. Anytime Gaurav!
    1
  2504. thanks for watching!
    1
  2505. Manish Tiwari anytime
    1
  2506. thanks for checking out the video! I hope it was helpful!
    1
  2507. Sooooo true
    1
  2508. Reagan Yuan thanks Reagan! :)
    1
  2509. haha thanks Pat and anytime always happy to help :')
    1
  2510. Hahaha
    1
  2511. Sure! Any questions in particular you have in mind?
    1
  2512. haha yeah idk how I do that sometimes
    1
  2513. Anytime! Try to think about the "brute force" solution O(N^3) and then try to optimize. If you need help with problems/interviews check out the tiers on my Patreon page: https://www.patreon.com/KevinNaughtonJr
    1
  2514. Thanks Kevin and anytime!
    1
  2515.  @TechRally  thanks Alex!!! :)
    1
  2516. Nice!
    1
  2517. thanks Kartik :')
    1
  2518. Anytime Alankar happy to hear the video was helpful! :)
    1
  2519. Hey Karl, thanks for the comment. You're right it can be confusing when there are so many answers to a single question. Because of that I think it's always a good idea to try and lay out 2 or 3 approaches for a problem (to your interviewer) and pick one while explaining that specific solution's benefits. Some things to consider might be...runtime, space complexity, readability, scalability, etc.
    1
  2520.  @jlecampana  I'll check them out thanks for the suggestions! I hope you ave a great day too!
    1
  2521. Rajendra Chukkapalli thanks!!!
    1
  2522. there's endless resources online that talk about how much engineers make :)
    1
  2523. Anytime and thank you so much! Hmmm that's interesting and thanks for letting me know! Nice optimization! :)
    1
  2524. Anytime Katie! Good luck and let me know how it goes!
    1
  2525.  @_Apex  Anytime Andrew!
    1
  2526. thanks! If you like my explanations be sure to join the interviewing service I created https://thedailybyte.dev/?ref=kevin I recommend joining a premium plan if you can!
    1
  2527. anytime Alyssa and thanks!
    1
  2528. Min Luo thanks!
    1
  2529. Thanks Courtney!
    1
  2530. Thanks Faraz!
    1
  2531. good call! Yeah strings are soooo expensive in Java
    1
  2532. Thanks! And yeah good point...I guess for this problem I thought it was pretty easier to conceptualize so I just figured a dfs was self-explanatory. I tried to explain every line as I wrote it / after I wrote it and why I did, but if you have suggestions on what I can do better I'd love to hear it!
    1
  2533. Nice!
    1
  2534. Aria Alex hey Aria the best way to contact me is my discord or Instagram!
    1
  2535. Aria Alex check the links in the description of my videos there's a link there :)
    1
  2536.  @ariaalex9067  hey! I don't think I see a message from you on Instagram, are you sure you sent it to the right person???
    1
  2537. Antyime Shubham thanks for the kind words I'll keep making videos on frequently asked questions don't worry. Good luck finding a summer internship lmk if there's anything I can do to help!
    1
  2538. thank you!! :)
    1
  2539. Hey Divyeshkumar! I think it's nice to have the music, I'm still messing with the volumes though to try and make sure it doesn't drown me out ...this video I def think it was a little too loud
    1
  2540. Just put it on my list, thanks for the suggestion Juan!
    1
  2541.  @masui91  Anytime Juan! Thank YOU for the support :)
    1
  2542. I haven't but I imagine it's just a standard BFS where you just increment the level you're on to find the depth
    1
  2543. Anytime!
    1
  2544. happy to hear it!
    1
  2545. i think knowing how computers work at low levels can be important and helpful for optimizing things, but not necessarily for passing the majority of coding interviews (might need to know more low level stuff hft terms though)
    1
  2546. they're creative 😂
    1
  2547.  @miguelbatilando610  this is true
    1
  2548. blue light
    1
  2549. don't be afraid to ask questions! especially if someone is more senior than you i'm sure they'll understand that you'll have questions and asking questions will help you learn!
    1
  2550. Thanks Akshay really appreciate the support! 🙂
    1
  2551. praphul yadav anytime!
    1
  2552. Hey Jay, thanks so much I'm happy to hear you're enjoying the videos! Yes, absolutely I'd be happy to help you with your resume! If you don't mind, join the Discord server and we can discuss there :) I'm looking forward to it!
    1
  2553. Hey Jay I just sent you an invite to the Discord server thank you so so much for your support it means the world to me! Shoot me a message on Discord and I'll see what I can do :)
    1
  2554. ty for watching Rishab :)
    1
  2555. Thank you and anytime! Don't worry about it these questions are hard just keep practicing!!!
    1
  2556. Hey! I'd be happy to help anyway I can! Check out my Patreon page and see if you're interested in any of the tiers I provide!
    1
  2557. Haha that’s the one I’ve been thinking about getting thanks for letting me know it’s solid :)
    1
  2558. Love to hear that thanks Slava!
    1
  2559. thanks fuzz 🤝
    1
  2560. Hey! Thanks so much for the support :). I'd be happy to discuss more with you in the Discord channel if you're interested in joining? Here's the link to join: https://www.patreon.com/KevinNaughtonJr
    1
  2561.  @GRIM2594  Hahah I like to think it's worth it, but if not I still do my best to help people in the comments :)
    1
  2562. Hey Himaja thank you so much for the kind words and I'm happy to hear my videos have been helpful! Congrats that's amazing, I'd be happy to help you prepare for your FB onsite, normally I discuss these kinds of things in my Discord server if you're willing to join (https://www.patreon.com/KevinNaughtonJr here you're welcome to ping me anytime with any questions you have) If not, no worries. My advice would be to have a schedule, make sure you're getting a certain amount of work done every day leading up to the interview and be confident! Interviewing is tough but you can do it it's all about the proper preparation!
    1
  2563. Thanks! Hmm not sure for whiteboarding but for pair programming I use screen
    1
  2564. second?
    1
  2565. sooooooo much better
    1
  2566. Thanks Fnu :)
    1
  2567. Anytime Nishad and interesting, how’d you do on that problem?
    1
  2568. so happy for you congrats!!! Happy I was able to help 🙂
    1
  2569. first twice, W0w
    1
  2570. Thanks Sandeep! If you like my content I recommend joining a premium plan on the interviewing service I created https://thedailybyte.dev/?ref=kevin
    1
  2571. thanks Naveen!
    1
  2572. 222222222
    1
  2573. I'll add them to my list!
    1
  2574. Anytime! I'm so happy to hear this video helped you! Thank you so much for letting me know and for your support!
    1
  2575. chris thompson that’s awesome congrats on getting an interview with Google! If you’re interested in doing a mock interview or need help preparing check out my Patreon page I offer all kinds of services to help people best prepare for their interviews! https://www.patreon.com/KevinNaughtonJr
    1
  2576. I'll add it to my list!
    1
  2577. haha thanks!!!
    1
  2578. Nice!!!
    1
  2579. Thanks Matt!
    1
  2580. SWANTAN BARUA no problem!
    1
  2581. Nupur Munda hey Nupur check out my Patreon page I offer services to help people prepare for their interviews!
    1