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)
En esta página del sitio puede ver el video en línea Google Interview Question: Two Sum (Java Solution & HashSet Tutorial) de Duración hora minuto segunda en buena calidad , que subió el usuario Daily Coding Problem 10 junio 2020, comparta el enlace con amigos y conocidos, en youtube este video ya ha sido visto 338 veces y le gustó 6 a los espectadores. Disfruta viendo!
