logo CodeStepByStep logo


Language/Type: Java Karel
Related Links:

Write a Karel program named Roomba that sweeps the entire board of all beepers. Assume that Karel starts at (1,1) facing East, that the world is rectangular, that some squares contain one or more beepers, and that there are no interior walls. When the program is done, the world should contain 0 beepers. Karel's ending location does not matter. Your code should work for a world of any rectangular size. (This can be tricky!)

Type your Java solution code here:

This is a class exercise. Submit a complete Java class as described.

You must log in before you can solve this problem.

Log In

Need help?

If you do not understand how to solve an exercise or why your solution doesn't work, please contact your TA or instructor.
If something seems wrong with the site (errors, slow performance, incorrect tests, etc.), please

Is there a problem? Contact a site administrator.

©, all rights reserved.