knapsack | brain

Practice › LeetCode › LeetCode (archived) › LeetCode 09xx ›

LeetCode 956: Tallest Billboard

Problem Restatement We are given an array rods . Each rod has a positive length. We want to build two steel supports of equal height. Each rod can be used in one of three ways: Put it on the left support. Put it on the right support. Do not use it. Return the largest possible equal height of the two supports. If no positive equal-height supports can be built, return...

Practice › LeetCode › LeetCode (archived) › LeetCode 08xx ›

LeetCode 879: Profitable Schemes

Problem Restatement We are given n gang members and several crimes. Each crime i has: Array Meaning group[i] Number of members needed for crime i profit[i] Profit gained from crime i Each member can participate in at most one crime. A scheme is profitable if: It uses at most n members. It earns at least minProfit profit. Return the number of profitable schemes modulo 10^9 + 7 . The official...

Practice › LeetCode › LeetCode (archived) › LeetCode 04xx ›

LeetCode 474: Ones and Zeroes

Problem Restatement We are given an array of binary strings: strs We are also given two integers: m n We can choose some strings from strs . The chosen strings must use at most: m zeros n ones Each string can be chosen at most once. We need to return the largest possible number of strings we can choose. The official problem asks for the size of the largest subset...

Practice › LeetCode › LeetCode (archived) › LeetCode 04xx ›

LeetCode 494: Target Sum

Problem Restatement We are given an integer array nums and an integer target . For every number in nums , we must choose one sign: Sign Meaning + Add this number - Subtract this number We need to count how many different sign assignments evaluate to target . For example: nums = [1, 1, 1, 1, 1] target = 3 There are five valid expressions: -1 + 1 + 1...

Practice › LeetCode › LeetCode (archived) › LeetCode 04xx ›

LeetCode 416: Partition Equal Subset Sum

Problem Restatement We are given an integer array nums . Return True if we can split the array into two subsets such that both subsets have the same sum. Otherwise, return False . Each number can be used at most once, because every element belongs to exactly one of the two subsets. The source problem gives examples such as nums = [1,5,11,5] , which returns true , and nums =...

#knapsack

LeetCode 956: Tallest Billboard

LeetCode 879: Profitable Schemes

LeetCode 474: Ones and Zeroes

LeetCode 494: Target Sum

LeetCode 416: Partition Equal Subset Sum