Google Interview Question: Two Sum (Java Solution & HashSet Tutorial)
Google Interview Question: Two Sum (Java Solution & HashSet Tutorial)
Not employed by dailycodingproblem.com, just a fan.
You can (and should) sign up to receive an email with a coding problem everyday here: https://www.dailycodingproblem.com
You can subscribe to my channel here: / @dailycodingproblem8346
Daily Coding Problem: Problem #1 [Easy]
Good morning! Here's your coding interview problem for today.
This problem was recently asked by Google.
Given a list of numbers and a number k, return whether any two numbers from the list add up to k.
For example, given [10, 15, 3, 7] and k of 17, return true since 10 + 7 is 17.
Bonus: Can you do this in one pass?
Solution is optimized (one pass, O(N)) and involves the use of a HashSet (brief Java HashSet/HashMap tutorial)
On this page of the site you can watch the video online Google Interview Question: Two Sum (Java Solution & HashSet Tutorial) with a duration of hours minute second in good quality, which was uploaded by the user Daily Coding Problem 10 June 2020, share the link with friends and acquaintances, this video has already been watched 338 times on youtube and it was liked by 6 viewers. Enjoy your viewing!
