Youtube comments of (@NeetCode).

  1. Part of the reason I uploaded this was because I saw your video about your struggles before you started working at Netflix. Appreciate what you do Prime!
    3100
  2. When the first question turns out to be a warmup, and the REAL question is a 4-D dynamic programming problem 🙂🔫
    2800
  3. Not trying to bash Amazon or scare people who wanna work there. Just sharing one person's experience. It's easy to talk about success, but I think you can learn more from failure.
    2600
  4. A few more points I didn't mention in the video: 1. A day after i uploaded this video I saw tech bros on twitter saying "all you need is Claude" and you can code almost anything.. yet they couldn't even recreate a basic component on neetcode.io that I literally coded as a junior engineer. So once again, people are vastly overstating what AI can do. If only this hadn't happened in human history a million times before. 2. Amazon invested billions in Alexa, only for it to be obsoleted by LLMs. I worked in Alexa (for a brief time) and it's obvious it wasn't well run. Big tech doesn't always know what they're doing. 3. Amazon Go's "AI" turned out to be indian workers watching security cameras. 4. Nearly every advancement goes through hype cycles. Not just the dotcom bubble, even the railroads were overbuilt in the 1800s. "The Panic of 1893 was the largest economic depression in U.S. history at that time. It was the result of railroad overbuilding and shaky railroad financing, which set off a series of bank failures." Fwiw I literally use LLMs on a daily basis to automate my own tasks. Yes it helps somewhat, but I'm also very familiar with its limitations. If you disagree with me you may very well me right. But at least give me your best argument :) Sources: - https://youtu.be/U_cSLPv34xk?si=Czh2GAG1wfVxjfhD - https://x.com/swyx/status/1815053785548661128 - https://arstechnica.com/gadgets/2023/11/amazon-lays-off-alexa-employees-as-2010s-voice-assistant-boom-gives-way-to-ai/ - https://www.businessinsider.com/amazons-just-walk-out-actually-1-000-people-in-india-2024-4 - https://en.wikipedia.org/wiki/History_of_rail_transportation_in_the_United_States
    1700
  5. LET HIM COOK 🍳
    939
  6. Damn nice job.. now do it in 24 hours
    894
  7. Been a long ass time since I uploaded on this channel, I know. Even though I've been uploading on the second channel, I missed you guys over here. 😭 Roadmap: https://neetcode.io/roadmap Quiz feature: https://neetcode.io/practice Second channel: https://youtube.com/@neetcodeio
    860
  8. 🚀 https://neetcode.io/ - A better way to prepare for Coding Interviews Next video -> Why I left google after 3 days (as an ex-google engineer). jk In seriousness, even the name NEETcode is about unemployment (NEET is an acronym for Not in Education, Employement or Training). Thanks to all of you and hope you have a great 2022!
    791
  9. Holy shit, theprimeagen reacted to me! 🤯 Love it
    700
  10. That's super impressive, great job!! Honestly you did it a lot faster than I did when I was first learning it. and fwiw i definitely didn't intend for people to do every suggested problem for each lesson anyway and amazing video btw, it's such a unique style!! like commented & subscribed!
    693
  11. Correction: Bing will not be using GPT-4, but a different model that is still more advanced than ChatGPT. (I was baited by some fake news)
    541
  12. Btw I was just kidding at end.. 🚀 https://neetcode.io/ - A better way to prepare for Coding Interviews
    489
  13. Btw here's my linkedin: https://www.linkedin.com/in/navdeep-singh-3aaa14161/ I'm not very active on there, but that will change maybe
    473
  14. Wanted to make this months ago... but better late than never 😅
    425
  15. Good catch! you're exactly correct, and your proposed solution would be O(n^2). I hope the video still explains the main idea, but thank you for pointing this out. I will try to catch mistakes like this in the future.
    389
  16. 🚀 https://neetcode.io/ - I created a FREE site to make interview prep a lot easier, hope it helps! ❤ I didn't mention this but using Python helped me a lot because you can write MUCH less code. I know most schools teach Java/C++, mine did as well, but i would highly recommend a language like Python/Javascript. Here's a short video highlighting the benefits of Python: https://youtu.be/emNkJGwcusQ
    371
  17. Damn I almost forgot I even had this channel. 🌍 The Roadmap: https://neetcode.io/roadmap ✏ The practice page: https://neetcode.io/practice 🚀 My second YT channel: https://youtube.com/@NeetCodeIO 🔥 Pro https://neetcode.io/pro
    350
  18. Warning, the roadmap is not mobile-friendly AT ALL. But really looking forward to hearing your guys' thoughts! Btw thanks for 300K subscribers, can't believe we started with less than 100K at the beginning of the year :) hope you all have a good holiday break! 🚀 https://neetcode.io/
    333
  19. I was the same way, I just liked understanding stuff and wanted to be a physicist. But with CS you could actually make money. So glad you started making videos man
    310
  20. ✅ In-depth OOP Design Patterns course: https://neetcode.io/courses/design-patterns ✅ OOP Interviews course: https://neetcode.io/courses/ood-interview
    272
  21. 🚀 https://neetcode.io/ - I created a FREE site to make interview prep a lot easier, hope it helps! ❤
    256
  22. It reminds me of that Human centipede movie except with AI generated code. Sh*t code goes in, even worse code comes out, and it just keeps getting worse. Sorry, that's a cursed comment.
    239
  23. 🚀 https://neetcode.io/ - I created a FREE site to make interview prep a lot easier, hope it helps! ❤
    236
  24. No, I don't think AI is going to take our jobs.. unless you don't subscribe, at that point anything can happen 😉 That said I really hope it automate the boring and tedious stuff soon - it's crazy how much of my time at Google is wasted on things like syntax, API interfaces, manually fixing build rules, and permissions hell.
    233
  25. Turned off ads for this one. I've been using Python in my videos for over 4 years now, so I thought I'd finally make a Python course. Will be launching the Python for coding interviews course in a few weeks. After that, probably Python Object Oriented Programming. check em out here: neetcode.io/courses
    226
  26. yeah, sorry about that, it should actually be "or" instead or "and"
    225
  27. The funny thing is I work in the same office
    213
  28. Good luck Tina! Excited to see what's next from you!
    200
  29. omg ThePrimeTime reacted to me on live television, appreciate it boss 🫡
    192
  30. Really interesting video Steve, i agree that keeping multiple career options open is smart. Btw i really love the overall video aesthetic (pacing, music, lighting, editing style)
    178
  31. Completely agree - idk why people think SQL is insufficient for their app. Even google uses Spanner (SQL) for the vast majority of use-cases. And as you mentioned, Vitess/MySQL works for youtube, so obviously SQL can scale.
    171
  32. Let me know if you guys want more system design content - I've been wanting to do more and have a lot of ideas, so hopefully you all are interested! Let me know, and feel free to drop a like 👍 =) 🚀 https://neetcode.io/ - Get lifetime access to every course I ever create!
    168
  33. That's awesome Ryan, you just made my day! Congrats 🎉
    154
  34. 🚀 https://neetcode.io/ - A better way to prepare for Coding Interviews How to get employed 101: 1. Solve the problems in an intuitive order: https://neetcode.io/ 2. Visualize the problem (draw a picture, its so much easier) 3. Maybe the first 50 questions take 50 hours, the next 50 questions will take 15 hours. You will be SHOCKED by how quickly you improve!
    150
  35. 🚀 https://neetcode.io/ - I created a FREE site to make interview prep a lot easier, hope it helps! ❤ This one turned out longer than expected, recommend 1.5x speed
    147
  36. Absolutely!
    145
  37. I'm genuinely glad things got better for you! Thank you for sharing.
    144
  38. In 24 hours we learned that Go might not be the best language for leetcode problems... :^) This is my second and hopefully last 24 hour leetcode stream 0:00 - Stream starts 17:50 - Challenge starts 24:14:15 - Challenge ends 🧑‍💼 Connect with me on LinkedIn: https://www.linkedin.com/in/navdeep-singh-3aaa14161/
    141
  39. Good point, I think I'll move it
    138
  40. 🚀 https://neetcode.io/ - Get lifetime access to all current & future courses I create! Btw this is the question I asked: https://leetcode.com/problems/insert-delete-getrandom-o1/ We actually solved it on the channel here: https://youtu.be/j4KwhBziOpg
    138
  41. 🚀 https://neetcode.io/ - I created a FREE site to make interview prep a lot easier, hope it helps! ❤
    133
  42. ok fine, I will compromise and start doing my videos in C 😉
    130
  43. Please keep going and never give up!!! I don't talk much about my personal life on this channel, but believe it or not i was in your same situation not too long ago. I promise, with enough hard work and patience, your success is GURANTEED!
    126
  44. Am I just coping or do you agree that the hype is a bit overstated? Btw, I'm not really pro-google on this topic - I spent the last video shitting on their AI strategy -> https://youtu.be/hL0bn_-FKmo
    124
  45. 🚀 https://neetcode.io/ - I created a FREE site to make interview prep a lot easier, hope it helps! ❤
    123
  46. 🚀 All of the code is available at: https://neetcode.io/courses/lessons/python-for-coding-interviews Timestamps: 1:13 - variables 2:40 - if-statements 4:00 - loops 6:06 - math 8:40 - arrays 12:38 - sorting 13:40 - list comprehension 14:20 - 2-d arrays 15:25 - strings 16:50 - queues 17:30 - hash sets 18:25 - hash maps 20:15 - tuples 20:55 - heaps 22:30 - functions 22:55 - nested functions 24:20 - classes
    115
  47. I'm sorry to the 18% of you who are Java people - didn't mean to crap on your language 😭
    110
  48. Damn, over 100 people already signed up in the first 15 minutes! Please msg me on twitter, discord, or comment here if you notice any issues! 🚀 https://neetcode.io/ 🥷 Discord: https://discord.gg/ddjKRXPqtk 🐦 Twitter: https://twitter.com/neetcode1
    104
  49. Lol, yeah that's pretty accurate
    102
  50. Hope you all are taking care of yourselves, we WILL get through this! As you can see, I'm working on my video editing skills to prepare myself for layoffs.. but in seriousness, the grind NEVER stops. As long as you have valuable skills, your employer never has too much power over you. I'll have some new features coming to https://neetcode.io pretty soon (free). Also, I'll be making coding interview related content on instagram soon, so follow me here if you're interested: https://www.instagram.com/neetcodeio/ BTW if you're interested in working with me on NeetCode stuff please fill out this form: https://forms.gle/ZUmofsb5QeHzexJv9
    99
  51. Glad to see youre back and enjoying yourself!! I remember you talking about the book on stream a few years ago, glad to see its coming along
    92
  52. You got this!
    89
  53. So are you guys interested in working at Twitter? 😅Btw, don't forget to "Batch" click the like & subscribe buttons. 🚀 https://neetcode.io/ - Get lifetime access to every course I ever create!
    88
  54. thanks Kevin, I really appreciate it
    87
  55. 🚀 https://neetcode.io/ - I created a FREE site to make interview prep a lot easier, hope it helps! ❤ Correction: at 8:13 the subtitle should read "We could also initialize length=1"
    84
  56. I didn't wanna stretch this video too long, so I kinda rushed over a few parts. So if it's confusing feel free to ask any questions. But happy new years 🎉! Anyways, what technologies do you guys plan on learning next year? (other than how to invert a binary tree of course)
    82
  57. Thank you so much!!!
    81
  58. this 13 min video would have saved me a semester of stress in college lol
    81
  59. 🚀 https://neetcode.io/ - I created a FREE site to make interview prep a lot easier, hope it helps! ❤
    73
  60. 🚀 https://neetcode.io - Get access to every current and future course I ever create. Let me know if you enjoyed this new "architecture" style video and I'll try to do more! 🙂
    72
  61. 🚀 https://neetcode.io/ - I created a FREE site to make interview prep a lot easier, hope it helps! ❤
    70
  62. I have a second channel where I solve the daily leetcode problems: https://youtube.com/@neetcodeio I curated a list of the 150 most important coding interview problems: https://neetcode.io/practice
    70
  63. 🚀 https://neetcode.io/ - I created a FREE site to make interview prep a lot easier, hope it helps! ❤
    66
  64. 🚀 https://neetcode.io/ - I created a FREE site to make interview prep a lot easier, hope it helps! ❤
    66
  65. The people passionate about leetcode, like competitive programmers are able to solve Hards consistently. But i think for the average person studying for interviews, they should only focus on the most popular leetcode hards. Occassionaly, there are problems where you have to simply memorize the "trick" in hard problems.
    63
  66. Oh no... 😯. You are absolutely correct and thank you so much for catching that! Luckily it does not change the outcome of the solution, but next time I'm just gonna use a calculator lol
    61
  67. This one turned out pretty long, but I hope the timestamps are helpful. Also, the code for all 3 solutions is in the description. 😃
    61
  68. 🚀 https://neetcode.io/ - I created a FREE site to make interview prep a lot easier, hope it helps! ❤
    60
  69. Some people prefer using Microsoft Word =)
    58
  70. 🚀 https://neetcode.io/ - A better way to prepare for Coding Interviews
    58
  71. Correction: The time complexity of the 2nd solution is actually O(2^ (k*n)), because if we have K trees stacked on top of each other, the new height of the tree is K * n.
    57
  72. Congratulations, I'm really happy for you! 🎉
    57
  73. Wdym, who doesn't want a little 'Goops' in their tech stack?
    57
  74. Hey Nathan congrats on FB, it's so awesome your hard word paid!!!! Thank you so much for the support, I really appreciate it! 😊
    55
  75. ⛽ 😭
    55
  76. My first programming language was C, so I loved Java when I started it. Then i discovered python! Thank you for watching, feel free to leave any feedback! like/sub to support the channel it helps out a lot : ^ )
    55
  77. 🚀 https://neetcode.io/ - I created a FREE site to make interview prep a lot easier, hope it helps! ❤
    55
  78. Lol
    54
  79. listen to my calls 😡
    53
  80. 🚀 https://neetcode.io/ - I created a FREE site to make interview prep a lot easier, hope it helps! ❤
    53
  81. Damn what a crossover .... I always thought Ben Awad was a machine who locked himself in his closet and just coded all day
    53
  82. 🚀 https://neetcode.io/ - A better way to prepare for Coding Interviews
    52
  83. 🚀 https://neetcode.io/ - Get lifetime access to all current & future courses I create! Code from the video: https://neetcode.io/courses/lessons/big-o-notation
    52
  84. 🚀 https://neetcode.io/ - I created a FREE site to make interview prep a lot easier, hope it helps! ❤
    52
  85. 🚀 https://neetcode.io/ - I created a FREE site to make interview prep a lot easier, hope it helps! ❤
    51
  86. Can't believe there's over 2000 LC problems now... and we've only solved 10% of them on this channel 😨 :_Neetcode:
    51
  87. Agree!
    49
  88. 🚀 https://neetcode.io/ - A better way to prepare for Coding Interviews
    48
  89. It's currently pretty simple for me since almost everything is handled by Firebase. But I think it's cool that startups like Vercel, Cloudflare exist. (And at one point firebase was a startup) Makes it so that devs don't have to worry about a lot of the complexity i talked about. I talk more about the stack I'm currently using here: https://youtu.be/4G5t1HwHQD4
    48
  90. 🚀 https://neetcode.io/ - A better way to prepare for Coding Interviews
    48
  91. Sounds Good to me :)
    48
  92. What tech stack do you guys use? 🚀 https://neetcode.io/ - Get access to every course I will ever create!
    48
  93. 🚀 https://neetcode.io/ - A better way to prepare for Coding Interviews
    47
  94. Why doesn't java just let me do this 😭😭😭 hashmap[key] = value;
    46
  95. Absolutely, especially if you can't solve many of the problems from the NC 150 list from scratch. It's better to be really good at a small set of problems, then be bad at a large set of problems.
    45
  96. Thanks, I appreciate that! :)
    45
  97. 🚀 https://neetcode.io/ - I created a FREE site to make interview prep a lot easier, hope it helps! ❤
    45
  98. 🚀 https://neetcode.io/ - I created a FREE site to make interview prep a lot easier, hope it helps! ❤
    44
  99. 🚀 https://neetcode.io/ - A better way to prepare for Coding Interviews
    44
  100. Maybe on part 2... lol
    44
  101. Yes, we finally finished the list!!!
    43
  102. Thanks, appreciate the kind words!
    43
  103. Oh crap... Good catch! You're right, it should be "+ 1" not "+ i", thanks for letting me know!
    42
  104. Thanks appreciate it a lot 😊
    42
  105. Having an inner loop does not mean quadratic, that's a common mistake people make. You have to look at the context, the inner loop will never run more than N times total, so it can't be quadratic.
    42
  106. Thank you, that means a lot! If you would like to support on patreon here is the link: https://www.patreon.com/NEETcode (completely optional, teaching is already rewarding for me =) )
    41
  107. 🚀 https://neetcode.io/ - I created a FREE site to make interview prep a lot easier, hope it helps! ❤
    41
  108. Happy to help!
    41
  109. Haha that's awesome.. I'm sometimes still afraid of LC Hards tho 😱
    41
  110. 🚀 https://neetcode.io/ - I created a FREE site to make interview prep a lot easier, hope it helps! ❤
    39
  111. That's great, congrats!!! Your hard work paid off!!🎉
    39
  112. 🚀 https://neetcode.io/ - A better way to prepare for Coding Interviews
    39
  113. 🚀 https://neetcode.io/ - A better way to prepare for Coding Interviews
    39
  114. 🚀 https://neetcode.io/ - I created a FREE site to make interview prep a lot easier, hope it helps! ❤
    39
  115. Code on Github: https://github.com/neetcode-gh/leetcode/blob/main/28-Implement-strStr.py I recommend using the timestamps and watching this at 1.5x Speed, at least the LPS portion, which turned out longer than I expected.
    39
  116. 🚀 https://neetcode.io/ - A better way to prepare for Coding Interviews
    38
  117. at least leetcode is still up lol..
    38
  118. Wow, I bet you would nail any interview now! Thanks for the kind words
    38
  119. 🚀 https://neetcode.io/ - A better way to prepare for Coding Interviews
    37
  120. 🚀 https://neetcode.io/ - A better way to prepare for Coding Interviews
    37
  121. Nice, congrats!!!
    37
  122. Very good point, I hadn't thought of that
    37
  123. lol, this is what 500 lc problems does to a mfer
    37
  124. 🚀 https://neetcode.io/ - I created a FREE site to make interview prep a lot easier, hope it helps! ❤
    37
  125.  @michaelasin6050  We have an internal version called Borg which I guess is public info. Here's the paper on it: https://static.googleusercontent.com/media/research.google.com/en//pubs/archive/44843.pdf
    37
  126. Hey thanks for bringing it to my attention. I think this is just leetcode being dumb... I replaced the line where i call the min() function with an if-statement and it passed on leetcode. This is the code i used: class Solution: def numSquares(self, n: int) -> int: cache = [n] * (n + 1) cache[0] = 0 for i in range(1, n + 1): for s in range(1, i + 1): square = s * s if i - square < 0: break if 1 + cache[i - square] < cache[i]: cache[i] = 1 + cache[i - square] return cache[n]
    37
  127. 🚀 https://neetcode.io/ - I created a FREE site to make interview prep a lot easier, hope it helps! ❤
    36
  128. I rerecorded this solution since I thought it could be better, please check out this version instead: https://youtu.be/K81C31ytOZE It's half the length and still covers everything. 🚀 https://neetcode.io/ - I created a FREE site to make interview prep a lot easier, hope it helps! ❤
    36
  129. Thanks, appreciate the kind words 🙂
    35
  130. Most of the time you're expected to learn new tech as needed. If you're new to c++ for example, it's expected that the code reviewers will have to help you but you also need to learn on your own.
    35
  131. 🚀 https://neetcode.io/ - I created a FREE site to make interview prep a lot easier, hope it helps! ❤
    35
  132. 🚀 https://neetcode.io/ - A better way to prepare for Coding Interviews
    35
  133. Good suggestion, I'll try to do that in the future. For this problem it doesn't make sense, because even the brute force solution isn't trivial to code and it's mostly unrelated to the optimal solution.
    34
  134. 🚀 https://neetcode.io/ - A better way to prepare for Coding Interviews
    34
  135. This is a Premium LC Problem but you can solve it for FREE here: https://www.lintcode.com/problem/663/
    34
  136. Hey appreciate the kind words! For Time it is O(n * 2^n) because there will be 2^n different subsets, and we have to create a copy of each one, which is O(n). For Space it is O(n) if you don't count the output array, because the size of the function call stack will be O(n). Meaning we have to call the recursive function n times in a row, before it returns.
    33
  137. 🚀 https://neetcode.io/ - I created a FREE site to make interview prep a lot easier, hope it helps! ❤
    33
  138. 🚀 https://neetcode.io/ - I created a FREE site to make interview prep a lot easier, hope it helps! ❤
    33
  139. 🚀 https://neetcode.io/ - 25% OFF LAUNCH SALE Discord: https://discord.gg/ZdDafbpw
    33
  140. Sorry to hear that man. I wish you the best in the future.
    33
  141. 🚀 https://neetcode.io - Get access to every current and future course I ever create. Spreadsheet from the video: https://docs.google.com/spreadsheets/d/1A2PaQKcdwO_lwxz9bAnxXnIQayCouZP6d-ENrBz_NXc/edit?usp=sharing
    32
  142. 🚀 https://neetcode.io/ - A better way to prepare for Coding Interviews
    32
  143. I hope to answer all of the above questions in the very near future 🙂
    32
  144. DDIA is the most comprehensive resource (assuming you have at least some experience). Also, most companies (including twitter) release blog posts and white papers about technical challenges they faced and how they overcame them. I think many beginners miss these, but they are an extremely valuable and free resource, which is why they are commonly referenced by system design textbooks.
    31
  145. Agree, this one is really hard.
    31
  146. 🚀 https://neetcode.io/ - A better way to prepare for Coding Interviews 🥷 Discord: https://discord.gg/ddjKRXPqtk 🐦 Twitter: https://twitter.com/neetcode1
    31
  147. 🚀 https://neetcode.io/ - A better way to prepare for Coding Interviews
    31
  148. Thank you so much!! And best of luck!!
    31
  149. Yeah, you're right, I just remembered that. Thanks for pointing it out.
    31
  150. Congratulations 🎉
    31
  151. lol
    30
  152. I think it's fake news that GPT4 is trained on 100 Trillion parameters. I saw the same articles, but Sam Altman stated that its not true.
    30
  153.  @naodderibe4148  I do think it's worth learning python, because it doesn't take too long and makes questions easier. In the past I used C++, but switched to Python and it's well worth it. I have never used Python at any job, only for coding interviews and it's the best decision I ever made.
    30
  154. Hey Jonas, congrats on the offer!!! I'm glad your hard work paid off!
    30
  155. 🚀 https://neetcode.io/ - I created a FREE site to make interview prep a lot easier, hope it helps! ❤
    29
  156. ⭐ BLIND-75 PLAYLIST: https://www.youtube.com/watch?v=KLlXCFG5TnA&list=PLot-Xpze53ldVwtstag2TL4HQhAnC8ATf I didn't mention this but using Python helped me a lot because you can write MUCH less code. I know most schools teach Java/C++, mine did as well, but i would highly recommend a language like Python/Javascript. Here's a short video highlighting the benefits of Python: https://youtu.be/emNkJGwcusQ
    29
  157. Yes, a common way of representing a graph is with an Adjacency List. It's usually implemented with a Hashmap because they are efficient. So for each nide, you map it to a list of it's neighbors.
    29
  158. I rerecorded this solution and made it much better, please watch this instead: https://youtu.be/FZe0UqISmUw
    29
  159. 🚀 https://neetcode.io/ - I created a FREE site to make interview prep a lot easier, hope it helps! ❤
    29
  160. 🚀 https://neetcode.io/ - I created a FREE site to make interview prep a lot easier, hope it helps! ❤
    28
  161. 🚀 https://neetcode.io/ - A better way to prepare for Coding Interviews
    28
  162. Sorry the video cuts off before the code is complete, here's the full code: https://github.com/neetcode-gh/leetcode/blob/main/python/901-Online-Stock-Span.py
    27
  163. Discord: https://discord.gg/ddjKRXPqtk Correction: Time complexity is O(nlogn + n + m) where n is size of products, and m is length of searchWord.
    27
  164. Thanks, I'm glad the channel is helpful! And congrats on your offer!! 🎉
    27
  165. 🚀 https://neetcode.io/ - I created a FREE site to make interview prep a lot easier, hope it helps! ❤
    27
  166. 🚀 https://neetcode.io/ - I created a FREE site to make interview prep a lot easier, hope it helps! ❤
    26
  167. He ended up writing some pretty neat code so we can let it slide 😉
    26
  168. Congratulations 🙂🎉🎉
    26
  169. 🚀 https://neetcode.io/ - A better way to prepare for Coding Interviews
    26
  170. Most engineers at google are just updating config files, so don't worry about it dog
    25
  171. You're correct, that solution is most efficient and easiest to implement. But in the problem statement they require that we are not allowed to change the values, i guess we can think of the node values as Read-Only memory.
    25
  172. Thanks! I think I wasn't getting calls mostly because of the pandemic and then I had an employment gap on my resume which made things a bit worse.
    25
  173. 🚀 https://neetcode.io/ - A better way to prepare for Coding Interviews
    25
  174. LFU Cache: https://youtu.be/bLEIHn-DgoA 🚀 https://neetcode.io/ - I created a FREE site to make interview prep a lot easier, hope it helps! ❤
    25
  175. Yeah, I think you're right. Only issue I can think of is, what if the integer is too large for 32 bits, that wouldn't be a problem in python but could be in other languages.
    25
  176. i honestly think they can beat microsoft at this point (or get acquired for several billions)
    25
  177. A big change from yesterdays Hard to todays... reverse a string
    25
  178. no
    25
  179. 🚀 https://neetcode.io/ - I created a FREE site to make interview prep a lot easier, hope it helps! ❤
    24
  180. Agree, if not for stressful interviews, I think most people will kinda like leetcode.
    24
  181. Good point!
    24
  182. Good luck, you're going to do great!
    24
  183. 🚀 https://neetcode.io/ - A better way to prepare for Coding Interviews Search in Rotated Sorted Array II - https://youtu.be/oUnF7o88_Xc
    24
  184. Congrats!! 🎉
    24
  185. Yeah that's true
    23
  186. This is one of the lessons from my System Design for Beginners course, which is currently on-going on neetcode.io. 🚀 https://neetcode.io/ - Get lifetime access to all current & future courses I create!
    23
  187. Yeah, I heard the same - this video might not age well lol
    23
  188. 🚀 https://neetcode.io/ - I created a FREE site to make interview prep a lot easier, hope it helps! ❤
    23
  189. nobody's perfect =)
    23
  190. 🚀 https://neetcode.io/ - I created a FREE site to make interview prep a lot easier, hope it helps! ❤
    23
  191. 🚀 https://neetcode.io/ - I created a FREE site to make interview prep a lot easier, hope it helps! ❤
    23
  192. 🚀 https://neetcode.io/ - A better way to prepare for Coding Interviews
    23
  193. 🚀 https://neetcode.io/ - I created a FREE site to make interview prep a lot easier, hope it helps! ❤
    23
  194. It's definitely not awful, its just not good for lc cause it doesnt have a lot of built-in data structures. It feels like programming in C. For actual development, it seems to be gaining popularity (though its still less used than Java)
    23
  195. Let me know if you prefer drawing & code at the same time or separately!
    23
  196. Good question. Since we are being greedy, every time we add a cell to Visit, we are guaranteeing that the path we took to get to this cell, has minimized the heights. In other words, if we visit Cell X and add it to the MinHeap and Visit Set, we are doing so because we know that there doesnt exist ANY other path in the entire grid, where the max height we had to take along the path, is any smaller. So we dont need to check every single path leading to Cell X, we only need to check the path where the Max Height is minimized.
    23
  197. 🚀 https://neetcode.io/ - I created a FREE site to make interview prep a lot easier, hope it helps! ❤
    23
  198. Not sure which video you're talking about, but there's nothing fancy in this code. The general ideas most of the time be easily translated between languages, and if you can't do that it's most likely that you don't understand the solution. Nothing related to the language. If anything, python is written like psuedo code, Java has so much boiler plate it makes things more complicated.
    23
  199. 🚀 https://neetcode.io/ - I created a FREE site to make interview prep a lot easier, hope it helps! ❤
    22
  200. 🚀 https://neetcode.io/ - I created a FREE site to make interview prep a lot easier, hope it helps! ❤
    22
  201. Good catch, thank you for pointing it out! Yes you are correct, in reality we need to SKIP the first column, only after we zero out the rows are we allowed to zero out the first column. The code handles this correctly, but I'm sorry about the confusion the picture drawing causes.
    22
  202. 🚀 https://neetcode.io/ - A better way to prepare for Coding Interviews
    22
  203. 🚀 https://neetcode.io/ - I created a FREE site to make interview prep a lot easier, hope it helps! ❤
    22
  204. Good luck, you're a viewer of mine so I'm sure you're gonna kill it 😅
    21
  205. Thanks! Btw if I recall, you requested Task Scheduler video, and I recently uploaded it. Hope it's helpful!
    21
  206. 🚀 https://neetcode.io/ - I created a FREE site to make interview prep a lot easier, hope it helps! ❤
    21
  207. Good point. I just think that automation usually takes longer than people expect. And worst case, if AI replaces programming jobs, it's probably going to replace A LOT more (law, medicine, etc)
    21
  208. a leetcode a day keeps the unemployment away 😉
    21
  209. Congrats Steve!! Happy for you and your fam!!
    21
  210. 🚀 https://neetcode.io/ - I created a FREE site to make interview prep a lot easier, hope it helps! ❤
    21
  211. Thanks for watching! Yes, I think I plan on having videos for most of those problems!
    21
  212. Recommend watching this one at 1.5x Speed! Python Code: https://github.com/neetcode-gh/leetcode/blob/main/python/355-Design-Twitter.py Java Code: https://github.com/neetcode-gh/leetcode/blob/main/java/355-Design-Twitter.java
    20
  213. Good luck Stephen, you're gonna do great!
    20
  214. Thanks! Much appreciated
    20
  215. 💡 LINKED LIST PLAYLIST: https://www.youtube.com/watch?v=G0_I-ZF0S38&list=PLot-Xpze53leU0Ec0VkBhnf4npMRFiNcB&index=2
    20
  216. Yeah, it should be logic OR, sorry about that. But good question, i have no idea how it passed in the video, it might have used previously cached code that i wrote before recording.
    20
  217. Thanks for the detailed comment!
    20
  218. Yes, nicely explained!
    20
  219. I completely agree with you. I'm a pretty average/mediocre engineer, but I get many job offers because I can solve LC problems. It's definitely not fair, but at this point it's just the world we live in.
    20
  220. First name Neet, last name Code
    20
  221. That's a good point, I think "canbuy" is definitely a better name for it.
    19
  222. 🚀 https://neetcode.io/ - I created a FREE site to make interview prep a lot easier, hope it helps! ❤
    19
  223. I appreciate the kind words :)
    19
  224. Tree Question Playlist: https://www.youtube.com/watch?v=OnSn2XEQ4MY&list=PLot-Xpze53ldg4pN6PfzoJY7KsKcxF1jg&index=1
    19
  225. Oh my mistake, you are right its PreOrder
    19
  226. 🚀 https://neetcode.io/ - A better way to prepare for Coding Interviews
    19
  227. 🚀 https://neetcode.io/ - I created a FREE site to make interview prep a lot easier, hope it helps! ❤
    19
  228. Wow for $2000 I might have to make one soon 😉
    19
  229. I got you fam, I'll upload it tomorrow morning!
    19
  230. 🚀 https://neetcode.io/ - I created a FREE site to make interview prep a lot easier, hope it helps! ❤
    19
  231. Ah, thanks I didn't know that
    18
  232.  @a55tech  Paint 3D with a mouse
    18
  233. Really good point. I think i missed that because leetcode will accept any solution that evaluates to "true" in this case lol. I think the simplest fix would be to change the max() function to min() for ONLY when Bob is choosing. When Alice chooses it stays max(). Correct me if i'm missing something tho..
    18
  234. You've got a long way to go kid.. and I know this as a veteran mid-level engineer.
    18
  235. The 'thin wrapper around openai' vs 'thin wrapper around s3' is an interesting point, but it's still relevant i think, given that Dropbox might not even exist in the near future.
    18
  236. Thanks!
    18
  237. Thanks! I'm really happy that they are helpful!
    18
  238. Thats a good idea, but technically its possible for the duplicate element to occur more than twice. Otherwise, yes your solution would work.
    18
  239. 💡 BINARY SEARCH PLAYLIST: https://www.youtube.com/watch?v=U8XENwh8Oy8&list=PLot-Xpze53leNZQd0iINpD-MAhMOMzWvO
    17
  240. 💡 DP PLAYLIST: https://www.youtube.com/watch?v=73r3KWiEvyk&list=PLot-Xpze53lcvx_tjrr_m2lgD2NsRHlNO&index=2
    17
  241. That's awesome news, I'm happy to hear it! Your hard work paid off, congrats! :)
    17
  242. I'm happy it was helpful 🙂
    17
  243. Thanks for the suggestion, just created it: 💡 BACKTRACKING PLAYLIST: https://www.youtube.com/watch?v=pfiQ_PS1g8E&list=PLot-Xpze53lf5C3HSjCnyFghlW0G1HHXo&index=1
    17
  244. Firstly, congrats on the offer! I'm happy your hard work paid off :) Also, donations are completely optional, but if you would like to support the channel there should be a "Thanks" button underneath the video, right next to the "Share" button.
    17
  245. Good point, I think you are correct
    17
  246. 🚀 https://neetcode.io/ - I created a FREE site to make interview prep a lot easier, hope it helps! ❤
    17
  247. Some of them i got a little lazy lol
    16
  248. Lol
    16
  249. 💡 DP Playlist: https://www.youtube.com/watch?v=73r3KWiEvyk&list=PLot-Xpze53lcvx_tjrr_m2lgD2NsRHlNO
    16
  250. 💡 BACKTRACKING PLAYLIST: https://www.youtube.com/watch?v=pfiQ_PS1g8E&list=PLot-Xpze53lf5C3HSjCnyFghlW0G1HHXo&index=1
    16
  251. lol - sometimes i actually rerun it to get a faster time, leetcode runtimes are random.
    16
  252. Here before google fires me.. oh wait
    16
  253. Thank you, more to come!
    16
  254. Thank you, I will :)
    16
  255. I created a second channel where I post the daily LC solutions 👉 https://www.youtube.com/@NeetCodeIO In case you're interested!
    16
  256. Suggest 0.5x speed
    16
  257. 🚀 https://neetcode.io/ - A better way to prepare for Coding Interviews
    16
  258. The main rule is, if you have all of the elements available at the beginning, then you should run Heapify - O(n) time, if you don't have all of the elements available immediately, then you will have to separately push each one to the Heap - O(n*logn) time.
    16
  259. No.. never 😋
    15
  260. That's so great!! Congratulations 🎉🎉🎉
    15
  261. Good point!
    15
  262. Thank you so much, and congrats on the offers! You deserve it!
    15
  263. 🌲Tree Playlist: https://www.youtube.com/watch?v=OnSn2XEQ4MY&list=PLot-Xpze53ldg4pN6PfzoJY7KsKcxF1jg&t=0s
    15
  264. Thanks, i appreciate the kind words!
    15
  265. I'm happy my videos are helpful. Setting a timer is super useful advice as well.
    15
  266. That's awesome, good luck!! You got this!!
    15
  267. 🚀 https://neetcode.io/ - I created a FREE site to make interview prep a lot easier, hope it helps! ❤ Meeting Rooms 1: https://www.youtube.com/watch?v=PaJxqZVPhbg
    15
  268. Thank you so much Marco!!
    15
  269. Haha, 12am over here. Thanks for the kind words!
    15
  270. ✏️ Have problem suggestions you would like me to solve? Feel free to comment them below :~)
    15
  271. Best suggestion I have is to talk about possible ways to improve it with the interviewer and they might point you in the right direction.
    14
  272. Lol damn I dont know how that was left in, it sounds like it was looping a few times
    14
  273. That's a good question, it use to confuse me as well. Think of it in terms of passing a value (in this case the queue length) into a function. Basically, the for loop's range() is a function, and we are only calculating the length of the queue a single time and passing it into the range() function.
    14
  274. 🚀 https://neetcode.io/ - I created a FREE site to make interview prep a lot easier, hope it helps! ❤
    14
  275. Sure, I try to do them whenever I have time, usually towards the weekend.
    14
  276. Thanks, I appreciate your kind words more than you think! 😃
    14
  277. now at least one person did :)
    14
  278. Solving this with KMP Algorithm: https://youtu.be/JoF0Z7nVSrA
    13
  279. Agreed!
    13
  280. Congratulations 🎉🎉🎉
    13
  281. I'm glad you asked because I had the same issue at first. There's an interesting fact about how conditional statements work in python. Ex: "If X and Y()", if X is true in this case, Python wont even execute the second conditional, meaning that the function Y won't even be called. This is the reason in my code I called the function first, to make sure it gets called.
    13
  282. Thanks, happy it's helpful! 🙂
    13
  283. Linked List Playlist: https://www.youtube.com/watch?v=G0_I-ZF0S38&list=PLot-Xpze53leU0Ec0VkBhnf4npMRFiNcB&index=1
    13
  284. Yeah, this coming sunday I will introduce something cool for the channel - you heard it here first :)
    13
  285. I just use a computer, mouse and Paint3D.
    13
  286. I think both of them have tradeoffs. JS definitely has less code involved i think, but you're right that Java has more built-in data structures. As long as you're comfortable with the language you choose i think its fine. I prefer python, but many people get offers using Java as well.
    13
  287. I'm pretty sure that she was a recruiter
    13
  288.  @haripatel4766  I retake and do a LOT of editing to make it sound better - without editing i'm pretty bad at speaking.
    13
  289. 💡 GRAPH PLAYLIST: https://www.youtube.com/watch?v=EgI5nU9etnU&list=PLot-Xpze53ldBT_7QA8NVot219jFNr_GI
    13
  290. As long as you don't tell anyone I think I'll be safe 🤫
    13
  291. Good thought, but a counter example would be this [9, 1, 1, 9] In this case we skip both middle values.
    12
  292. I think you're missing the point of the video, if I'm understanding you correctly (which is hard with such an incoherent comment)
    12
  293. I know a guy... 😏
    12
  294. Thanks! Happy to help :)
    12
  295. It's required in python, since the function belongs to the object (self)
    12
  296. Hey Shravan, thank you so much! I really appreciate it 😀
    12
  297. Glad you're starting to feel better dude!! Fwiw i would never have guessed you were burnt out, the videos have been great lately! (i know some were recorded a while ago but still)
    12
  298. 🚀 https://neetcode.io/ - I created a FREE site to make interview prep a lot easier, hope it helps! ❤
    12
  299. Good point. Someone can correct me if I'm wrong, my understanding is we don't need to do a Heap Insert operation, we can just run Heapify algorithm which is O(n).
    12
  300. 💡 GRAPH PLAYLIST: https://www.youtube.com/watch?v=EgI5nU9etnU&list=PLot-Xpze53ldBT_7QA8NVot219jFNr_GI
    12
  301. 💡 LINKED LIST PLAYLIST: https://www.youtube.com/watch?v=G0_I-ZF0S38&list=PLot-Xpze53leU0Ec0VkBhnf4npMRFiNcB&index=2
    12
  302. Good question, the memory comes from the recursion call stack.
    12
  303. ex-google, ex-facebook, ex-husband
    12
  304. That's awesome to hear! Congrats!!!
    11
  305. Yeah that's true, while insert/delete anywhere in a linkedlist is O(1), the catch is you will most likely have to traverse it, so overall it will be O(n).
    11
  306. That's so great to hear!!! Congrats and good luck :)
    11
  307. 🚀 https://neetcode.io/ - A better way to prepare for Coding Interviews
    11
  308. Python Code: https://github.com/neetcode-gh/leetcode/blob/main/752-Open-the-Lock.py Java Code: https://github.com/ndesai15/coding-java/blob/master/src/com/coding/patterns/bfs/OpenLock.java
    11
  309. I'm sorry to hear that, wish you the best - it's only a matter of time!!!
    11
  310. Thanks! I'm happy it was helpful
    11
  311. 💡 GRAPH PLAYLIST: https://www.youtube.com/watch?v=EgI5nU9etnU&list=PLot-Xpze53ldBT_7QA8NVot219jFNr_GI
    11
  312. 💡 DYNAMIC PROGRAMMING PLAYLIST: https://www.youtube.com/watch?v=73r3KWiEvyk&list=PLot-Xpze53lcvx_tjrr_m2lgD2NsRHlNO&index=1
    11
  313. That's true, the seemingly simple problems are always the most challenging
    11
  314. Yes :)
    11
  315. That's smart, I didn't think of that, nice!
    11
  316. Thanks Umbreon, you were always my favorite Eeveelution!
    11
  317. Very clean, but I think removing from the middle of an array is O(n) time complexity. So this would be O(n^2)
    11
  318. I just use a gaming mouse, with Paint3D
    11
  319. Mostly had to learn as I go, so tbh I don't have a very deep understanding of most of the tech I use.
    11
  320. Thank you for the kind words, it means a lot!
    10
  321. If you remove from the middle of the array, internally it may shift all elements in the array resulting in O(n)
    10
  322. Thank you, I will! :)
    10
  323. That's a good point! Will keep that in mind for future videos
    10
  324. of course! added in description :~)
    10
  325. Btw this was identified as a Google question from leetcode 😛: https://leetcode.com/discuss/interview-question/352460/Google-Online-Assessment-Questions
    10
  326. Happy theyre helpful :)
    10
  327. Dynamic Programming Playlist: https://www.youtube.com/watch?v=73r3KWiEvyk&list=PLot-Xpze53lcvx_tjrr_m2lgD2NsRHlNO&index=1
    10
  328. Hopefully the interviewer would give you a hint, because I doubt I could solve it first try 🙃
    10
  329. Agree, it's pretty hard for a medium
    10
  330. I'm sorry to hear that, but I genuinely believe in you! Wishing you the best! ❤️
    10
  331. Good point! I like your way better!
    10
  332. My guess is because it's easier for self taught people. Backend isn't crazy either, but it requires a bit more foundational knowledge, so a CS degree helps.
    10
  333. Okay fine, I will compromise on A- for java 😉
    10
  334. 🌲 Tree Playlist: https://www.youtube.com/watch?v=OnSn2XEQ4MY&list=PLot-Xpze53ldg4pN6PfzoJY7KsKcxF1jg&index=2
    10
  335. In this case, popleft will pop the cells in the order that they are added which is BFS. My understanding is that pop(), pops from the right of the queue which is similar to a stack.
    10
  336. Thank you so much Ian!!!!!!
    10
  337. Yeah thats a really good point!
    10
  338. Thanks, I'm happy theyre helpful :)
    10
  339. That's awesome! Appreciate the kind words!
    10
  340. Thanks!
    10
  341. Lets say we had nums = [1, 2, 3], one subsequence we can take is [1, 3]. In this example we would get sum = 1 - 3. Even though 3 has an even index in the original array, we are still subtracting 3, because it has an odd index in the subsequence. Basically, by "Reindexing", they mean we care about the index from the subsequence, not the index of the original array.
    10
  342. Definitely! I always shy away from DP because it takes me forever to record, but they are some of my favorite problems to solve.
    9
  343. I wish my CS professors told me that when I was a student lol
    9
  344. 💡 DP Playlist: https://www.youtube.com/watch?v=73r3KWiEvyk&list=PLot-Xpze53lcvx_tjrr_m2lgD2NsRHlNO
    9
  345. I feel the same sometimes lol
    9
  346. That's awesome! Congrats 🎉
    9
  347. I rerecorded this solution and made it much better, please watch this instead: https://youtu.be/FOyRpNUSFeA
    9
  348. I think it's okay to look at solutions for new problems. That's how I learned most of my knowledge, eventually you will be able to figure out most problems on your own.
    9
  349. Congrats!! So glad it was helpful!
    9
  350. Congrats 👏🎉🎉🎉
    9
  351. Agreed, though some are just used differently. Like most people don't implement the Strategy pattern from scratch these days, since it's easier to pass in an inline / lambda function in most languages.
    9
  352. That's definitely true, I forgot about that. Usually you shouldn't need the advanced pointer manipulation stuff though. I think pointer basics are easy to pickup for java people.
    9
  353. Sure, will try to do it this week
    9
  354. I'm still at google
    9
  355.  @ZM-dm3jg  https://neetcode.io/roadmap
    9
  356. Thanks Matthew for the kind words! Yeah, I plan on doing some Trie questions soon.
    9
  357. Java Code (by a viewer): https://github.com/ndesai15/coding-java/blob/master/src/com/coding/patterns/stacks/ReversePolishNotation.java
    9
  358. ⭐ BLIND-75 PLAYLIST: https://www.youtube.com/watch?v=KLlXCFG5TnA&list=PLot-Xpze53ldVwtstag2TL4HQhAnC8ATf
    9
  359. Thanks i'm happy they are helpful :)
    9
  360. Timestamps: 0:00 - Conceptual brute force solution 2:03 - Conceptual optimal solution 6:03 - Coding optimal solution
    9
  361. I would say this question is more of Object Oriented Design & Algorithms mixed together. Of course I know it's also asked as a system design question as well.
    9
  362. Best Time to Buy and Sell a Stock 1: https://www.youtube.com/watch?v=1pkOgXD63yU
    9
  363. Lol, I needed someone related to Youtube, and no one would recognize the YT ceo so I went with the biggest youtuber.. if anyone has a better idea i'll change the thumbnail lmao
    9
  364. Hey everyone, this is YOUR daily dose of leetcode 😉
    9
  365. sorry, you must have made a mistake. this exact code worked for me.
    9
  366. Yeah, this is a difficult and unique problem, I think it's hard-level.
    9
  367. Good points
    9
  368. Yeah it teaches you the core syntax and features of Python. Will be launching a Python for coding interviews course next week which shows you how to use all of the built in algorithms and data structures.
    9
  369. Paint3d and streamlabs obs
    8
  370. My bad dawg
    8
  371. That's weird, i'm not sure how middle would ever be zero if left is initialized as L=1
    8
  372. That's a great question because figuring out the dimensions is usually the key in DP problems. Whenever i make a mistake in difficult problems I usually look for slightly easier problems in the same category. I solve these before repeating the difficult problem. Even with practice i still occassionally make mistakes, but I hope this helps!
    8
  373. That's so great to hear, congratulations!!! 🎉
    8
  374. Tree Question Playlist: https://www.youtube.com/watch?v=OnSn2XEQ4MY&list=PLot-Xpze53ldg4pN6PfzoJY7KsKcxF1jg&index=1
    8
  375. agreed
    8
  376. Sure I've been wanting to do egg drop for a while. To be honest I still get nightmares from Cherry pickup 😨🍒🍒🍒
    8
  377. These solutions are already available for free, I just compiled them into one video
    8
  378. Thanks, happy it was helpful! 😃
    8
  379. Tree Playlist: https://www.youtube.com/watch?v=OnSn2XEQ4MY&list=PLot-Xpze53ldg4pN6PfzoJY7KsKcxF1jg
    8
  380. Agree, it's definitely hard-level
    8
  381. The total number of times the inside loop will execute is N, so time is actually O(N +N). Each value can only be added to stack once, and can only be popped once.
    8
  382. That's awesome!!! Good luck at Google!
    8
  383. WOW! That's awesome! The student has become the teacher! now i just need a referral ;) But in all seriousness, congrats! This is a result of all of YOUR hard word, you deserve it!
    8
  384. Yeah, Tech Dose is really good at explaining.
    8
  385. Python Code: https://github.com/neetcode-gh/leetcode/blob/main/658-Find-K-Closest-Elements.py
    8
  386. 🚀 https://neetcode.io/ - 25% OFF LAUNCH SALE Just released the first batch of Advanced Algorithm lessons, along with some other updates. A lot more updates coming soon! 🙂
    8
  387. Sure, I'll try to do it soon
    8
  388. I use Paint3D
    8
  389. I think so... eventually
    8
  390. If you were using it to store information, if you update one row it will update all of the rows in the same position. This would be troublesome for DP problems or graph problems.
    8
  391. That's a fair point - I've seen a lot of talk online that designing and building an app like twitter is trivial, and can be done in a weekend. So at the very least, in this video I tried to make it clear that it is definitely NOT as simple as some ppl online think.
    8
  392. Dynamic Programming Playlist: https://www.youtube.com/watch?v=73r3KWiEvyk&list=PLot-Xpze53lcvx_tjrr_m2lgD2NsRHlNO&index=1
    8
  393. Mainly just from experience (i def didn't come up with it myself). This is a textbook 2D dynamic programming problem, once you understand it, many other problems become easier.
    8
  394. What did you all think of this problem?
    8
  395. Good question, I wanna make a video about that soon 😉
    8
  396. 💡 GRAPH PLAYLIST: https://www.youtube.com/watch?v=EgI5nU9etnU&list=PLot-Xpze53ldBT_7QA8NVot219jFNr_GI&index=2
    8
  397. yeah i used python for all the rounds
    8
  398. Dynamic Programming Playlist: https://www.youtube.com/watch?v=73r3KWiEvyk&list=PLot-Xpze53lcvx_tjrr_m2lgD2NsRHlNO&index=1
    8
  399. Since we know the words are already in sorted order. A simple example would be [a, b, c]. Here we know b comes after a (a -> b) and that c comes after b (b -> c). This tells us a -> b -> c. So it makes no sense to compare a and c.
    8
  400. 🌲 Tree Playlist: https://www.youtube.com/watch?v=OnSn2XEQ4MY&list=PLot-Xpze53ldg4pN6PfzoJY7KsKcxF1jg&index=2
    8
  401. Linked List playlist: https://www.youtube.com/watch?v=G0_I-ZF0S38&list=PLot-Xpze53leU0Ec0VkBhnf4npMRFiNcB&index=1
    8
  402. I agree, if i was building a large project or API i would much prefer Java.
    8
  403. 💡 GRAPH PLAYLIST: https://www.youtube.com/watch?v=EgI5nU9etnU&list=PLot-Xpze53ldBT_7QA8NVot219jFNr_GI
    8
  404. Happy to help 😊
    8
  405. Linked List Playlist: https://www.youtube.com/watch?v=G0_I-ZF0S38&list=PLot-Xpze53leU0Ec0VkBhnf4npMRFiNcB&index=1
    8
  406. Yeah, I definitely plan on primarily doing Algorithm solutions. Those are my bread and butter! But i'll also be trying different stuff like this once in a while.
    7
  407. Python Code: https://github.com/neetcode-gh/leetcode/blob/main/767-Reorganize-String.py Java Code (Provided by a viewer): https://github.com/ndesai15/coding-java/blob/master/src/com/coding/patterns/heap/ReOrganizeString.java
    7
  408. Last time I was accidentally a couple minutes early, but this time i scheduled it for 9PM so I dont think it was early
    7
  409. Most of the time yes, unless the question specifically wants you to implement the underlying Data structure or algorithm
    7
  410. Yes, but unfortunately we have to sort it ourselves, so it's nlogn.
    7
  411. Thanks, happy it was helpful 🙂
    7
  412. dhanyawaad for watching ^_^
    7
  413. I definitely had to look at the solution a lot when I first started
    7
  414. Thanks, I'm happy it was helpful :)
    7
  415. Thanks, much appreciated 😃
    7
  416. A hashmap and dictionary are the same thing in python
    7
  417. Congrats!!!!! And best of luck!
    7
  418. Some facts and some opinions.
    7
  419. Thanks for the kind words. And i wish you good luck on your journey man, you're gonna make progress faster than you expect!
    7
  420. I appreciate the kind words! I'm definitely not a genius, but I love breaking down problems into their simplest form.
    7
  421. I use Paint3D with a mouse
    7
  422.  @BhargavSushant  lol maybe i should
    7
  423. lol
    7
  424. Feel free to suggest problems below! :~)
    7
  425. Thank you so much!
    7
  426. Thanks!
    7
  427. Python Code: https://github.com/neetcode-gh/leetcode/blob/main/909-Snakes-and-Ladders.py Java Code: https://github.com/ndesai15/coding-java/blob/master/src/com/coding/patterns/bfs/SnakesLadders.java (from a viewer - ndesai)
    7
  428. Yes it gives me TLE too, idk why leetcode does that. For some reason they only accept the greedy solution.
    7
  429. Good catch, your right - the return statement was cutoff of the screen. Sorry for confusion, added the entire code in a comment above.
    7
  430. i know you'll make it buddy 🥲
    7
  431. I miss it already 😭
    7
  432. 🌲 Tree Playlist: https://www.youtube.com/watch?v=OnSn2XEQ4MY&list=PLot-Xpze53ldg4pN6PfzoJY7KsKcxF1jg&index=2
    7
  433. Yes, that is also a valid solution! The only down side is, I think in that case you will need O(n) memory to store the original order of the linked list.
    7
  434. I've been thinking about that, will try to make one this month!
    7
  435. Congrats, you deserve it!!! 🎉🎉🎉 And thanks for the kind words.
    7
  436. Thanks! I'm Really happy it was helpful 😃
    7
  437. Thanks :)
    7
  438. lol, thats a better video idea
    7
  439. Dummy.next will be the first node in the merged list, while tail.next would be the last node. Since we want to return the head of the new list, we return dummy.next.
    7
  440. 🤓
    7
  441. Linked List Playlist: https://www.youtube.com/watch?v=G0_I-ZF0S38&list=PLot-Xpze53leU0Ec0VkBhnf4npMRFiNcB&index=1
    7
  442. I can definitely add problem number, but cant you click the link to open the problem or am I misunderstanding?
    7
  443. Yes that correct. I did the opposite by mistake.
    7
  444. 💡 GRAPH PLAYLIST: https://www.youtube.com/watch?v=EgI5nU9etnU&list=PLot-Xpze53ldBT_7QA8NVot219jFNr_GI&index=2
    7
  445. Thank you so much, I really appreciate it!!!
    7
  446. 😳
    7
  447. Neet
    7
  448. That's true, leetcode problem statements can be pretty confusing at times.
    7
  449. That's good to know! Yeah, i knew it was in beta for a while, but overall people like it so maybe i'll go that route.
    6
  450. I know, I was almost finished too 😭
    6
  451. 🚀 https://neetcode.io/ - I created a FREE site to make interview prep a lot easier, hope it helps! ❤
    6
  452. That's correct, I meant that while NoSQL is easier to scale (automatically or by specifying a shard key), we can still scale relational DBs via sharding.
    6
  453. lol
    6
  454. Clean!
    6
  455. I do have the source, I'll be sharing something on that tomorrow, I think it will be really helpful 🙂
    6
  456. The reason we return is because we don't want to execute the rest of the function
    6
  457. Thats definitely a good point!
    6
  458. Linked List Playlist: https://www.youtube.com/watch?v=G0_I-ZF0S38&list=PLot-Xpze53leU0Ec0VkBhnf4npMRFiNcB&index=1
    6
  459. Agree, it's definitely more difficult than some actual hard problems.
    6
  460. That's a really good point actually, it only works in python because numbers are not limited in bits. But yeah in most languages you would have to handle it differently.
    6
  461. Yeah you're right, I think most people do bfs, but I usually do it dfs which is more simple imo (I used dfs for the alien dictionary problem)
    6
  462. Sure, I just use Paint3D
    6
  463. Not even close, binary search is much more efficient
    6
  464. Np 🙂
    6
  465. My understanding is that hashing a string of length n takes O(n). If the string was really large it would take longer to compute the hash.
    6
  466. im shy 😳
    6
  467. Alien Dictionary (HARD) - https://youtu.be/6kTZYvNNyps
    6
  468. Thanks and I use Paint3D
    6
  469. Thanks, appreciate the kind words 🙂
    6
  470. Thanks for the insightful comment - I'm pretty naive about AI other than a couple classes I took in college. Seems like a very interesting frontier - I should learn more about it.
    6
  471. That's awesome Travis, happy I could help!!
    6
  472. 💡 GRAPH PLAYLIST: https://www.youtube.com/watch?v=EgI5nU9etnU&list=PLot-Xpze53ldBT_7QA8NVot219jFNr_GI&index=2
    6
  473. Actually yes, i didn't think of that, but that is also a good solution.
    6
  474. Hi Huy - thank you so much, I really appreciate it!! 😊
    6
  475. 💡 DP Playlist: https://www.youtube.com/watch?v=73r3KWiEvyk&list=PLot-Xpze53lcvx_tjrr_m2lgD2NsRHlNO&index=2
    6
  476. 🌳🌲 Tree Playlist: https://www.youtube.com/watch?v=OnSn2XEQ4MY&list=PLot-Xpze53ldg4pN6PfzoJY7KsKcxF1jg&index=2
    6
  477. Thanks, appreciate that a lot 😃
    6
  478. Python Code: https://github.com/neetcode-gh/leetcode/blob/main/329-Longest-Increasing-Path-in-a-Matrix.py Java Code (courtesy of a viewer - ndesai15): https://github.com/ndesai15/coding-java/blob/master/src/com/coding/patterns/dynamicprogramming/memoize/LongestIncreasingPath.java
    6
  479. I'm used to working from the end backwards because it's similar to the recursive approach. But it's possible and maybe more intuitive to start at the beginning. Whatever makes sense for you is the best approach I think.
    6
  480. Thanks!
    6
  481. Python - https://github.com/neetcode-gh/leetcode/blob/main/410-Split-Array-Largest-Sum.py
    6
  482. That's awesome, congratulations on the offer!! And thanks for the kind words :)
    6
  483. Glad it was helpful!
    6
  484. thats true, unfortunately a lot of schools teach Java in intro to CS courses so they can weed out students. (at least this is true in the U.S.)
    6
  485. Typically its assumed that HashSet/Map operations are O(1)
    6
  486. 💡 DYNAMIC PROGRAMMING PLAYLIST: https://www.youtube.com/watch?v=73r3KWiEvyk&list=PLot-Xpze53lcvx_tjrr_m2lgD2NsRHlNO&index=1
    6
  487. Thanks, appreciate it!
    6
  488. yes you are correct, sorry my brain was lagging for some reason haha. Luckily the algorithm and outcome is still correct though.
    6
  489. We all need a little Miku during these times.
    6
  490. Lol good one
    6
  491. Great video 🔥i should do this with my gf... oh wait
    6
  492. Lol sometimes I get carried away
    6
  493. LRU means the least-recently used will be the first to be evicted - which I think is what you're also saying, unless I'm misunderstanding?
    6
  494. Thanks, good catch!
    6
  495. The second one is the equivalent of temp = nums[r] nums[l] = nums[r] nums[r] = temp Which is different from the first one you wrote. Hope that helps.
    6
  496. There were actually some YTers 15 years (like AVGN and ArshaAsteraki) that gained popularity because of their production value set them apart. But yeah, things are becoming way to overedited nowadays.
    6
  497. Thanks Lucy! 🙂
    6
  498. Yeah, at the interview stage they definitely don't care about your language experience
    6
  499. Glad it was helpful!
    6
  500. 🚀 https://neetcode.io/ - The best FREE site to prepare for Coding Interviews 🥷 Discord: https://discord.gg/ddjKRXPqtk 🐦 Twitter: https://twitter.com/neetcode1
    6
  501. That's a good idea!
    6
  502. Good point, i've used that pattern in previous problems but it slipped my mind.
    6
  503. Thanks, yeah for sure! 👍
    6
  504. Glad they're helpful!
    6
  505. Thanks and for sure!!
    5
  506. Do you have an example test case for that?
    5
  507. Yes, set is a HashSet
    5
  508. Yup good point, nlogk solution is also possible and good thing about that is we can use the built in MinHeap in python.
    5
  509. Good point, I'll try to do mostly free problems. Also if you want to try this problem without Premium you can using the pinned comment.
    5
  510. Thanks, much appreciated :)
    5
  511. lol me too
    5
  512. Usually shallow. I remember the first time I was using docker I tried to read a bunch of articles to figure out how hypervisors work, and then I realized I didn't even need to know 90% of that shit. Sometimes you have to dig deeper which is fine.
    5
  513. Linked List Playlist: https://www.youtube.com/watch?v=G0_I-ZF0S38&list=PLot-Xpze53leU0Ec0VkBhnf4npMRFiNcB&index=1
    5
  514. More Graph Problems: https://www.youtube.com/watch?v=utDu3Q7Flrw&list=PLot-Xpze53ldBT_7QA8NVot219jFNr_GI&index=1
    5
  515. In python, a set is a hashset, so searching takes O(1)
    5
  516. Employment gaps are sometimes a turnoff, but not a huge deal. Especially if you had a good amount of experience before the gap. For my situation, having a gap made things harder, but things still worked out for me. Best of luck, I'm sure it will work out :)
    5
  517. lol i didnt notice that
    5
  518. Yeah that's correct
    5
  519. In my experience at FAANG interviews, it's usually fine. But if you are unsure, feel free to ask your interviewer and they will let you know.
    5
  520. Yeah I agree!
    5
  521. Absolutely, I struggled a lot with easy questions when I started. Eventually you will make progress!
    5
  522. 💡 GRAPH PLAYLIST: https://www.youtube.com/watch?v=EgI5nU9etnU&list=PLot-Xpze53ldBT_7QA8NVot219jFNr_GI
    5
  523. yes thats correct, we fill the hashmap first. O(2n) is equal to O(n)
    5
  524. Appreciate that :)
    5
  525. Dynamic Programming Playlist: https://www.youtube.com/watch?v=73r3KWiEvyk&list=PLot-Xpze53lcvx_tjrr_m2lgD2NsRHlNO&index=1
    5
  526. ✅ EASY PLAYLIST: https://www.youtube.com/watch?v=KLlXCFG5TnA&list=PLot-Xpze53lfQmTEztbgdp8ALEoydvnRQ
    5
  527. 💡 BINARY SEARCH PLAYLIST: https://www.youtube.com/watch?v=U8XENwh8Oy8&list=PLot-Xpze53leNZQd0iINpD-MAhMOMzWvO
    5
  528. Yeah I really like math as well! Hoping coding becomes more math heavy
    5
  529. That's definitely true, I would prefer to code out the memorization solution and then code the DP solution. Main reason I don't in the videos is to keep the video concise.
    5
  530. Surely you tried it after the contest was over right 😉
    5
  531.  @randytruong6621  It will be DSA related - features I haven't seen anywhere else.
    5
  532. 🙂
    5
  533. The code will actually return -2.
    5
  534. Glad it was helpful :)
    5
  535. Definitely agree, the Q&A site has been a life saver for me.
    5
  536. me neither probably, im sure 90% of interviewers would give you a hint tho.
    5
  537. Thank you so much 🙏
    5
  538. 🌲 TREE PLAYLIST: https://www.youtube.com/watch?v=OnSn2XEQ4MY&list=PLot-Xpze53ldg4pN6PfzoJY7KsKcxF1jg&index=2
    5
  539. Python Code: https://github.com/neetcode-gh/leetcode/blob/main/136-Single-Number.py Java Code (from a viewer - ndesai): https://github.com/ndesai15/coding-java/blob/master/src/com/coding/patterns/bitwiseXOR/SingleNumberXOR.java
    5
  540. Thank you, I'm really glad to be helpful! :)
    5
  541. Thanks, and I'll definitely continue!
    5
  542. 💡 BACKTRACKING PLAYLIST: https://www.youtube.com/watch?v=pfiQ_PS1g8E&list=PLot-Xpze53lf5C3HSjCnyFghlW0G1HHXo
    5
  543. Agree it's definitely complex. If it helps there's another problem that uses the same exact technique: https://youtu.be/jSto0O4AJbM
    5
  544. Lol, i think its weird too but that's technically how it's pronounced 🤷
    5
  545. How is 7 the max profit here?
    5
  546. Haha I appreciate it 😊
    5
  547.  @morenomt27  Good luck!!
    5
  548. Yeah, most people usually start from i=0, that def works. I go backwards because it's closer to the drawing explanation.
    5
  549. Thanks! I'm happy they are helpful!
    5
  550. Yup good point, forgot about that.
    5
  551. I think it will be a little better now 😉
    5
  552. 💡 GRAPH PLAYLIST: https://www.youtube.com/watch?v=EgI5nU9etnU&list=PLot-Xpze53ldBT_7QA8NVot219jFNr_GI&index=2
    5
  553. Yeah, I plan on doing those problems as well!
    5
  554. good point, yeah that works too
    5
  555. Yeah linear search works but Binary search is more efficient for large inputs.
    5
  556. Yes
    5
  557. A set in Python is a HashSet, which is more efficient for looking up values (basically the "i in seen" is more efficient compared to a list.)
    5
  558. 💡 BACKTRACKING PLAYLIST: https://www.youtube.com/watch?v=pfiQ_PS1g8E&list=PLot-Xpze53lf5C3HSjCnyFghlW0G1HHXo&index=1
    5
  559. Sure, here it is: https://docs.google.com/spreadsheets/d/1A2PaQKcdwO_lwxz9bAnxXnIQayCouZP6d-ENrBz_NXc/edit#gid=0
    5
  560. If we wanted all the people that user1 follows (in order to generate their news feed) we could run a query like: SELECT * FROM followers WHERE followers.followerId = user1 Notice we are filtering by followerId.
    5
  561. Yeah, I wanted to do it much sooner... but better late than never :)
    5
  562. 💡 BACKTRACKING PLAYLIST: https://www.youtube.com/watch?v=pfiQ_PS1g8E&list=PLot-Xpze53lf5C3HSjCnyFghlW0G1HHXo
    5
  563. I have that recorded and edited. Should be uploaded tomorrow! 👍
    5
  564. That's awesome, congrats on the job 🎉👏
    5
  565. Thanks 😊
    5
  566. Yeah, I agree a hashmap is probably better in this case. That said, the worst-case time complexity should stay the same.
    5
  567. lol whoops i missed that part
    5
  568. Good catch, just fixed it
    5
  569.  @issamuhsen1245  No problem, yeah you can email me. I charge ~$500 per hour.
    5
  570. Completely agree
    5
  571. Dynamic Programming Playlist: https://www.youtube.com/watch?v=73r3KWiEvyk&list=PLot-Xpze53lcvx_tjrr_m2lgD2NsRHlNO&index=1
    5
  572. You have to use the nonlocal python keyword to do it that way. Otherwise it thinks you're using a variable local to the function, which hasn't been assigned yet.
    5
  573. Agree!
    4
  574. 1. Not required but it does help, even if the degree is not CS. 2. I think Python, 2nd is C++, 3rd is Java. 3. For a beginner, I think 3-6 months, depending on how much you study.
    4
  575. Well.. not anymore :p
    4
  576. Python
    4
  577. Because I couldn't solve it first try 😛
    4
  578. Looking at it day by day, there's too much noise imo to still say. There's signs of eventual AGI and simultaneously signs of plateauing. It really seems like AI assistants will help white collar professionals at this point. Whether that actually reduces jobs or not is hard to say.
    4
  579. ⭐ MEDIUM Playlist: https://www.youtube.com/watch?v=jzZsG8n2R9A&list=PLot-Xpze53lfOdF3KwpMSFEyfE77zIwiP
    4
  580. A nice coincidence! Thanks for watching
    4
  581. definitely good points
    4
  582. Congrats, You deserve it! I'm happy the videos were helpful.
    4
  583. No major reasons. I've used React before, and while it's easier to get started it's not really a 'complete' framework, since you have to install external packages for stuff like routing.
    4
  584. Good luck Annie! :)
    4
  585. If I recall I think each element will only be visited once in this solution
    4
  586. Congrats on the Amazon offer and good luck in your future! Happy I could help :)
    4
  587.  @vchandra6315  Thank you so much!! Really happy they were helpful!
    4
  588. 💡 BINARY SEARCH PLAYLIST: https://www.youtube.com/watch?v=U8XENwh8Oy8&list=PLot-Xpze53leNZQd0iINpD-MAhMOMzWvO
    4
  589. Yes in python they do
    4
  590. i never realized how much i say that, believe it or not i edited some of them out lol 😂
    4
  591. 💡 SIMILAR PROBLEM: https://www.youtube.com/watch?v=zx5Sw9130L0
    4
  592. I use Paint3D
    4
  593. Lol I might have to steal this one
    4
  594. I use Paint3D with a mouse, and Streamlabs OBS for screen recording.
    4
  595. Yeah this was really great!! Definitely relate to the debugging lol, i remember spending weeks just getting a test an rpc to work locally 😭
    4
  596. Sure, I use Paint3D
    4
  597. YOU GOT THIS!!!
    4
  598. If I recall, you cant add arrays to a set in python, you have to use tuples. But I guess I could have also used tuples when adding to the queue for consistency.
    4
  599. Tree Question Playlist: https://www.youtube.com/watch?v=OnSn2XEQ4MY&list=PLot-Xpze53ldg4pN6PfzoJY7KsKcxF1jg&index=1
    4
  600. By the end of October! Plan to pick up the pace this weekend
    4
  601. No problem, happy to help
    4
  602. Damn my chances of getting in aren't high it seems
    4
  603. Paint3D
    4
  604. Sorry bout that, should be fixed.
    4
  605. I use Paint3D
    4
  606. I just use Paint3D (free) and a mouse with low dpi
    4
  607. Lol idk what I was thinking 😛
    4
  608. Happy it was helpful! 🙂
    4
  609. Sure, this is the mic I use: https://amzn.to/2RRrLQd And I just use Paint3D for the drawings with a mouse.
    4
  610. I hope it went well! 🤞
    4
  611. Python Code: https://github.com/neetcode-gh/leetcode/blob/main/724-Find-Pivot-Index.py Java Code: https://github.com/ndesai15/coding-java/blob/master/src/com/coding/patterns/arrays/PivotIndexFinder.java (Provided by ndesai15 / Neel Desai)
    4
  612. He had to leave for copyright reasons 😞
    4
  613. Sorry about that, here's the full code: https://github.com/neetcode-gh/leetcode/blob/main/python/901-Online-Stock-Span.py
    4
  614. 💡 DP Playlist: https://www.youtube.com/watch?v=73r3KWiEvyk&list=PLot-Xpze53lcvx_tjrr_m2lgD2NsRHlNO
    4
  615. The feed cache will not contain the images and media, so avg tweet size will be closer to 1kb. 20TB of memory is expensive, but feasible.
    4
  616. Yes I will try to do the in the near future
    4
  617. It's O(n) because the inner loop won't be executing n times every single time. In total the inner loop will execute n times.
    4
  618. Nice!
    4
  619. Good point!
    4
  620. Yeah, I know what you mean. I actually only came up with the O(n*n*k) by myself, but I quickly understood the O(n*k) when i read it. Yes, this "reverse thinking" pattern is seen in other DP problems. A recent problem i solved, Bursting Baloons, followed the exact same pattern. So I do think experience and practice can help you recognize it. But sometimes when you run out of all options you just have to try and see if reversing the problem simplifies it.
    4
  621. It feels like I'm click baiting lol
    4
  622. who me? 🐐
    4
  623. Happy to help!
    4
  624. Good idea, I definitely will try to work on that!
    4
  625. 💡 GRAPH PLAYLIST: https://www.youtube.com/watch?v=EgI5nU9etnU&list=PLot-Xpze53ldBT_7QA8NVot219jFNr_GI
    4
  626. Thank you I appreciate that, i was just kidding about leaving google tho, just making a joke about how many youtubers become "ex-google" lol.
    4
  627. lol nice streak
    4
  628. That's great, congratulation 🎉🎉
    4
  629. This problem is a bit different, since there isn't a very useful recursion/memorization solution. While this problem does have sub problems, they don't need to be stored in memory. It still has some DP aspects to it imo tho.
    4
  630. No problem, happy to help ^_^
    4
  631. Deck is the superior pronunciation. De-queue, could be confused with the operation that a Deck supports. That is all. Amazing video though!
    4
  632. Sure, i'll try to upload it soon!
    4
  633. Mostly random
    4
  634. That's awesome! I'm sure you will do even better than you expect!
    4
  635. https://youtu.be/FdzJmTCVyJU
    4
  636. In python a single '/' will evaluate to decimal division (e.g. 1 / 2 = 0.5), where as '//' evaluates to integer division which is the default for most languages (e.g. 1 / 2 = 0)
    4
  637. Hey Shanshan - thank you so much, I really appreciate it!! 😊
    4
  638. lol
    4
  639. Sure, this is the mic I use: https://amzn.to/2RRrLQd And I just use Paint3D for the drawings with a mouse.
    4
  640. Tell me about it haha.... :c
    4
  641. Congratulations 🎉🎉
    4
  642. Yes, this solution is considered Dynamic Programming, i have created a playlist of DP solutions: https://www.youtube.com/playlist?list=PLot-Xpze53lcvx_tjrr_m2lgD2NsRHlNO
    4
  643. Nowadays probably about 1 problem a day. When I'm grinding for interviews I usually do about 5 problems a day
    4
  644. lol
    4
  645. Lets consider an example where Input Array is length=3. That means 1, 2, or 3 must be the smallest missing positive, except if all three of those values are in the input, then the result will be 4. By change the input array to be negative, I'm basically marking which of the values in [1, 2, 3] show up in our array. Notice how since our input array is length=3, I can map 1 -> index 0, 2 -> index 1, and 3 -> index2. Once we've marked every value that appears as negative at it's corresponding index. Finally, in the final loop we can iterate through the modified input array. The first non-negative value we see, will give us the result: for example, if index=0 is not negative, that means the value = 1 is going to be the first missing positive. If index=1 is non negative, that means value=2 is the first missing positive. If every value in the input array is negative, that means value=4 is first missing positive. (Remember, i mentioned above that 4 is the worst case solution).
    4
  646. Sure! Was planning on doing that one in a couple days!
    4
  647. That's awesome, I'm happy they were helpful!
    4
  648. Sure, you can find it here: https://docs.google.com/spreadsheets/d/1A2PaQKcdwO_lwxz9bAnxXnIQayCouZP6d-ENrBz_NXc/edit#gid=0
    4
  649. I now own two pairs of shirts
    4
  650. Lmao
    4
  651. 🚀 https://neetcode.io/ - A free resource to prepare for Coding Interviews
    4
  652. I think it's actually $10k. 1% = 1/100 0.000001% = 1 / 100,000,000 $1T of that is about $10k I think, but I wish it was a 1M, I would start putting "as a millionaire" in my titles 😝.
    4
  653. Just ran the same code and it works, pasted it below, let me know if it still gives error: class Solution: def isRobotBounded(self, instructions: str) -> bool: dirX, dirY = 0, 1 x, y = 0, 0 for d in instructions: if d == "G": x, y = x + dirX, y + dirY elif d == "L": dirX, dirY = -1*dirY, dirX else: dirX, dirY = dirY, -1*dirX return (x, y) == (0, 0) or (dirX, dirY) != (0, 1)
    4
  654. Thank you so much!!
    4
  655. fixed!
    4
  656. This is the question I asked: https://leetcode.com/problems/insert-delete-getrandom-o1/ We actually solved it on the channel here: https://youtu.be/j4KwhBziOpg
    4
  657. Good point!
    4
  658. 💡 DP Playlist: https://www.youtube.com/watch?v=73r3KWiEvyk&list=PLot-Xpze53lcvx_tjrr_m2lgD2NsRHlNO
    4
  659. No, I wish 😭
    4
  660. 💡 DP PLAYLIST: https://www.youtube.com/watch?v=73r3KWiEvyk&list=PLot-Xpze53lcvx_tjrr_m2lgD2NsRHlNO&index=2
    4
  661. It's right now
    4
  662. Tree Playlist: https://www.youtube.com/watch?v=OnSn2XEQ4MY&list=PLot-Xpze53ldg4pN6PfzoJY7KsKcxF1jg&index=2
    4
  663. Thank you so much, I really appreciate it! 😊
    4
  664. Yes thats exactly correct.
    4
  665. No.. not yet at least 😉
    4
  666. Try it on that test case and see what happens
    4
  667. Thank you so much!
    4
  668. Interesting problem, I'll try to do it soon!
    4
  669. I've personally never been asked to draw in an interview, but it could be helpful. Btw I use Paint3D
    4
  670. Lol true
    4
  671. Great suggestion, I will look into that!
    4
  672. Yes it's very similar, main difference is that for this problem we actually have to update the matrix, and do it in-place.
    4
  673. Of course it will keep getting better, I said the same thing. The question is how quickly and what are it's limits? For all the people in the comments who think the sky is falling, they don't seem to have any better advice then to say "You will definitely lose your job". Which I think is also a close minded view.
    4
  674. Nevermind, looks like they do :) https://leetcode.com/discuss/feedback/187751/is-there-an-api-call-to-get-number-of-problems-solved
    4
  675. Usually you shouldn't spend more than30min before looking at the solution. I've definitely had to look at solutions, but I tried to at least figure out the general approach if possible (e.g. ok this problem feels like DP but I can't figure out the trick needed). If you look at the solution, it's good to revisit the problem later and see if you can solve it again without looking at the solution.
    4
  676. I use paint3d
    4
  677. Yeah, arrays in python are called lists, but the merge two sorted lists video is about Linked lists. The name does make it confusing, sorry about that.
    4
  678. I think most of the existing java code was written before Go existed and migrating would be expensive.
    4
  679. Congrats Kevin!
    4
  680. Haha, technically I am a NEET right now, but maybe not in its true meaning. Good luck with self-teaching, it's definitely possible because many people have been successful doing that.
    4
  681. I love him, so I appreciate this comment
    4
  682. Yes you're right, I have no idea how I didn't notice that, sorry for the confusion.
    4
  683. lmao
    4
  684.  @uHnodnarB  that makes two :)
    4
  685. Yeah I've been wanting to do it for a while but been busy. I will definitely start by August tho!
    4
  686. I definitely prefer Java over the sequel JS.
    3
  687. Using the top-right settings button, and change theme to Monokai
    3
  688. Yeah, I do have plans for different kinds of videos and also live streaming, Q/A, etc. For the next month I'm gonna be pretty busy with life stuff, but after that I'm definitely gonna do some streaming
    3
  689. Yeah, even listening back to the video I was thinking.. do I really need to rewrite the UI or do i just want to..
    3
  690. Return in this case is just being used to end the function early, it's not really returning a meaningful value.
    3
  691. No problem!
    3
  692. yes exactly
    3
  693. Thanks, I'm glad it was helpful =)
    3
  694. True, it's definitely not obvious
    3
  695. I think that's a feature of Counter() in python, it's similar to a defaultdict. Of course, we could manually write some logic to check absence of chars. (maybe if the interviewer wanted us to)
    3
  696. I think 15-20min is a good rule of thumb.
    3
  697. Absolutely not
    3
  698. "Guess the Word". It's a weird question for leetcode, it would probably be better with a real interviewer where you could discuss the solution with someone
    3
  699. Happy to help 🙂
    3
  700. I don't think so, because dp[amount], which is the result (aka the fewest number of coins needed) will not always be equal to amount. For example, if amount = 5, and we find that it takes 3 coins to make that amount, we want to return 3, not return -1.
    3
  701. Glad it was helpful!
    3
  702. Good point, I didn't know that. But this is helpful for people considering switching to Kotlin
    3
  703. Do you mean the code does not get submitted? I tried it and it does, I'm guessing you may have a typo
    3
  704. Yes you're right that those strings don't match, but the function will continue I think and eventually return false in that case. For example, in P, there is a remaining b, but the function doesn't yet know if that is a mandatory b, or if it's a b*, because b* means that the b is not mandatory.
    3
  705. I think LC agreed with you because they changed it to medium now lol 😂
    3
  706. Good point! somehow i missed that, but luckily the code works whether we put it inside or leave it outside the if-condition.
    3
  707. 🚀 https://neetcode.io/ - 25% OFF LAUNCH SALE
    3
  708. No, I think either one is fine. I'm more use to DFS but sometime BFS can make problems easier.
    3
  709. Yes, sometimes you have to take the long route before you can understand the short cut.
    3
  710. Yep, i'm using Firebase firestore and while they do have a free tier, I can see that users are quickly burning through that at the moment :~)
    3
  711. neat!
    3
  712. Thank you so much, I really appreciate it! 😃
    3
  713. Yeah good point, in this case I think we're guaranteed no invalid calls will be made, but in a real interview your point would be good to ask.
    3
  714. Fixed!
    3
  715. I used to have a mechanical one, but now I use and prefer this really cheap logitech keyboard: https://amzn.to/3zQBozP
    3
  716. whoops, luckily youtube lets you edit videos after uploading. should be fixed in a couple hours :)
    3
  717. Thanks, I use Paint3D with a mouse
    3
  718. Sure I'll probably do it tomorrow or the day after
    3
  719. Thanks! :)
    3
  720. Glad to help!
    3
  721. Lol don't forget about Dynamic programming. So far have used that zero times
    3
  722. In terms of Big-O, it's not more efficient.
    3
  723. great argument, would you say the same to all the experts that agree with me? and you know what you are saying?
    3
  724. This was for new grad software engineer in 2019!
    3
  725. That's unlucky, but it sounds like you did pretty well to come up with a solution. If it was recent, I hope you get positive feedback. Good luck in future interviews!
    3
  726. Good point
    3
  727. I actually did add that, but it's on the practice page!
    3
  728. hell yeah!
    3
  729. Maybe one day I'll have that privilege 😭
    3
  730. Lol
    3
  731. Thanks, glad they are helpful!
    3
  732. I agree, the resumes are definitely not impressive.
    3
  733. Sorry about that, just fixed it!
    3
  734. I use Paint3D
    3
  735. Thank you so much, I really appreciate it!!! :)
    3
  736. Agree
    3
  737. For most companies, they let you choose the language you interview in, so python should be fine. You might have to learn other languages on the job tho.
    3
  738. haha, thanks I appreciate the kind words
    3
  739. Thanks! Happy it was helpful! :)
    3
  740. The fact that it's 70% better in a blind test, shows that users don't think it's 'objectively' better. Also, for the last 10%, what I meant is that to solve a problem 90% of the way through is A LOT easier than solving it 100%. E.g. to automate 90% of a programmers responsibilities is a lot easier than 100%.
    3
  741. You probably didn't copy all of the code, I'm guessing you forgot to advance a pointer
    3
  742. Happy it was helpful 🙂
    3
  743. A large variety of ideas, great job Kylie!
    3
  744. Yeah I use a mouse with low dpi 😅
    3
  745.  @sofoboachie5221  Added in description :~)
    3
  746. If we sort based on start time I don't believe we have to worry about this one
    3
  747. Thank you so much and congratulations!!!
    3
  748.  @yashrathi6862  Thanks! I'm definitely gonna keep going!
    3
  749. Thanks for letting me know, Fixed!
    3
  750. Mostly I couldn't get any interviews, even OAs. I think it's easier now tho, seems most companies are hiring.
    3
  751. Happy it's helpful :)
    3
  752. Thanks, much appreciated!
    3
  753. I think the easiest way to start would be to checkout neetcode.io and start with easy problems and watch the videos if you get stuck. But I definitely plan on making more beginner friendly content soon!
    3
  754. Sure, I'll try to by the end of this week
    3
  755. Yeah, I think that would work too and is probably more intuitive.
    3
  756. tysm!!
    3
  757. Glad it helped!
    3
  758. I think I used PRAW
    3
  759. Thanks for the super chat and supporting the channel! :)
    3
  760. Thank you!
    3
  761. Thanks glad someone liked it lol
    3
  762. Yup, exactly!
    3
  763. balls
    3
  764. Yup, check it out here: https://docs.google.com/spreadsheets/d/1A2PaQKcdwO_lwxz9bAnxXnIQayCouZP6d-ENrBz_NXc/edit#gid=0
    3
  765. no thats okay, it's definitely difficult. it's expected that you would have to look at the solutions, just try your best to understand them
    3
  766. Thank you 🙏
    3
  767. Yeah, exactly!
    3
  768. I definitely wanna do some DP soon, but I also wanna cover some of the basics first. Any specific DP problems you are looking for?
    3
  769. Thank you so much for the kind words Farnaz! Don't worry I will continue the channel for sure. And I'm confident that things are gonna work out for you as well!
    3
  770. Fair enough - it's definitely powerful. But it also fails at some very basic tasks, like arithmetic and algebra. I think in its current form it is over hyped, but i'm sure it will continue to improve.
    3
  771. Lol damn i forgot about that, I just blurred that part. Will take yt a bit to update it.
    3
  772. Thanks! :)
    3
  773. Paint3d
    3
  774. That's definitely true, python makes it work but in other languages it probably won't work.
    3
  775. Thank you so much!
    3
  776. Good luck man, you got this!!!!
    3
  777. Glad it was helpful!
    3
  778. I appreciate that!
    3
  779. I use Paint3D
    3
  780. 💡 GRAPH PLAYLIST: https://www.youtube.com/watch?v=EgI5nU9etnU&list=PLot-Xpze53ldBT_7QA8NVot219jFNr_GI
    3
  781. What will the solution return in this case? Is the expected result 0?
    3
  782.  @liairi6834  Just fixed, surprised no one noticed until now lol
    3
  783. 🌲 TREE PLAYLIST: https://www.youtube.com/watch?v=OnSn2XEQ4MY&list=PLot-Xpze53ldg4pN6PfzoJY7KsKcxF1jg&index=2
    3
  784. Mainly because checking if a value exists in a HashSet is O(1) time, but with a list it's O(n).
    3
  785. Just a personal preference because it matches how the recursive solution is written. But you're right that left to right works just as well!
    3
  786. i think it's a meme but i'm not too sure either
    3
  787. 💡 DYNAMIC PROGRAMMING PLAYLIST: https://www.youtube.com/watch?v=73r3KWiEvyk&list=PLot-Xpze53lcvx_tjrr_m2lgD2NsRHlNO&index=1
    3
  788. That's definitely true, remote interviews can be more challenging. I've actually seen ppl use pen and paper to explain some things, but it can be hit or miss. Tho, I feel like remote interview have less pressure cause you can just sit at home in your underwear. At this point I'm not sure when in-person interviews will resume.
    3
  789. Happy it was helpful!
    3
  790. I've driven in friends' teslas all the time. Don't you literally have to be touching the wheel or the tesla will start warning you? Sounds like what you're doing is illegal or you're exaggerating...
    3
  791. Thanks, glad it was helpful
    3
  792. 5.9% completion right now lol
    3
  793. for coding interviews yes, but it won't teach you everything about software eng
    3
  794. I would love to see it :)
    3
  795. I think coding skills are a prerequisite.
    3
  796. Easier than LC hards, that's for sure! But a bit more boring also lol 🤣
    3
  797. Good question, consider this example: [100, 4, 4, 100] Here we rob the first and last, (skip the middle two) in order to get the maximum.
    3
  798. Sorry it was a frontend bug, should be fixed now.
    3
  799. Set in this case is a hashset, so it will be more efficient that a list
    3
  800. O(n)
    3
  801. You are correct, that when we reach the 0 we reset curMin,curMax to 1. But before we do, we get a curMax of 3 from [1,3], and thus our result is set to 3 before we reset. I guess it's confusing because curMax is not the variable we are using to return the result.
    3
  802. Sometimes it gets it right and sometimes it doesn't. Just tweak the input array a few times and you will notice the same thing. I've been able to reproduce it multiple times and can still do so.
    3
  803. Yeah, I intentionally picked this problem to help him out
    3
  804. It's definitely a possibility, but demand is not necessarily inelastic. We've already had tech, like Cloud computing, that increases productivity. But this hasn't lead to fewer devs, instead there are more devs than ever before. I definitely don't know the future, but I think most people online are way too one-sided.
    3
  805. Yes sir, I will be doing that in a few days!
    3
  806. Yeah this is all stock footage
    3
  807. Thanks! I'm using Microsoft Paint 3D (free) 🙂
    3
  808. python gang lets go 😎
    3
  809. It works by default for me, but you might have to add "import heapq"
    3
  810. Good luck, you'll do great 👍😃
    3
  811. That's okay, I was in the same position. I recommend practicing, if you get stuck try to watch an explanation
    3
  812. Thank you so much!
    3
  813. Sorry about that, is the coupon code "neetcode"? Not sure what issue is, maybe it depends on location
    3
  814. Yes, a Two-pass solution is also possible in Python, and i think the code is pretty much the same as in Java. For the first pass, you Map each num to the index. The second pass you search for the nums: num1 + num2 == TwoSum, and make sure that num1 and num2 have different index.
    3
  815. Thanks Tony! I'm happy they are helpful for you!
    3
  816. true dat
    3
  817. Yeah if it gets traction that sounds like a good idea, gonna start with blind 75 and then NC 150
    3
  818. Good luck!
    3
  819. ⭐ MEDIUM Playlist: https://www.youtube.com/watch?v=jzZsG8n2R9A&list=PLot-Xpze53lfOdF3KwpMSFEyfE77zIwiP
    3
  820. The solution that I coded is O(n). A set in Python is a hashset, so each operation is O(1).
    3
  821. Thank you so much!
    3
  822. I think most interviewers would accept O(logn) and would prob give hints for better solutions.
    3
  823. 20B bytes = 20GB. A MB is just 1,000,000 bytes. 20B megabytes = 20GB x 1000 x 1000 = 20PB.
    3
  824. Dynamic Programming Playlist: https://www.youtube.com/watch?v=73r3KWiEvyk&list=PLot-Xpze53lcvx_tjrr_m2lgD2NsRHlNO&index=1
    3
  825. Yes that's correct
    2
  826. Good luck, looking forward to it! 👍
    2
  827. Glad it helped!
    2
  828. This reminds me of mongodb queries
    2
  829.  @pedroduckz  Updated the links, they should work now :)
    2
  830. You can dress casually, i wore a tshirt and jeans.
    2
  831. Glad you like them!
    2
  832. I use Paint3D, I didn't use it in the interview, pretty sure it's not allowed.
    2
  833. Python Code: https://github.com/neetcode-gh/leetcode/blob/main/678-Valid-Parenthesis-String.py
    2
  834. Thanks!
    2
  835. Congratulations 😃
    2
  836. Thank you so much 🙏
    2
  837. I think for this problem both DFS and BFS are about the same. It probably depends more on which one you are more comfortable with coding.
    2
  838. 😅
    2
  839. I use Paint3D
    2
  840. Possibly, but I think it will take longer. Especially because it will take humans to verify the code the AI writes.
    2
  841. Agreed 😹
    2
  842. Thanks!
    2
  843. i put a 'not' in front of it, i think "if not (left < right and top < bottom)" in c++ would be "if !(left < right && top < bottom)", so ! instead of not. But the way you wrote it is probably better and more readable.
    2
  844. I don't know if I'm competent enough but I'll definitely talk about it :)
    2
  845. Sure, I'll look into it.
    2
  846. Some companies like Facebook supposedly banned their employees from asking DP questions in interviews.
    2
  847. Don't worry, I always roll one up before I leetcode 🚬
    2
  848. Mostly internal infrastructure 🙃
    2
  849. Thank you so much!!!
    2
  850. You likely have a typo, the code Ive shown still works
    2
  851. About 45 min for coding and 30 for googlyness.
    2
  852. Thanks, yes I will solve that problem soon!
    2
  853. Just tested, and my code returns 5
    2
  854. True
    2
  855. Thank you for the kind words 🙂
    2
  856. thank you so much!!
    2
  857. It should still be divided by topics. There's a button in the toolbar of the practice page that lets you toggle from list view to grouped view
    2
  858. Definitely
    2
  859. YO! love your videos they're hilarious man!
    2
  860. I had to leave that in, but I also didn't wanna piss off any crypto fans too much lol
    2
  861. Thank you so much!
    2
  862. Sure, I will add that to my list and solve it soon!
    2
  863.  @algorithmo134  Yeah sorry about that, its weird, for some reason the HD is still processing like 10 hours later. i think this is a problem on youtube's end. First time its happened to me.
    2
  864. Yeah I think it also works
    2
  865. Hopefully next month!
    2
  866. No problem! 👍
    2
  867. Thanks, that means alot :~)
    2
  868. Thanks! Happy it was helpful.
    2
  869. Yup thats exactly correct! and thanks for the kind words
    2
  870. Yeah I think you're right, for some reason (even real interviewers) always assume it doesn't take space, but definitely something to mention to your interviewer just in case.
    2
  871. Sure, the spreadsheet link should be in the description!
    2
  872. Yeah I'll try to add it soon
    2
  873. Yes, but the dynamic programming skills you learn from those problems can be applied to more difficult problems. The LIS also has a simple solution with a single loop, but i bet you cant come up with that solution unless you figure out the recursive solution first.
    2
  874. I used an angular library built on top of the D3 library
    2
  875. That's great, I like this one better!
    2
  876. I believe this covers most of it, let me know if you think i left anything out and i'll update the code that's linked in the top comment.
    2
  877. Mainly by solving leetcode problems and googling things i didn't understand
    2
  878. Thanks, I use Paint3D
    2
  879. Link should be in the description
    2
  880. Yeah, it's possible. But if that's the case hopefully it can provide value for everyone, maybe resulting in a universal basic income.
    2
  881. Thank you so much!
    2
  882. Thank you so much!
    2
  883. Thank you so much Chinmay!
    2
  884. That's a really good point actually, I completely agree!
    2
  885. Yeah, I'll probably do future problems with normal iteration
    2
  886. yup thats correct because dicts are just hashmaps
    2
  887. What do you mean? It's working for me.
    2
  888.  @vishvamurthy8089  Thanks! Please let me know if you have any other issues with the site.
    2
  889. Awesome, congrats 🎉
    2
  890.  @MaydayMishap  Yeah but one of the methods actually has a thought process behind it where as the other is just rote memorization
    2
  891. That's a good idea, I'll try to plan some content around that in the near future. I definitely enjoy making more advanced content.
    2
  892. Thank you so much!!
    2
  893. Sorry to hear that, this is a tough one. Best of luck tho, you don't always have to do perfectly to pass 🙂
    2
  894. Sure, I'll try to do that soon.
    2
  895. Hey! I actually just created one, you can find it here: 💡 BACKTRACKING PLAYLIST: https://www.youtube.com/watch?v=pfiQ_PS1g8E&list=PLot-Xpze53lf5C3HSjCnyFghlW0G1HHXo&index=1
    2
  896. Thanks!
    2
  897. took me a year to get it lol
    2
  898. Thank you so much John!!
    2
  899. Lol
    2
  900. Thanks for the suggestion, will look into that!
    2
  901. That was the Grinch of course 🎅
    2
  902. Thanks!
    2
  903. I think Java is fine, but imo python def has an advantage for interviews.
    2
  904. Thanks, I'm glad it was helpful!
    2
  905. Appreciate it :)
    2
  906. Happy the videos are helpful and best of luck 🙂
    2
  907. We may have different definitions of memorizing. Or maybe we just completely disagree.
    2
  908. Why would it not work in that case?
    2
  909.  @abc_noob  Sure, will do!
    2
  910. Glad it helped!
    2
  911. Python
    2
  912. Thats awesome! I'm glad it was helpful
    2
  913. Thanks for letting me know, fixed!
    2
  914. true dat
    2
  915. Definitely agree
    2
  916. It's only asked for senior engineers (L5), for L3 and L4 they don't really ask it.
    2
  917. That would be cool!
    2
  918. Congratulations 🎉
    2
  919. No problem, thanks for watching!
    2
  920. Yeah :)
    2
  921. Good point!
    2
  922. That's fair, but this video isn't really targeted to people who don't know what a hashmap is. https://stackoverflow.com/questions/327311/how-are-pythons-built-in-dictionaries-implemented
    2
  923. Thank you 🙏
    2
  924. I think you prob deserve more credit for that then me 🙂
    2
  925. Technically it's O(1) when you insert or remove, but yes, practically it's O(n) because you have to iterate to the position. But with arrays, it's O(n) regardless This distinction can be important sometimes, like in the LRU cache problem
    2
  926. a rare occurrence indeed
    2
  927. Sorry, I might've missed your email - feel free to send it again.
    2
  928.  @sarathchandrareddy3033  Feel free to email me!
    2
  929. Yeah that's correct!
    2
  930. Hey Meg, thank you so much! I really appreciate it 😊
    2
  931. Thanks!
    2
  932. Thanks!
    2
  933. Happy to help :)
    2
  934. Love you to 🙂❤️
    2
  935. lmao good one
    2
  936. Best of luck, you got this!!!
    2
  937. Thank you so much Daniel!
    2
  938. Glad to be helpful! Best of luck
    2
  939. Congratulations 🎉🙂
    2
  940. Thanks, much appreciated 😊
    2
  941. Thank you so much!
    2
  942. Thank you so much and congratulations! 🎉 You deserve it!
    2
  943. While they did aquire YouTube, they did so early on. Google is the reason YouTube became the juggernaut it is today, especially on the infra side. I don't think that's debatable.
    2
  944. Thank you so much!
    2
  945. In python a set is a HashSet, so in C++ you should use an unordered_set. This will ensure conversion from Array to HashSet is O(N)
    2
  946. Thank you so much Ajay!!
    2
  947. Thanks for letting me know, a few other people have had a similar issue. I suspect it's a network related issue, maybe related to a firewall or proxy. If you get a chance, can you send me an email (neetcodebusiness@gmail) or msg me on discord. Thanks, and sorry about the issues.
    2
  948. Yup! Actually the first time you login it will clear it automatically :~)
    2
  949. ​ @danieledll  The 70% stat comes from the paper OpenAI published on GPT-4. I mostly agree with your points. It fails at basic addition, and any type of logical reasoning. The reason it performs so well on some tasks is because it already knows the answers via it's training data, and is very good at synthesizing responses. Sure, it can solve LC problems that it's already seen before (due to data contamination), but it can't solve original problems. This isn't just my opinion, look at it's Code-Forces rating - it scores in the bottom 10%. There are many threads on twitter discussing this in more depth. I didn't talk about this in the video since i didn't want it to drag out. I would argue the reason it was able to do well on LC easies is because most LC easy problems are nearly identical to each other, where as the Hard problems are more original. I agree it's definitely powerful and there's no doubt it will affect the job market in every industry. But i think not enough people are discussing it's short comings and potential limits. Most people just say "it will keep getting better", but no one knows how much better it can get.
    2
  950. Thank you so much!
    2
  951. lol, i never knew about this but nice!
    2
  952. I don't think there's any reason tbh, in a real interview I would use a hashmap/dict since it's easier, as long as the interviewer is fine with it.
    2
  953. I definitely think it's underrated!
    2
  954. You could, but there's two targets so I think the time complexity would be nlogn
    2
  955. At least 2 more weeks
    2
  956. Glad it helped!
    2
  957.  @wh264  Just fixed it!
    2
  958. Thank you so much, I really appreciate it! 😊
    2
  959. Glad it helped!
    2
  960. For some reason, it's rarely considered in interviews, especially if you use a built in sort function. But I would just mention it to your interviewer to be safe (that it depends on the sort implementation)
    2
  961. Yeah, my voice is a little different, I think its because I recorded this as soon as I woke up. But its still me :)
    2
  962. Glad it helped!
    2
  963. Agreed!
    2
  964. Glad it was helpful!
    2
  965. Is this an inside joke
    2
  966. Congrats on joining MS! Yeah it def rains a lot and gets dark early during winter. But I really like it here, hope you do as well.
    2
  967. Thanks!
    2
  968. Yeah python
    2
  969. Thanks, happy it was helpful 🙂
    2
  970. Thank you so much!
    2
  971. Thanks 😊
    2
  972. It should already be applied
    2
  973. I made a video about it a few months ago "how I coded a SaaS"
    2
  974. Thanks! Yes, I plan on doing N-Queens soon.
    2
  975. Sure!
    2
  976. Thank you so much Yiannis!
    2
  977. Yes that's correct!
    2
  978. 💡 DP PLAYLIST: https://www.youtube.com/watch?v=73r3KWiEvyk&list=PLot-Xpze53lcvx_tjrr_m2lgD2NsRHlNO&index=1
    2
  979. Good luck! You're gonna do great 🙂
    2
  980. I think we can, but the time complexity would be worse since merge sort is O(nlogn)
    2
  981. 💡 LEETCODE SOLUTIONS: https://www.youtube.com/playlist?list=PLot-Xpze53leF0FeHz2X0aG3zd0mr1AW_
    2
  982. Yeah that also works!
    2
  983. I think he was mostly joking around, definitely dont talk like this in a real interview
    2
  984. Thanks, happy it's helpful!
    2
  985. Best of luck!
    2
  986. Thank you 🙏
    2
  987. Thanks!
    2
  988. Yeah it's crazy 😄
    2
  989. Yeah, I think that's also a valid solution
    2
  990. Thank you so much!
    2
  991. Well, not literally, but it does come close: https://cloud.google.com/blog/products/databases/inside-cloud-spanner-and-the-cap-theorem
    2
  992. Good point!
    2
  993. Good catch
    2
  994. Congrats 🥳
    2
  995. Sorry, it was a frontend bug. Should be fixed now.
    2
  996. That's a really interesting perspective i hadn't heard before, makes me wanna learn the history of software.
    2
  997. Combination Sum IV? I can try to do it soon
    2
  998. perhaps
    2
  999. Mostly team projects
    2
  1000. I have actually done that problem
    2
  1001. Had to check if this was the real you for sec lol.. but appreciate it bro 🙂
    2
  1002. Thank you so much!!
    2
  1003. exponential growth... EXPONENTIAL!
    2
  1004. Thank you so much!!!
    2
  1005. That's good, it's definitely not easy
    2
  1006. I think for some languages it would cause an overflow
    2
  1007. Good point, you're right I think if-statement is fine.
    2
  1008. Glad you liked it!
    2
  1009. Glad it's helpful!
    2
  1010. What will it return?
    2
  1011. Thanks! Glad it was helpful!
    2
  1012. Glad it was helpful!
    2
  1013. Not really, as far as I know.
    2
  1014. Thank you so much, I really appreciate it! 😊
    2
  1015. Thanks
    2
  1016. Hey Srikanth - thank you so much, I really appreciate it!! 😊
    2
  1017. I think amazon. Love cherry blossom season 🌸
    2
  1018. I can't tell if he threw in twitter at 8:42 just as a joke
    2
  1019. Thanks, happy to help 🐻
    2
  1020. I will definitely admit that grinding LC doesn't create a lot of value for society, but atm its a necessary evil to get jobs in many cases.
    2
  1021. Glad it was helpful!
    2
  1022. Glad it's helpful!
    2
  1023. I actually made a video about my resume a few months ago. It actually wasn't very impressive.
    2
  1024. You're right, just notice that
    2
  1025. Thanks!
    2
  1026. Good luck, you got this!!!
    2
  1027. Python
    2
  1028. Glad it's helpful!
    2
  1029. It's definitely used a decent amount, but a lot less than Java or c++, mostly cause of legacy systems
    2
  1030. I use a blue yeti
    2
  1031. That one's actually from the GCP docs
    2
  1032. Thank you so much!
    2
  1033. I think it would return the least negative value from the array.
    2
  1034. Thanks, I will!
    2
  1035. Awesome!! Congrats and good luck!
    2
  1036. No problem! I'm on my phone rn but it should be in the description of this video https://youtu.be/SVvr3ZjtjI8
    2
  1037. The second one happens to me all the time 🤣
    2
  1038. Thanks, I appreciate it! I'm using Paint 3D, i think it's free for anyone with windows 10.
    2
  1039. Congratulations and well deserved 🙂
    2
  1040. The second one will give you the index, the first will only give you the actual values.
    2
  1041. Thank you so much!! Glad it was helpful!
    2
  1042. That's great! Glad it was helpful 🙂
    2
  1043. If you already work and are able to get interviews I recommend leetcode / interview prep.
    2
  1044. Happy it was helpful! :)
    2
  1045. Thanks! Best of luck on your journey!
    2
  1046. Damn how did you find it lol
    2
  1047. Congrats and good luck at the company you choose!!
    2
  1048. Sure, I'll try to do it this week
    2
  1049. Thank you so much 🙏
    2
  1050. Good luck!
    2
  1051. Are you sure this solution is not working? https://github.com/neetcode-gh/leetcode/blob/main/python/0018-4sum.py (also available in multiple languages on neetcode.io)
    2
  1052. No problem 👍
    2
  1053. yeah, i think so
    2
  1054. It helps me because if you press 'submit' before thinking about potential edge cases then you will likely fail the submission
    2
  1055. Thanks! Sure, I'll try to make a video about that.
    2
  1056. Python
    2
  1057. 💡 LEETCODE PLAYLIST: https://www.youtube.com/playlist?list=PLot-Xpze53leF0FeHz2X0aG3zd0mr1AW_
    2
  1058. Yup, it's in the description
    2
  1059. Hi, feel free to email me (at the bottom of neetcode.io)
    2
  1060. Good suggestion, I'll check it out!
    2
  1061. 3, that hard one was crazy
    2
  1062. Absolutely, hope to finish blind 75 list within 2 weeks!
    2
  1063. you got me :)
    2
  1064. Thank you so much Joe!!
    2
  1065. Thanks for bringing it to my attention. Please see the pinned comment and let me know if it passes.
    2
  1066. Sorry about that, just fixed it
    2
  1067. I think they're the exact same,
    2
  1068. You're correct. There are details I didn't want to get into in this video. I didn't want to go too in depth about my personal life, and i didnt want to make this a video about bashing amazon or the individuals i worked with at amazon. It wouldn't be good for me, or other people, since i dont wanna scare people from amazon. Many people claim to have good experiences there, which i believe.
    2
  1069. 🙂
    2
  1070. i guess you posted this from your other account by mistake earlier? lol
    2
  1071. Thanks! :)
    2
  1072. Hey Poojan - thank you so much, I really appreciate it!! 😊
    2
  1073. Thanks for the suggestion, done!
    2
  1074. Video coming soon today!
    2
  1075. I think the problem is 'res.push(cur)'. You will need to make a copy of the cur and push the copy. I think in JS you can do that with cur.slice()
    2
  1076. lol thats true
    2
  1077. Hmm, not sure but I just posted my code on github: https://github.com/neetcode-gh/leetcode/blob/main/146-LRU-Cache.py Hope it's helpful. Let me know if you figure out the issue.
    2
  1078. https://neetcode.io/roadmap
    2
  1079. Lol that's a good one, .NET dev soon! For Capital one, yeah they had a short deadline and I thought I could get a better offer. It's a long story, I might make a video about it one day.
    2
  1080. I'm glad it helped!
    2
  1081. Agreed lol
    2
  1082. Sure, will be uploaded soon!
    2
  1083. Did you try submitting it?
    2
  1084. I use Paint3D
    2
  1085. Thanks 😊
    2
  1086. Thanks, happy it was helpful
    2
  1087. Yes, luckily for us, we are only required to return the length.
    2
  1088. Thank you so much Andrey!!!
    2
  1089. Haha looking forward to it 👰‍♂️
    2
  1090. Thank you so much!!
    2
  1091. That's a really good idea! I think it wouldn't work in some cases tho, where different characters can sum to the same value.
    2
  1092. Will do!
    2
  1093. I had fun making it too!
    2
  1094. Not anymore :)
    2
  1095. Hey Frank - thank you so much, I really appreciate it!! 😊
    2
  1096.  @0yustas0  That's a good point, but I wonder if it would satisfy the problem's definition of "random". In this case if we call random() multiple times, will it return the same val?
    2
  1097. Sorry for late reply, but yes I think everything you said is correct. Good catch, you're solution seems better.
    2
  1098. I use Paint3D
    2
  1099. Yeah, I was wondering the same thing. It seems any "math" solution is marked O(1) but it's technically not the case.
    2
  1100. Thank you so much!
    2
  1101. 𝕟𝕚𝕔𝕖
    2
  1102. Congratulations 🎉🎉🎉
    2
  1103. Yeah agree, it's really unintuitive at first.
    2
  1104. Very fair take.
    2
  1105. No problem!
    2
  1106. anything specific that could be improved :)
    2
  1107. agreed!
    2
  1108. Does that make me a weeb 😶
    2
  1109. Definitely!
    2
  1110. Can join here: https://discord.gg/ddjKRXPqtk
    2
  1111. Congratulations, so happy for you!! 😃🎉🎉
    2
  1112. lol, next video, from google to unemployed
    2
  1113. I just ran the python code and it worked for me. Did you copy paste the exact code? You can do so from neetcode.io
    2
  1114. Thank you so much!
    2
  1115. They do but it's not as common as you would think
    2
  1116. Lol
    2
  1117. Blind 75 is a subset of Neetcode 150, so I think starting with either one is fine. Neetcode 150 is more beginner friendly so I recommend that one.
    2
  1118. Glad it helped!
    2
  1119. Not yet
    2
  1120. Good luck!
    2
  1121. Yeah sure, why not
    2
  1122. Yes this is very good since you use O(1) memory. In some ways i prefer this solution to mine in the video.
    2
  1123. Your issue is that 'k' is an input parameter, but your are reassigning it in your for loop.
    2
  1124. Congratulations 🎉🎉 and good luck!!
    2
  1125. Yeah it's called a dictionary in python, but it's implemented with a hashmap, so it's basically equivalent.
    2
  1126. Thanks!
    2
  1127. Feel free to email me, but i may not respond immediately :) neetcodebusiness@gmail
    2
  1128. Happy it's helpful :)
    2
  1129. lol
    2
  1130. No problem 👍
    2
  1131. Lol that's actually true
    1
  1132. Yeah exactly, a very similar problem.
    1
  1133. Yeah exactly, a set is a hash set in python
    1
  1134. Sets in python are actually hashsets, so searching is O(1)
    1
  1135. Glad it helped!
    1
  1136. Good suggestion, I'll make a few more playlists soon!
    1
  1137. It was possible, but Java is much more common at Google, and the original codebase was in Java so it was just easier in this case.
    1
  1138. Thanks!
    1
  1139. Thanks, I just use Paint3D
    1
  1140. Agreed 😅
    1
  1141. Glad it was helpful!
    1
  1142. 😛
    1
  1143. Thank you so much Vikas!!
    1
  1144. Thank you so much Alex!!!
    1
  1145. Lol I would turn your volume up
    1
  1146.  @kumarashutosh229  how do you know many find it difficult? It's plenty loud for me at 50% volume. Might be your headphones.
    1
  1147. I've seen other people having the same issue so you're not alone. I think sometimes they have a lot of traffic and they put people on a waitlist. Also, I think they might only be available in North America at the moment, but I'm not 100% sure.
    1
  1148. Yeah same, many languages also implement them differently
    1
  1149. Thanks!
    1
  1150. AngularJS or Angular 2?
    1
  1151. https://www.youtube.com/@NeetCodeIO
    1
  1152. Thanks for the great videos you've been making! Very few of their kind!!
    1
  1153. Glad it's helpful!
    1
  1154. Hey Shannon - thank you so much, I really appreciate it!! 😊
    1
  1155. Thank you so much!!
    1
  1156. Thank you so much 🙏
    1
  1157. How many times can you visit each cell? It's a constant value I think
    1
  1158. Yeah its O(n)
    1
  1159. Lol
    1
  1160. Paint3d
    1
  1161. I'm looking into this issue, are you using a company computer? I'm guessing it's caused by a firewall issue, I'll try to find a work around.
    1
  1162. Thank you so much!
    1
  1163. Thank you :)
    1
  1164. I somewhat agree, things are even more complicated internally, if you think the products are over complex you should see the internal tools LOL
    1
  1165. Sure, I'll be uploading it pretty soon.
    1
  1166. Thanks!
    1
  1167. good point!
    1
  1168. That's what I thought at first, but after it got better I realized it was prob just the drugs
    1
  1169. Thanks! 🙂
    1
  1170. It's definitely a lot harder than it looks, dont give up!!
    1
  1171. Hey Sushant - thank you so much, I really appreciate it!! 😊
    1
  1172. Thank you so much 🙏
    1
  1173. Link should be in the description
    1
  1174. Sundar?
    1
  1175. Haha yeah i was debating which one to use, im surprised some of the others in the comments feel so strongly about it.
    1
  1176. Yeah i learned that eventually lol, after I recorded most of my videos unforunately lol
    1
  1177. Yeah, ive heard the paypal api is pretty bad lol
    1
  1178. Happy to help!
    1
  1179. Thank you so much Shell!
    1
  1180. Thanks!
    1
  1181. Glad I could be helpful 🙂
    1
  1182. lol
    1
  1183. Yeah link is in the description
    1
  1184. Thanks Pooja 🙂
    1
  1185. Yeah, I've heard of it and from what I see, the only part of t3 that I wouldn't need is Auth which i have handled with Firebase Auth. But def agree t3 is pretty incredible!
    1
  1186. Yeah hashmap works
    1
  1187. Best of luck 🙂
    1
  1188. Thanks, much appreciated
    1
  1189. Thank you so much Andrey!
    1
  1190. Yep, exactly! 👍
    1
  1191. I think Union-Find also works for this problem, but it's less efficient (i think n*logn)
    1
  1192. Yeah, I like that problem, I'm gonna try to do it soon, thank you for the request!
    1
  1193. Will have another one uploaded this weekend 🙏
    1
  1194. That's definitely true, but in some cases you can get 300K+ via LC interviews. Not saying its fair, but its the world we currently live in.
    1
  1195. Not literally, but close enough https://cloud.google.com/blog/products/databases/inside-cloud-spanner-and-the-cap-theorem
    1
  1196. Wait really, where? I didn't know that lol 😆
    1
  1197. We know that the only values are between 1 and 9. So if there are no duplicates, what other possible value could be there? It's basically pidgen hole principle.
    1
  1198. Thanks for the feedback!
    1
  1199. I took a look at the problem, I havent solved it before but I will try to do it eventually, but maybe not soon.
    1
  1200. Happy to help
    1
  1201. Thanks!
    1
  1202. Thank you so much!!! 😊
    1
  1203. No problem, glad it's helpful!
    1
  1204. Glad it helps :)
    1
  1205.  @MaydayMishap  My point is, how do you think people came up with the algorithm for long multiplication? By following a similar process that I showed. Maybe I'm misunderstanding you, but I think you missed the point that I was trying to make in the video.
    1
  1206. ​ @MaydayMishap  Disagree. Long multiplication is essentially an addition problem. Instead of multiplying double digit numbers we use single digit numbers, because that allows us to think of it in terms of addition. 3 * 5 = 5 + 5 + 5. Even 3 * 50 = 50 + 50 + 50. If you watched closely, you would notice every step i made on the right side was exactly the same as the left side, just presented a different way.
    1
  1207. Yeah, it has it's strengths, but I think it's overcomplicated. I'm not the biggest fan of React, but I've heard good things about Svelte and Vue.
    1
  1208. Yeah I studied CS in college (bachelor's)
    1
  1209. Hey, I actually solve the daily LC problems on my second channel: https://www.youtube.com/@NeetCodeIO
    1
  1210. Before adding the 1, we would have to pop 3 and 2 from the stack. Once we pop those, we would compute if either 2 or 3 leads us to the max result.
    1
  1211. typescript - using firebase functions to deploy
    1
  1212. I recommend understanding this SQL question first: https://youtu.be/FSSKteJmWMs
    1
  1213. That's awesome, congrats 🎉🎉🎉
    1
  1214. Thank you so much!!!
    1
  1215. Thanks!
    1
  1216. Haha, I'll have to check them out
    1
  1217. Lol nice
    1
  1218. Hey thank you so much, I appreciate it! =)
    1
  1219. Thanks :)
    1
  1220. Thanks!
    1
  1221. Thank you so much, I really appreciate it! 😊
    1
  1222. I think you will do better than you expect, good luck my friend!
    1
  1223. If it's a hashset we consider it to be O(1)
    1
  1224. No I didnt
    1
  1225. Good point!
    1
  1226. Yeah, this link is in the description and you should be able to download it normally through Google Sheets.
    1
  1227. Thanks :)
    1
  1228. It was a blind test conducted by OpenAI
    1
  1229. I can confirm this 🧑‍🦲
    1
  1230. That's incorrect.
    1
  1231. Congratulations 🎉
    1
  1232. I think the way you did it is probably better, I go in reverse order because it's similar to the drawing explanation.
    1
  1233. It would depend on how we shared it, e.g. could be range based sharding or hash based sharding. Either way we would use the user ID to determine the shard.
    1
  1234. Thanks!
    1
  1235. true
    1
  1236. 🥇
    1
  1237. Are you sure you don't wanna checkout my new NFT collection? 😏 jk
    1
  1238. Thank you so much!
    1
  1239. Nice! Best part of python is not having to worry about overflow
    1
  1240. Sorry which list is banned?
    1
  1241. Awesome, best of luck!
    1
  1242. Glad it's helpful
    1
  1243. I used to call it jikstra, but ppl corrected me alot in the past :)
    1
  1244. No
    1
  1245. Glad it was helpful!
    1
  1246. Operations on a hashset take O(1)
    1
  1247. No problem!
    1
  1248. Yeah, I noticed the one on lintcode is slightly different than the one on leetcode. I'll probably still do it soon
    1
  1249. Big O time complexity doesn't always reflect the real runtime speed.
    1
  1250. That's great to hear! Awesome work, and happy I could help.
    1
  1251. YouTube.com/@neetcodeio
    1
  1252. Glad to help!
    1
  1253. Glad it was helpful!
    1
  1254. Thank you so much!
    1
  1255. Did you check the description?
    1
  1256. No problem!
    1
  1257. Really, the cold starts are bad? Or something else?
    1
  1258. Glad it helped!
    1
  1259. https://neetcode.io/roadmap
    1
  1260. No problem!
    1
  1261.  @finnn_800  Fixed!
    1
  1262. Damn, 1TB is nuts - firebase is upto 10GB. Along with AWS serverless functions being better, Im thinking i shouldve went with them from the start.
    1
  1263. Hopefully by end of October, but I will try to upload it as I complete each lesson
    1
  1264. Keep up the good work 💪
    1
  1265. Thank you so much!!
    1
  1266. Appreciate it! :)
    1
  1267. Thanks!
    1
  1268. Yeah, I think that's right!
    1
  1269. Yeah there's a few other users who reported that. I think it has to do with a networking issue, which prevents you from connecting to the backend. (you can confirm this by checking your browser's devtools 'console' tab). It might be resolved by turning off any proxies, vpns, adblockers if you're using any. Sorry about the issues.
    1
  1270. Happy to help!
    1
  1271. Appreciate it 😊
    1
  1272. No.. yes... maybe
    1
  1273. Good point!
    1
  1274. I agree but most of my audience is python
    1
  1275. If you mean that Google is farther ahead in AI then it seems, than I definitely hope you're right.
    1
  1276. Absolutely, I will be adding JS in 1 or 2 weeks.
    1
  1277. Sorry what?
    1
  1278. We have to sign an NDA so it would be illegal..
    1
  1279. No problem 👍
    1
  1280. Thanks! Happy they are helpful!
    1
  1281. Thank you so much!
    1
  1282. Hmm, I tried it and it's working for me now. Maybe there was an extra indent when you pasted
    1
  1283.  @loraigwe9285  Are you trying to Java code or Python?
    1
  1284. lol maybe i should try it
    1
  1285. You're very welcome!
    1
  1286. Yes, very soon!
    1
  1287. 🙏
    1
  1288. Glad it helped!
    1
  1289. Had to include my boy
    1
  1290. Sure I made a video about that last month
    1
  1291. No problem :)
    1
  1292. Thank you so much Hamza!!!
    1
  1293. Lol what gave it away
    1
  1294. Happy i could help =)
    1
  1295. Why is the first term 1? Shouldn't it be n? BTW n/2 itself is O(n). Also, for quick select in the avg case the formula will be n + n/2 + n/4... n/n. Which is approx 2*n, so O(n). The worst case would be n + (n - 1) +.. 1. Which is O(n^2)
    1
  1296. Hmm, I knew it released a while ago but I didn't think it was stable
    1
  1297. Glad it was helpful!
    1
  1298. Lol I'm surprised someone caught it 🤣
    1
  1299. Happy holidays!
    1
  1300. I use the leetcode ide with the theme changed to 'monokai'
    1
  1301. react js?
    1
  1302. Yeah i built it from scratch, i talk about it in this video: https://www.youtube.com/watch?v=4G5t1HwHQD4
    1
  1303. Yeah you're right, it stands for Dynamic Programming. A better name would be Cache, but its common for people to call it DP because its shorter.
    1
  1304. Yeah, unfortunately i forgot to record and had to use FryingPan's stream vod.
    1
  1305. Thank you so much Medha!!!
    1
  1306. Yeah, I mostly agree
    1
  1307. I need you to start ghostwriting funny videos for me
    1
  1308. That can be arranged.. 👀
    1
  1309. 😉
    1
  1310. thanks, fixed
    1
  1311. Yeah it's allowed
    1
  1312. lol
    1
  1313. Yeah, Java would've definitely made more sense here, but most of my audience is python, so I went with that.
    1
  1314. Not since covid happened
    1
  1315. 'baba' is very close to being a palindrome, but if we reverse it we get 'abab'. since 'baba' != 'abab' we don't count it as a palindrome.
    1
  1316.  @amyotun  Yes, i believe thats correct
    1
  1317. Glad it was helpful!
    1
  1318. Should your else case be nested in the while loop, and if so why do we need the break statement?
    1
  1319. Thank you so much 🙏🙏🙏
    1
  1320. Lol good catch
    1
  1321. Thanks, i appreciate it
    1
  1322. No problem!
    1
  1323. Happy to help!
    1
  1324. This is most likely caused by the firestore bug I mentioned in the video. You can confirm by opening your browser dev tools and opening the console tab. I will migrate away from that soon, but for the time being check if you're using a VPN or proxy.
    1
  1325. Sorry which sql video?
    1
  1326. Anyone who tells you the answer to that is lying, nobody knows what's gonna happen
    1
  1327. Thank you so much!!! I really appreciate it!
    1
  1328. Happy it's helpful 😊
    1
  1329. yeah for some reason it takes a while for their list to get updated, does the link in the description work for you?
    1
  1330. Thank you so much!
    1
  1331. Why is that? I believe it does
    1
  1332. I think that's correct for consumer interest rates, but I believe the fed funds rate was near zero.
    1
  1333. generally yes
    1
  1334. Thank you so much!!!!
    1
  1335. It's commonly referred to as logic OR in digital circuits and gates. After all, true and false are represented as 1 and 0.
    1
  1336. Thank you 🙏
    1
  1337. Thank you so much!
    1
  1338. 🍪
    1
  1339. Well implemented with arrays
    1
  1340. Thanks, happy it was helpful 🙂
    1
  1341. Thank you so much!
    1
  1342. Dont get me wrong, Java might be the most important language in the world today, maybe only behind JS. Plenty of opportunities with Java, i just personally dont think its the best tool for coding interviews
    1
  1343. Thank you so much!
    1
  1344. No most is free
    1
  1345. Thanks!
    1
  1346. Thank you so much!! 🙏
    1
  1347. Thank you so much! I really appreciate it 😊
    1
  1348. Hi can you share a screenshot with me on Twitter or discord.
    1
  1349. not really :p
    1
  1350. Since the entire array is not actually sorted
    1
  1351. I do not, but I think the frameworks I used are somewhat comparable
    1
  1352. Yeah it should be, this link isn't working for you? https://neetcode.io/
    1
  1353. Agreed
    1
  1354. No problem!
    1
  1355. Thank you so much!
    1
  1356. Happy it was helpful!
    1
  1357. I ran the code on that test case and it does return 0.
    1
  1358. I just ran it and it does.
    1
  1359. Yeah I wish
    1
  1360. True 😆
    1
  1361. Agree
    1
  1362. usually when i do that im not just checking if a variable is non null, it could also be an empty list, or the value 0.
    1
  1363. For most people I think money is the reason
    1
  1364. damn now my feelings are hurt :(
    1
  1365. C# should be added by end of december!
    1
  1366. Agreed
    1
  1367. I wish lol
    1
  1368. Thanks!
    1
  1369. Thanks :)
    1
  1370. Thank you so much!
    1
  1371. I think i used the command from this stackoverflow post: https://stackoverflow.com/questions/1358540/how-can-i-count-all-the-lines-of-code-in-a-directory-recursively
    1
  1372. Yup, that's exactly correct!
    1
  1373. No lol
    1
  1374. Definitely, I will try to add it next week!
    1
  1375. Link should be in the description (let me know if its not working)
    1
  1376. Thank you 🙏
    1
  1377. That's not entirely correct, and I can elaborate if you like. But I'm guessing you're just ranting..
    1
  1378.  @srimanikanta_arjun  I dont think it would play a role in getting an offer, python is fine for interviews. On the job you might have to learn Java or Cpp, depending on your role. But maybe python will be fine for your role.
    1
  1379. Appreciate the feedback sir!
    1
  1380. Happy it was helpful!
    1
  1381. Thanks again 😄
    1
  1382. Thanks for letting me know, which site did you try running on?
    1
  1383. ;)
    1
  1384. Welcome!
    1
  1385. appreciate it 🙏
    1
  1386. Lol
    1
  1387. Yes that's true, that's good way to speed it up
    1
  1388. Yeah, I will have most of them added soon
    1
  1389. Sorry about that, do you mind sending me an email at neetcodebusiness@gmail.com?
    1
  1390. Agreed
    1
  1391. Yeah that's exactly correct.
    1
  1392. Thank you so much!
    1
  1393. Probably one day :)
    1
  1394. Nice! 💪
    1
  1395. No I studied CS at an average state school in the U.S.
    1
  1396. sorry about that, fixed!
    1
  1397. Happy to help!
    1
  1398. I did go to college, but yeah I lost a job and was unemployed for an extended period of time.
    1
  1399. Thank you so much!
    1
  1400. Thank you so much!!!
    1
  1401. Thank you 🙏
    1
  1402. Wait really, which one is it?
    1
  1403. Thanks for the tips!
    1
  1404. Probably 1 - 2 months, most of it was rewriting stripe integrations and debugging stripe issues.
    1
  1405. thank you so much!!! 🙏🙏
    1
  1406. Glad it was helpful!
    1
  1407. Hey Claudia, sure, which video are you looking for?
    1
  1408. I wish you were my dad, thanks Primeagen
    1
  1409. I guess this one is more non-linear, also it has video explanations.
    1
  1410. Produce as in code, features or money?
    1
  1411. Yes but make what exactly? I'm still not sure how to answer you question.
    1
  1412. Thank you so much Dave!
    1
  1413. No problem 👍
    1
  1414. good idea, i like it!
    1
  1415. No problem! 👍
    1
  1416. Glad it's helpful!
    1
  1417. Thank you so much!!
    1
  1418. Lol true
    1
  1419. Had to throw that in there 😉
    1
  1420. Possibly, time will tell.
    1
  1421. Unfortunately I signed an NDA
    1
  1422. good point!
    1
  1423. It is used but not as much as you would expect.
    1
  1424. No, just an average U.S state school.
    1
  1425. That's true, but we shouldn't be given that input since it's not sorted.
    1
  1426.  @srigkt  How do you know they test with an unsorted list? The problem states that the input will always be sorted in ascending order.
    1
  1427. 👀
    1
  1428. Thank you so much!!
    1
  1429. Thanks!
    1
  1430. About 1 more week
    1
  1431. Thanks 😊
    1
  1432. Mind sharing what's wrong, running it on lc works for me.
    1
  1433. Glad it was helpful!
    1
  1434. Link is in the description
    1
  1435. Thank you so much again!!!
    1
  1436. Thank you so much 🙏
    1
  1437. Here you go: https://docs.google.com/spreadsheets/d/1A2PaQKcdwO_lwxz9bAnxXnIQayCouZP6d-ENrBz_NXc/edit#gid=0
    1
  1438. Thank you and great job! You got this!
    1
  1439. Thanks!
    1
  1440. Good point
    1
  1441. I hope not, at least I haven't told anyone 😆
    1
  1442. Thank you 🙏
    1
  1443. Good luck!🙂
    1
  1444. Maybe :)
    1
  1445. Link is in the description
    1
  1446. Best of luck!
    1
  1447. Sure I'll try to solve it soon
    1
  1448. Thanks for the suggestion!
    1
  1449. Yeah that's correct
    1
  1450. Thank you so much!
    1
  1451. I suspect it did well due to data contamination
    1
  1452. Hi, feel free to email me at neetcodebusiness@gmail.com for more details
    1
  1453. Glad it was helpful!
    1
  1454. Probably not much... Was it really in that playlist lol
    1
  1455. Yeah just basic stuff. Good luck tho 🤞
    1
  1456. Thank you so much and congratulations 🎉🎉 best of luck whichever you choose 🙂
    1
  1457. Sorry, maybe this one will work: https://discord.gg/A5uHfrjZPk
    1
  1458. Yeah, the cycle can definitely start in the middle
    1
  1459. 👀
    1
  1460. Thanks 😊
    1
  1461. Glad it helped!
    1
  1462. Is there a specific statement I made that you think is wrong?
    1
  1463. Thanks for the kind words!
    1
  1464. Yeah pretty much
    1
  1465. Thank you so much 🙏
    1
  1466. Thank you so much 🙏
    1
  1467. Yes, that's correct
    1
  1468. I think it would work as well if it was just (farthest). If it's farthest then we will jump to farthest, which is a position that has already been jumped to. So I set it to farthest + 1, so that the position we are jumping to is a brand new position
    1
  1469. Most likely you have an infinite loop somewhere, are you updating your pointers?
    1
  1470. The solution for a target of 1 should be 0, since we don't have any coins of value 1. So the result should be 0
    1
  1471. Thanks 😊
    1
  1472. Here it is: https://docs.google.com/spreadsheets/d/1A2PaQKcdwO_lwxz9bAnxXnIQayCouZP6d-ENrBz_NXc/edit?usp=sharing
    1
  1473. Thanks, for sure!
    1
  1474. Fair enough 🙂
    1
  1475. That's not entirely correct
    1
  1476. Glad it was helpful!
    1
  1477. If you count the number of character the difference is large. Counting the number of lines is naive.
    1
  1478. Also wanted to add that neetcode.io has code solution for most languages (usually translations of my python code)
    1
  1479. Thank you so much Rudresh!!!
    1
  1480. Thanks, much appreciated
    1
  1481. Thank you so much!!
    1
  1482. Can you share more details? It's working for me and i haven't heard anyone else having issues.
    1
  1483. Lol, your wish may come true soon
    1
  1484. Yeah, we use something based off mercurial , which is similar
    1
  1485. I use Paint3D
    1
  1486. Some teams use it, but not nearly as frequently as CPP or Java
    1
  1487. Glad it was helpful!
    1
  1488. Sure i think this video is what youre talking about: https://www.youtube.com/watch?v=6jf6SK9qWBc
    1
  1489. Because pain
    1
  1490. Perhaps
    1
  1491. Thanks for letting me know, should be fixed.
    1
  1492. A set is a hash set, so pretty much serves the same purpose for O(1) lookup.
    1
  1493. Sorry about that, I responded to your email, let me know i the issue continues.
    1
  1494. Boredom
    1
  1495. Lol true 😂
    1
  1496. Glad it helped!
    1
  1497. Bad jokes... Mostly 😆
    1
  1498. Thanks!
    1
  1499. Thanks 😊
    1
  1500. Thank you so much!!!
    1
  1501. Sorry about the inconvenience. I think there have been a lot of users signing up lately and they don't want to run out of interviewers. I'm pretty sure you will be able to sign on pretty shortly. If not let me know and I can reach out to them.
    1
  1502. Probably not
    1
  1503. Agree!
    1
  1504. Yeah, I guess it's similar to c^n, except you don't have a constant number of branches.
    1
  1505. No problem! :)
    1
  1506. Thanks, appreciated =)
    1
  1507. Thank you so much 🙏
    1
  1508. Thanks!
    1
  1509. Definitely no age limit!
    1
  1510. True
    1
  1511. surprisingly they didnt ask
    1
  1512. Thank you so much!!!
    1
  1513. You're expected to learn, but the languages are the easy part compared to the frameworks imo
    1
  1514. I made a video about it https://youtu.be/bwgjvzMSlMQ
    1
  1515. That's L4 now sir 😉
    1
  1516. Does LC have a public API to allow for that? I don't think they do but I can try to workaround it.
    1
  1517. Sometime in 2021
    1
  1518. Glad to help! I have some more free additions coming this month 🙂
    1
  1519. Thank you so much!
    1
  1520. Thanks! Means a lot from one of my earliest viewers!
    1
  1521. Noted, thanks
    1
  1522.  @akshaymalhotra2550  feel free to email me at neetcodebusiness@gmail
    1
  1523. Why is that? Aren't we popping from the heap k times?
    1
  1524. We don't have to individually push elements. Heapify is an algorithms that runs in O(n), then we can pop elements.
    1
  1525. You seemed pretty confident so I assumed you already knew one of the basic algorithms of a heap :) https://stackoverflow.com/questions/9755721/how-can-building-a-heap-be-on-time-complexity
    1
  1526. Thank you so much, I really appreciate it! 😊
    1
  1527. 😳
    1
  1528. -2 itself is a subarray, it's also the minimum product in this case.
    1
  1529. If they did, I think they would want their money back after this video...
    1
  1530. Paint3d
    1
  1531. lol thats a good one
    1
  1532. really 👀
    1
  1533. Thanks, i usually dont make these types of videos but I've enjoying them so prob more to come this year!
    1
  1534. Thats a good point, thanks for the feedback!
    1
  1535. Thanks 😊
    1
  1536. Technically yes, tho it doesn't follow the traditional pattern of dfs to memorization to Dp
    1
  1537. Thanks!
    1
  1538. Sure, it's definitely on my to-do list
    1
  1539. Good suggestion, will keep in mind for future videos!
    1
  1540. Very good point, you're right that would speed it up, hopefully thats enough for leetcode to accept the solution 😅
    1
  1541. Happy it was helpful!
    1
  1542. Actually yes! Working on it atm, hopefully will be finished within a month.
    1
  1543. Thanks!
    1
  1544. Thanks!
    1
  1545. How much you offering
    1
  1546. No problem!
    1
  1547. I use Paint3D with a low DPI mouse
    1
  1548. Thank you so much!!!
    1
  1549. Lol
    1
  1550. Thanks! =)
    1
  1551. Thank you so much Steven!!
    1
  1552. Yeah, especially for the current economy, this would be a little on the easy side.
    1
  1553. Thank you! I've got a lot more educational and strategy content planned for the near future!
    1
  1554. Thank you so much!!!
    1
  1555. AFAIK there's no official firebase sdk for Rust
    1
  1556. Thanks!
    1
  1557. Lol I get that a lot
    1
  1558. Yeah agree
    1
  1559. Happy it's helpful! 🙂
    1
  1560. Just a mouse and pc
    1
  1561. Fair enough, but that would result in a much longer, boring video.
    1
  1562. Thanks!
    1