To the Top
File:  root - text - article - 2020 - 01 - smallest-number-that-is-not-a-sum-of-a-subset-of-list.txt
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Category: Computing | 483 Views, 55498 Search Bots | 66 Words

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

Given a sorted list of positive numbers, find the smallest positive number that cannot be a sum of any subset in the list.

Example:
Input: [1, 2, 3, 8, 9, 10]
Output: 7
Numbers 1 to 6 can all be summed by a subset of the list of numbers, but 7 cannot.


def findSmallest(nums):
# Fill this in.

print findSmallest([1, 2, 3, 8, 9, 10])
# 7
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Cateogry: Computing | 483 Views, 55498 Search Bots | 66 Words Subscribe to Feed Burner

Related Articles

  1. CVE-2015-8874 - cPanel EasyApache Vulnerabilities
  2. Daily Interview Problem: Room scheduling
  3. Algorithm Interview: Make the Largest Number
  4. Linode Support Ticket 10029540 - Other - Important Notice Regarding Ubuntu 17.10 Image
  5. Daily Interview Problem: Count Number of Unival Subtrees
  6. Spreadsheet Columns
  7. Algorithm Interview: No Adjacent Repeating Characters
  8. Daily Interview Problem: Reverse Integer
  9. Invert a Binary Tree
  10. Algorithm Interview: String Compression

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