This question from last year has a complete switchup of all non-pawn pieces on the board with all the pawns on the 4th and 5th ranks, The goal was optimize the amount of moves needed to reach the given diagram.
Here is a variation of it. Only four pawns have moved, the least needed to allow a swap of all 16 pieces.
Challenge: Find the least number of moves needed to get to this position.