3762. Minimum Operations to Equalize Subarrays

You are given an integer array nums and an integer k. In one operation, you can increase or decrease any element of nums by exactly k. You are also given a 2D integer array queries, where each queries[i] = [li, ri]. For each query, find the minimum number of operations required to make all elements in the subarray nums[li..ri] equal. If it is impossible, the answer for that query is -1. Return