To the Top
File:  root - text - article - 2019 - 10 - two-sum.txt
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Problem, Data Structures and Algorithms, | English | Home Page | Category: Computing | 1237 Views, 16047 Search Bots | 76 Words

Subscribe to Feed Burner | 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.


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.
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Problem, Data Structures and Algorithms, | English | Home Page | Cateogry: Computing | 1237 Views, 16047 Search Bots | 76 Words Subscribe to Feed Burner

Related Articles

  1. Daily Interview Problem: Find the k-th Largest Element in a List
  2. Daily Interview Problem: First Missing Positive Integer
  3. Daily Interview Problem: Full Binary Tree
  4. Daily Interview Problem: Running Median
  5. Algorithm Interview: Level Order Traversal of Binary Tree
  6. Daily Interview Problem: Min Range Needed to Sort
  7. Algorithm Interview: Smallest Number that is not a Sum of a Subset of List
  8. Find Pythagorean Triplets
  9. Find Missing Numbers in an Array
  10. Number of Ways to Climb Stairs

Comments (0)

    Be the first one to comment this page !


Page Edited: May 11 2024 14:36:49 | RSS Subscription
How to Cook a Perfect Steak? | <meta name="robots" content="index, follow">