1. Two Sum - Leetcode (Python)

preview_player
Показать описание
Two Sum Leetcode: Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target. You may assume that each input would have exactly one solution, and you may not use the same element twice. You can return the answer in any order. This is the two sum problem on Leetcode ( easy level ). Two sum. Leetcode easy problem. Python. Good for coding interview practices.

Example 1:

Input: nums = [2,7,11,15], target = 9
Output: [0,1]
Explanation: Because nums[0] + nums[1] == 9, we return [0, 1].
Example 2:

Input: nums = [3,2,4], target = 6
Output: [1,2]
Example 3:

Input: nums = [3,3], target = 6
Output: [0,1]

Only one valid answer exists.
Рекомендации по теме
Комментарии
Автор

Seriously the best video on this problem I’ve seen

Chasegreen
Автор

i saw like 10 explanation videos for this yours is the one that made my dumb brain understand
thank you so much ❤

jeffrinm
Автор

i've ever seen video about two sum, but your video have greet explanation thanks sir

olo
Автор

Hey man, keep up with the good work 👍

drunkenmonkey
Автор

thank you the explanation is very simple, any tips books to read to improve my logic and understanding of python i am a beginner currently busy with zero to hero course on udemy.

yusufsalie
Автор

whoa. i actually understood this through this video..

misoz
Автор

hi buddy.i like the explantion .its so simple and make sense

EVSprakash
Автор

This is the weakest didactic I want to see on YouTube. 
Pun aside, great job making it easy to understand. Thanks a lot.

FelipeCampelo