To the Top
File:  root - text - article - 2020 - 01 - subarray-with-target-sum.txt
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Category: Computing | 591 Views, 27560 Search Bots | 63 Words

Subscribe to Feed Burner | Browse | Archive
Hi, here's your problem today. This problem was recently asked by Amazon:

You are given an array of integers, and an integer K. Return the subarray which sums to K. You can assume that a solution will always exist.


def find_continuous_k(list, k):
# Fill this in.

print find_continuous_k([1, 3, 2, 5, 7, 2], 14)
# [2, 5, 7]


Can you do this in linear time?
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Cateogry: Computing | 591 Views, 27560 Search Bots | 63 Words Subscribe to Feed Burner

Related Articles

  1. Design Tic-Tac-Toe
  2. PHP Unit Tests on VPS Server
  3. Non-decreasing Array with Single Modification
  4. Daily Interview Problem: Deepest Node in a Binary Tree
  5. Daily Interview Puzzle: Intersection of Linked Lists
  6. Top K Frequent words
  7. First and Last Indices of an Element in a Sorted Array
  8. Autorun.inf Virus Protection
  9. Invert a Binary Tree
  10. Daily Interview Puzzle: Minimum Size Subarray Sum

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