The 2010 AP Computer Science A Free Response problems are easier than usual.

The MasterOrder problem requires simple traversals through an ArrayList, including with element removal.

The APLine problem requires writing and entire class. The class itself is simple.

The Trail problem involves 2 simple to moderate traverals of a 1D array. Attention to detail is required, as off by one errors are easy to make in both methods.

The GridChecker problem (from the old GridWorld Case Study) is the most complex in the 2010 FR. Both methods require traverals with the getOccupiedWithinTwo method requiring a moderately complex traversal of part of a Grid.