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.
how to design a url shortening service like TinyURL
URL shortening is used to create shorter aliases for long URLs. We call these shortened aliases “short links”. Users are redirected to the original URLs when they hit those short links. Short links save a lot of space when displayed, printed, messaged, tweeted. Additionally, users are less likely to mistype shorter URLs.
一个记录刷题、系统设计、机器学习、微服务的二人世界
