Two Sum (leetcode solution) // JavaScript Coding Interview

preview_player
Показать описание
Is actually the first problem present on the infamous leetcode website. Originated from FAANG companies and I’ve had colleges interviewed for this by upcoming startups, so in this lesson we will look at the problem, the naive and the efficient solution 🌹

Course Page:

🏷 #basarat #Coding #Interview #JavaScript #5MinutesOrLess #TypeScript #Tutorial

👇 ❤️ Subscribe for MOORE ❤️ 👇

**Feel Free To Read This Lot**

I'm Basarat, and I love helping developers. More about me:

Microsoft MVP for TypeScript
200K contributions on Stackoverflow. Top Contributor for TypeScript.
Book Author: Beginning NodeJS
Book Author: TypeScript Deep Dive
Creator of multiple hot ✨ed Github Open Source projects

Рекомендации по теме
Комментарии
Автор

This is great and very well explained, nice video format. Very professional. Subscribed!

Jojjo
Автор

Great video and explanation, hope you gonna continue this series

denchke
Автор

🔥 your way of explaining stuff is topnotch

_magical
Автор

2:50 How do you know the get() function in the Map class isn't using any loops? How do you know it's actually linear time?

Phlxable
Автор

Hi Basarat,

Thank you very much for these great videos, very well explained. I have a question regarding the check. I've noticed that you are using `if (complementIndex != null)`. If you use strict equality, TypeScript starts complaining about undefined not being assignable to a number and this fails. Is there any particular reason why you've decided not use use strict equality, is this even something a recruiter would bring up?

Thank you again for the great content you put out there

Freeman
Автор

Thanks for this and your explanations are clear. I love your TypeScript Deep Dive too. I have a question, do you have any great resources in learning algorithms?

Nevertheless
Автор

Always throw a hashMap at the problem🤣🤣🤣🤣🤣🤣

panic_seller
join shbcf.ru