Following the first problem, now you need to find the shortest path. Given two jugs with capacities A and B, find the minimum number of steps to get exactly T units in either jug. You can Fill, Empty or Pour.
  • input: A, B, T
  • output: n (minimum steps) or -1 if impossible
Solve

Solution Stats

137 Solutions

53 Solvers

Last Solution submitted on Apr 18, 2026

Last 200 Solutions

Problem Comments

Solution Comments

Show comments

Problem Recent Solvers53

Nikhilesh Akul Mayank Manav

Suggested Problems

More from this Author20

Problem Tags

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!