LeetCode #1: Two Sum | Coding Interview Solution

A step-by-step solution to #LeetCode Question 1: Two Sum

0:00 Intro
0:32 Brute force: O(n²)
1:39 Optimized: O(n)
2:19 Code walkthrough
5:35 O(n²) explanation

#coding #programming #algorithms

[lazarus]

Extremely clear and well presented video. Here's a comment for the Youtube algorithm.

[mhdez]

Thank you for sharing your knowledge and expertise with the world!

[AndersonGomes-nfvh]

You save me man, thank you. Now a can learn python and english with that subtitles.

[erin]

Omg I needed this. YOU'RE AWESOME

[deyanlafchiev]

Keep up bro! Your vids are extremly useful !

[polettiayala]

incredible hard to be the first question!!!! I will try to study this a lot more, i will do a brute force in my mind in order to get what you did here!

[adammarley]

You did an incredible job. Great explanation and pace!

[Imagine_Baggins]

Great explanation. I'm trying to imagine what that syntax would look like in Java.

[ego_mejia]

Thank you for sharing your knowledge. You helped me a lot!

[Nonsync]

Thanks bro for sharing your knowledge and for explaining clearly

[lethnisoff]

Great explanation and visualization, thank you

[le-daniel]

Brute. This guy knows his Brute Forces

[БабекАскеров-пй]

Ты великолепен! Куда отправить деньги чтобы поддержать твое творчество?🤗

[bonjovi]

ajig aing can ngarti, masih smp, rek ka smk jurusan rpl, bakal diajar anu kieu moal nya, siap siap heula we ah

[Rekanized]

But you are going to be copying memory here right? every single time you need to add a new value to the array, the array will be recreated in memory? Incase of the array being a lot larger than 3-6 int's the array will be changed multiple times which causes other issues right? is this really the greatest solution?

[rohithgorthy]

Hello, I have one question regards to linear time solution which is mentioned here, I understand when we are traversing through the list only once.. While we are checking if the element i.e Target- list elem in dictionary we are doing o(1) n times which again corresponds to O(N) so O(n) * O(n).. sorry i m wrong, request you to please correct me.

[anonimowelwiatko]

I see, so this is what I overlooked...

[chris_ez]

My brain just died i have no knowledge of math since i didn't listen when i was in highschool, any tips to begin?

[rydmerlin]

Try to always keep the original LC # in your title.

[happy_life]

which video editing software are you using to make this video?