To the Top
File:  root - text - article - 2019 - 10 - two-sum.txt
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Problem, Data Structures and Algorithms, | English | Home Page | Category: Computing | 1155 Views, 14249 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 | 1155 Views, 14249 Search Bots | 76 Words Subscribe to Feed Burner

Related Articles

  1. Daily Interview Problem:Create a balanced binary search tree
  2. Plus One
  3. Daily Interview Problem: Tree Serialization
  4. Consecutive Ones
  5. First and Last Indices of an Element in a Sorted Array
  6. Daily Interview Problem: Contiguous Subarray with Maximum Sum
  7. Daily Interview Problem: Decode String
  8. Daily Interview Problem: Trapping Rainwater
  9. Algorithm Interview: No Adjacent Repeating Characters
  10. Daily Interview Problem: Largest BST in a Binary Tree

Comments (0)

    Be the first one to comment this page !


Page Edited: October 30 2020 14:21:09 | RSS Subscription
How to Cook a Perfect Steak? | <meta name="robots" content="index, follow">