Category
dynamic-programming
Minimum Total Distance Traveled
This is a challenging task that involves optimizing the cost of assigning robot repairs to a limited set of factories with capacity constraints. In this post, I’ll outline my approach to solving this problem using dynamic programming in Rust 
Minimum Time to Remove All Cars Containing Illegal Goods
In this problem, cars are arranged in a sequence, with some containing legal goods and others containing illegal goods. The goal is to find the minimum time required to remove all cars containing illegal goods 
Number of Ways to Rearrange Sticks With K Sticks Visible
The task is to find the number of ways to arrange a set of uniquely-sized sticks so that exactly k sticks are visible from the left 
Profitable Schemes
The problem involves finding the count of profitable schemes within a group of members committing crimes. The goal is to determine the number of combinations of crimes that yield a maximum profit. 
Burst Balloons
The task involves bursting balloons marked with numbers represented by an array. Each burst earns coins based on the product of adjacent balloon numbers. The goal is to maximize number of coins obtainable by bursting the balloons strategically.