LeetCode Weekly Contest 116
Solutions in weekly contest 116
🔗 LC962
Documentary Review: 2015 NBA Champions: Golden State Warriors
Leetcode
Knapsack Problem Summary
Starting from the base knapsack problem, solve a set of related ones to it.
Given a set of items, each with a weight and a value, determine the number of each item to include in a collection so that the total weight is less than or equal to a given limit and return the largest possible value which can be collected.
In a N x N grid composed of 1 x 1 squares, each 1 x 1 square consists of a /, \, or blank space. These characters divide the square into contiguous regions.
