Two Sum - Leetcode 1 - Java

Показать описание

Two Sum - Leetcode 1 - Java

--------------------------------ABOUT--------------------------------
🧑🏻 My name is David and I am a software engineer at Meta. My passion is teaching software devs how to pass the grueling technical interviews to help them land their 6-figure dream tech job.

I have received 3 six-figure offers from Google, Meta, and Amazon.

🔬I provide content that will allow you to understand the thought process, pseudocode, time complexity, and code when approaching coding problems.

--------------------------------SOCIAL--------------------------------

💬 If you have any topic or questions you want me to cover, let me know in the comment section below ~ ฅʕ•ᴥ•`ʔ ฅʕ•ᴥ•`ʔ ฅʕ•ᴥ•`ʔ

#technicalinterview #techcareer #softwareengineer

Рекомендации по теме

Комментарии

Simple, short and right to the point explanation

vinaybhamre

its been 3 years studying programming and i m not able to solve single leetcode problems

officialdreamplayz

Great. Please increase the font size for future videos.

chrispure

One suggestion buddy, please try to make HD videos because, when we watch on laptop it feels little off. Good content. Thanks for making great vidoes.

amvasoft

Everything made sense to me except that return statement it was a bit hefty, could you explain it a bit more?

danielbekele

I see that the solution is smart, how do you come up with a solution like that by yourself?

devfend

great all approach in one video..thank u

tishaagarwal

Hi, I didn't understand why did you put the elements in the map after the if{} check. shouldn't it be done before?

TanujaLawaniya

Your explanation is clear and good practice 🙂

santhoshkt

Am I the only one who didn't get it despite the long text?

buzzyso

Plz plz make text bigger so it's easier to see

elizabeth

Please give easier solution as well, as the method will never come to mind at the time of interview

icaspersingh

Isn’t the map.containskey() method making this a O(n^2) problem? It really is a weird way of saying yeah the hashmap is so good it’s going to be done in O(1), could someone explain this to me?

jackmassey

Love You Bro for giving valuable content

nilshr

Your amazing dude. Share me your linkedin profile

santhoshkt

Two Sum - Leetcode 1 - Java

Two Sum - Leetcode 1 - HashMap - Python

This is the Most Asked FAANG Interview Question! - Two Sum - Leetcode 1

Two Sum - Leetcode 1 - Hashmaps & Sets (Python)

Two Sum - Leetcode 1

LeetCode #1: Two Sum | Coding Interview Solution

Two Sum | LeetCode 1 | JavaScript | Easy

Two Sum - Leetcode 1 - Python #shorts

LeetCode Exercise in Java Tutorial - Two Sum FAST Solution

LeetCode 1: Two Sum | Brute Force, Two-Pointer, Hash Map Approaches | C++, Java, Python

Two Sum | Решение на Python | LeetCode 1

Python Programming Practice: LeetCode #1 -- Two Sum

Two Sum (LeetCode #1) | 3 Solutions with animations | Study Algorithms

LeetCode Two Sum Solution Explained - Java

1. Two Sum - Leetcode (Python)

Watch this if you want to work at FAANG | Two Sum - Leetcode 1

Leetcode 1 Two sum - Java, объяснение решения (хэширование и массивы) #java #leetcode...

LeetCode #1 - TwoSum

Two Sum II - Two Pointers Algorithm - Leetcode 167

Two Sum - Leetcode 1 - Java

Two Sum problem | Leetcode problem 1

LeetCode 1 Two Sum Solution Explained (Python)

How To Solve Algorithms - Two Sum

leetcode (1. Two Sum) in c++ #programming #cplusplus #leetcode #tutorial

2 Sum Problem | 2 types of the same problem for Interviews | Brute-Better-Optimal