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

This problem involves eliminating any path that exists as a sub-folder within another path. In this post, I'll walk through my approach to solve this problem using a Trie

This is a problem where each letter in a given puzzle represents a unique digit. The goal is to assign digits to the letters such that when the words are summed, they produce a correct numerical result, similar to a standard arithmetic equation. Additionally, no word can have leading zeros, and each letter must represent a different digit.

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