Can You Solve This Amazon Interview Question?

@that_swe_intern

7.0K followers · usually 4.5K views a post

Views

26.2K

Likes

1.2K

Comments

32

Shares

56

SoundTikTok sound · original sound - that_swe_intern

Promoted product

LeetCodeleetcode.com ↗

Why it worked

The video addresses a highly relevant and common technical interview problem, "Two Sum," which is a staple for many tech companies, including Amazon. By providing a clear explanation, a working code solution, and demonstrating its acceptance on a platform like LeetCode, it offers direct value to aspiring software engineers. The use of on-screen text and a clear narrative makes it easy to follow, and the call to action encourages further engagement.

Summary

The video explains and solves the "Two Sum" problem, a common interview question. It demonstrates the problem with three examples and then provides a Python code solution using a hash map to efficiently find the two numbers that add up to the target.

Structure

1Introduce the "Two Sum" problem and its requirements.
2Explain the problem with three examples.
3Present a Python solution using a hash map.
4Demonstrate the code's logic and execution.
5Show the accepted solution on LeetCode.
6

Original caption

Would you pass Amazon's interview? Follow for more practical computer science! #leetcode #techinterview #compscimajor #amazon #breakintotech

More from @that_swe_intern

Product placement

The video features the LeetCode platform and its interface, specifically showing the problem description, code editor, and submission results for the "Two Sum" problem. The Amazon logo is also visible on screen.

Call to action

Follow for your daily Leetcode!

On-screen text

1. Two Sum Easy Companies Can You Solve This Amazon Interview Question? Input: Output: Explanation: Input: Output: Input: Output: Constraints: 2 <= nums.length <= 10^4 -10^9 <= nums[i] <= 10^9 -10^9 <= target <= 10^9 Python Auto class Solution(object): def twoSum(self, nums, target): :type nums: List[int] :rtype: List[int] # Iterate one by one, checking # values we've seen already # {number, idx} seen = {} for i, curr_num in enumerate(nums): need = target - curr_num if need in seen: return [seen[need], i] else: seen[curr_num] = i Problem List Description Editorial Solutions (25.2K) Submissions Accepted Runtime 34 ms Beats 90.23% of users with Python More challenges 18. 4Sum 167. Two Sum II - Input Array Is Sorted 170. Two Sum III - Data structure design Status Accepted a few seconds ago Language Python Runtime 34 ms Memory 13.95 MB Beats 93.58% of users with Python Memory 13.9 MB Notes Accepted Follow for your daily Leetcode!

Transcript

Can You Solve This Amazon Interview Question? Alright so today we're gonna solve two sum. 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. 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] Constraints: 2 <= nums.length <= 10^4 -10^9 <= nums[i] <= 10^9 -10^9 <= target <= 10^9 Alright so for a first example we have the numbers 2, 7, 11 and 15 and our target is 9. So we know that 2 and 7 add up to 9. So we'll return 0 and 1. Example 2: we have 3, 2 and 4, our target is 6. So we would output 1 and 2. Example 3: we have 3 and 3 and our target is 6. So you're gonna return indices 0 and 1. Alright let's see how we're gonna solve it. We're gonna iterate through our array and hold on to the index as well. So first we're gonna create a hash map. seen = {} and this hash map needs to store our number and our index. {number, idx} seen = {} for i, curr_num in enumerate(nums): then we know that the number we're looking for is our target minus our current number. need = target - curr_num. Then if the number that we need is something we've already seen, we can just return those indices. if need in seen: return [seen[need], i] Otherwise we'll have to add our current number to the values we've already seen. seen[curr_num] = i Alright let's see if this works. Alright so there's our solution. Let me know if you passed this interview and comment down below if you have any questions. Follow for your daily Leetcode!