Anything where it's less time consuming to validate work than to do the work yourself, which is a lot. If it's not real-time like driving then this is great.
Also from a computational complexity angle there’s actually a mathematical definition — “NP Complete” which describes problems that are cheap to verify but hard to solve. One example could be a solution to a maze. It’s easy to look at the maze solution and verify it connects start to end without crossing walls, but much more time consuming to actually solve the maze with all the wrong turns needed to produce a solution.