To the Top
File:  root - text - article - 2019 - 11 - minimum-size-subarray-sum.txt
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, | English | Home Page | Category: Computing | 246 Views, 15867 Search Bots | 81 Words

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

Given an array of n positive integers and a positive integer s, find the minimal length of a contiguous subarray of which the sum ≥ s. If there isn't one, return 0 instead.

Example:
Input: s = 7, nums = [2,3,1,2,4,3]
Output: 2
Explanation: the subarray [4,3] has the minimal length under the problem constraint.

Here is the method signature:


class Solution:
def minSubArrayLen(self, nums, s):
# Fill this in

print Solution().minSubArrayLen([2, 3, 1, 2, 4, 3], 7)
# 2
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, | English | Home Page | Cateogry: Computing | 246 Views, 15867 Search Bots | 81 Words Subscribe to Feed Burner

Related Articles

  1. Daily Interview Problem: Min Range Needed to Sort
  2. Staying on a Chess Board
  3. [Daily Problem] Validate Balanced Parentheses
  4. Two-Sum
  5. Daily Interview Question: Create a Simple Calculator
  6. Daily Interview Question: Find Cycles in a Graph
  7. Spreadsheet Columns
  8. [Daily Problem] Remove k-th Last Element From Linked List
  9. [Daily Problem] Longest Palindromic Substring
  10. Algorithm Interview: Permutations of numbers

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" />