question 1: you are a librarian tasked with organizing n books that are currently placed on a long shelf. However, the books are scattered, and some of them are out of order. YOur goal is to rearrange the books so they occupy consecutive spots on the shelf, minimizing the effort needed for future access. Fing the minimum number of moves required to rearrange the books into consecutive spots on the shelf, In 1 move you can move 1 book to any arbitrary position similar questions: Minimum Moves to Make Array Consecutive (same sliding-window idea) Herding (very similar "move items to consecutive positions" concept) Collecting Numbers into Consecutive Positions