页面顶部 Top
文件:  root - text - article - 2020 - 01 - subarray-with-target-sum.txt
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 300 次阅读, 23163 次搜索 | 63 个单词

定阅此目录的博客 | 浏览 | 博客存档
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?
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 300 次阅读, 23163 次搜索 | 63 个单词 定阅此目录的博客

猜您喜欢...

  1. Skip the readings, focus on problems. And use all the hints!
  2. Daily Interview Problem:Create a balanced binary search tree
  3. Daily Interview Problem: Find the Number of Islands
  4. Algorithm Interview Question: Nth Fibonacci Number
  5. Daily Interview Problem: Circle of Chained Words
  6. Algorithm Interview: Subarray With Target Sum
  7. Algorithm Interview: String Compression
  8. Non-decreasing Array with Single Modification
  9. Algorithm Interview: Shifted String
  10. Daily Interview Problem: Count Number of Unival Subtrees

评论 (0)

读写完全 - 一般 - 最小 - 表格 - 所有评论 - 统计

    当前页暂时没有评论。


最后更新: October 30 2020 14:21:12 | RSS Subscription
牛排怎么做才好吃? | <meta name="机器人" content="索引, 跟踪">