Watch 9 video solutions for Minimum Time to Remove All Cars Containing Illegal Goods, a hard level problem involving String, Dynamic Programming. This walkthrough by Vivek Gupta has 3,539 views views. Want to try solving it yourself? Practice on FleetCode or read the detailed text solution.
You are given a 0-indexed binary string s which represents a sequence of train cars. s[i] = '0' denotes that the ith car does not contain illegal goods and s[i] = '1' denotes that the ith car does contain illegal goods.
As the train conductor, you would like to get rid of all the cars containing illegal goods. You can do any of the following three operations any number of times:
s[0]) which takes 1 unit of time.s[s.length - 1]) which takes 1 unit of time.Return the minimum time to remove all the cars containing illegal goods.
Note that an empty sequence of cars is considered to have no cars containing illegal goods.
Example 1:
Input: s = "1100101" Output: 5 Explanation: One way to remove all the cars containing illegal goods from the sequence is to - remove a car from the left end 2 times. Time taken is 2 * 1 = 2. - remove a car from the right end. Time taken is 1. - remove the car containing illegal goods found in the middle. Time taken is 2. This obtains a total time of 2 + 1 + 2 = 5. An alternative way is to - remove a car from the left end 2 times. Time taken is 2 * 1 = 2. - remove a car from the right end 3 times. Time taken is 3 * 1 = 3. This also obtains a total time of 2 + 3 = 5. 5 is the minimum time taken to remove all the cars containing illegal goods. There are no other ways to remove them with less time.
Example 2:
Input: s = "0010" Output: 2 Explanation: One way to remove all the cars containing illegal goods from the sequence is to - remove a car from the left end 3 times. Time taken is 3 * 1 = 3. This obtains a total time of 3. Another way to remove all the cars containing illegal goods from the sequence is to - remove the car containing illegal goods found in the middle. Time taken is 2. This obtains a total time of 2. Another way to remove all the cars containing illegal goods from the sequence is to - remove a car from the right end 2 times. Time taken is 2 * 1 = 2. This obtains a total time of 2. 2 is the minimum time taken to remove all the cars containing illegal goods. There are no other ways to remove them with less time.
Constraints:
1 <= s.length <= 2 * 105s[i] is either '0' or '1'.Problem Overview: You receive a binary string where '1' represents a car carrying illegal goods. Removing a car from the left or right end costs 1, while removing a specific illegal car in the middle costs 2. The goal is to remove all '1' cars with the minimum total time.
Approach 1: Prefix and Suffix Counting (O(n) time, O(n) space)
This method treats the problem as a dynamic programming scan across the string. Build a prefix array where left[i] stores the minimum cost to remove all illegal cars from index 0..i. For each position, either remove the current illegal car individually (left[i-1] + 2) or remove the entire prefix from the left side (i + 1). A similar suffix array computes the cost of removing illegal cars from i..n-1. Once both arrays are built, iterate over every split point and combine left[i] + right[i+1]. This captures strategies where part of the string is removed from the left and the remainder from the right. The approach is intuitive and easy to reason about during interviews because it explicitly models costs from both directions.
Approach 2: Greedy Counting with Two Pointer Technique (O(n) time, O(1) space)
The optimal solution compresses the DP idea into a single pass using a greedy running cost. Traverse the string from left to right while maintaining the minimum cost to clear all illegal cars up to the current index. When you encounter a '1', you have two choices: remove it individually (currentCost + 2) or remove the entire prefix from the left (i + 1). Track the minimum of these options. At each step, combine the prefix cost with the cost of removing the remaining suffix by popping cars from the right (n - i - 1). This effectively simulates a two-pointer strategy where the left scan determines prefix removal cost and the right boundary represents future removals. The result is the minimum total time seen during the scan.
Recommended for interviews: The greedy single-pass approach is what most interviewers expect. It reduces the prefix–suffix DP idea to O(1) space while keeping the same O(n) runtime. Showing the prefix/suffix DP first demonstrates clear reasoning about the cost structure, then optimizing it to the greedy scan shows strong algorithmic intuition.
| Approach | Time | Space | When to Use |
|---|---|---|---|
| Prefix and Suffix Counting | O(n) | O(n) | Best for understanding the cost structure and explaining the dynamic programming reasoning clearly. |
| Greedy Counting with Two Pointer Technique | O(n) | O(1) | Preferred in interviews and production since it compresses the DP idea into a single linear pass with constant space. |