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

Related Articles

  1. Two Tricks of Delphi
  2. Find Pythagorean Triplets
  3. Find Missing Numbers in an Array
  4. Generate All IP Addresses
  5. Algorithm Interview: Make the Largest Number
  6. Daily Interview Problem: First Missing Positive Integer
  7. Daily Interview Puzzle: Minimum Size Subarray Sum
  8. Daily Interview Problem: Word Ordering in a Different Alphabetical Order
  9. Sorting a list with 3 unique numbers
  10. Algorithm Interview: Determine If Linked List is Palindrome

Comments (0)

Your Email (Domain Part Not Exposed):

Your Comments:

Privately By Mail Colors More Smileys S x y @

Verification (Click Image 2 Refresh):

    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="noindex, follow" />