FastPrepLargest Binary-String Subset Within Bit Budgets
Problem · Array

Largest Binary-String Subset Within Bit Budgets

● MediumAmazon logoAmazonFULLTIMEPHONE SCREEN
See Amazon hiring insights

Problem statement

Given an array of binary strings strs and two budgets, maxOnes and maxZeroes, return the maximum number of strings you can select.

The problem statement continues
Pro

Examples

Example 1

strs = ["100","10","1","11","111"]maxOnes = 3maxZeroes = 0return = 2

Select "1" and "11". They use exactly three ones and no zeroes.

FastPrep Pro
Reported in 1 Amazon interview this week

Unlock this recently reported problem

FastPrep Pro gives you full access to interview problems reported within the last week.

  • Full problem statement and constraints
  • 2 more worked examples, explained
  • Guided hints and editorial
  • Run your code on real test cases
$8.25/month

$99 billed yearly — or $19 month-to-month. Cancel anytime.

Free plan — 2 of 2 free unlocks used this week
CodePython 3
Run and Submit unlock with Pro
FastPrep Pro
Reported in 1 Amazon interview this week

Unlock this recently reported problem

FastPrep Pro gives you full access to interview problems reported within the last week.

  • Full problem statement and constraints
  • 2 more worked examples, explained
  • Guided hints and editorial
  • Run your code on real test cases
$8.25/month

$99 billed yearly — or $19 month-to-month. Cancel anytime.

Free plan — 2 of 2 free unlocks used this week