Minimum Time to Remove All Cars Containing Illegal Goods

Given a binary string, find the minimum cost to remove all '1' characters where popping a car from either end costs 1 and deleting any interior car costs 2; the core challenge is a linear DP/greedy tradeoff that balances removing cars from the ends versus paying 2 for internal deletions.