Dynamic Programming Algorithm to Count the Exact Sum of Subsets
Given a list of positive integers nums and an integer k, return the number of subsets in the list that sum up to k. Mod the result by 10 …
Tag: c++
Dynamic Programming Algorithm to Solve the Poly Knapsack (Ubounded) Problem
February 11, 2021
algorithms, c / c++, Dynamic Programming, dynamic programming, Knapsack Problems, math, python
No Comments
You are given two lists of integers weights and values which have the same length and an integer capacity. weights and values represent the weight and value of the …
Breadth First Search Algorithm to Compute the Sum of the Deepest Nodes
Given a binary tree root, find the sum of the deepest node values. Constraints n ≤ 100,000 where n is the number of nodes in root Hint: You need …
K Distinct Window Algorithm by Sliding Window
Given a list of integers nums and an integer k, return a list of count of distinct numbers in each window of size k. Constraints 1 ≤ k ≤ …
Count the Repeated K-Length Substrings
Given a string s and an integer k, return the number of k-length substrings that occur more than once in s. Constraints n ≤ 100,000 where n is the …