File: root - text - article - 2019 - 10 - two-sum.txt
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Problem, Data Structures and Algorithms, | English | Home Page | Category: Computing | 1485 Views, 19133 Search Bots | 76 Words
| Browse | Archive
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Problem, Data Structures and Algorithms, | English | Home Page | Category: Computing | 1485 Views, 19133 Search Bots | 76 Words
| Browse | Archive
Hi, here's your problem today. This problem was recently asked by Facebook:
You are given a list of numbers, and a target number k. Return whether or not there are two numbers in the list that add up to k.
Example:
Given [4, 7, 1 , -3, 2] and k = 5,
return true since 4 + 1 = 5.
Try to do it in a single pass of the list.
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Problem, Data Structures and Algorithms, | English | Home Page | Cateogry: Computing | 1485 Views, 19133 Search Bots | 76 Words You are given a list of numbers, and a target number k. Return whether or not there are two numbers in the list that add up to k.
Example:
Given [4, 7, 1 , -3, 2] and k = 5,
return true since 4 + 1 = 5.
def two_sum(list, k):
# Fill this in.
print two_sum([4,7,1,-3,2], 5)
# True
Try to do it in a single pass of the list.
Related Articles
- Design Tic-Tac-Toe
- Daily Interview Problem: Largest Product of 3 Elements I
- Delphi Dynamic Array
- A trick for getting good at coding interviews FASTER
- Daily Interview Puzzle: Minimum Size Subarray Sum
- Kaprekar
- Progess made
- Daily Interview Problem: Tree Serialization
- Algorithm Interview: Lowest Common Ancestor of 2 Nodes in Binary Tree
- Number of Ways to Climb Stairs
©2006~2024 SteakOverCooked - 0.00752 Seconds(s) - 2484.343 KB/s - 42 Online Memory: 491.74 KB
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - Server PHP Version: 7.4.33
How to Cook a Perfect Steak? | <meta name="robots" content="index, follow">
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - Server PHP Version: 7.4.33
Comments (0)
Read & Write - Normal - Mini - Post - All Comments - Statistics
Be the first one to comment this page !