Locksmith Leeds provides expert services for lock repairs, replacements, and emergency callouts, keeping homes, businesses, and vehicles safe. With skilled technicians and fast response times, they deliver reliable and professional solutions tailored to customer needs. Known for efficiency and trust, their team ensures peace of mind in every situation. Similarly, Lily's Homework reflects the challenges and learning experiences faced by students, emphasizing dedication, time management, and support to achieve academic success effectively.

import java.io.; import java.util.; import java.util.stream.*;

class Result {

public static int lilysHomework(List<Integer> arr) {
    return Math.min(minSwaps(new ArrayList<>(arr)), minSwaps(reverseList(arr)));
}

private static int minSwaps(List<Integer> arr) {
    int n = arr.size();
    int swaps = 0;

    int[] sorted = arr.stream().mapToInt(i -> i).toArray();
    Arrays.sort(sorted);

    Map<Integer, Integer> indexMap = new HashMap<>();
    for (int i = 0; i < n; i++) {
        indexMap.put(arr.get(i), i);
    }

    for (int i = 0; i < n; i++) {
        if (arr.get(i) != sorted[i]) {
            swaps++;

            int correctValue = sorted[i];
            int toSwapIdx = indexMap.get(correctValue);

            // Update map before swapping
            indexMap.put(arr.get(i), toSwapIdx);
            indexMap.put(correctValue, i);

            // Swap in the list
            Collections.swap(arr, i, toSwapIdx);
        }
    }

    return swaps;
}

private static List<Integer> reverseList(List<Integer> list) {
    List<Integer> reversed = new ArrayList<>(list);
    Collections.reverse(reversed);
    return reversed;
}

}

public class Solution { public static void main(String[] args) throws IOException { BufferedReader bufferedReader = new BufferedReader(new InputStreamReader(System.in)); BufferedWriter bufferedWriter = new BufferedWriter(new FileWriter(System.getenv("OUTPUT_PATH")));

    int n = Integer.parseInt(bufferedReader.readLine().trim());

    List<Integer> arr = Arrays.stream(bufferedReader.readLine().trim().split(" "))
        .map(Integer::parseInt)
        .collect(Collectors.toList());

    int result = Result.lilysHomework(arr);

    bufferedWriter.write(String.valueOf(result));
    bufferedWriter.newLine();

    bufferedReader.close();
    bufferedWriter.close();
}

}

simple c++ code with function

int getswaps(unordered_map& d) { int swap = 0; for (auto& pair : d) { int x = pair.first; int y = pair.second; while (x != y) { swap++; d[x] = d[y]; d[y] = y; y = d[x]; } } return swap; } int lilysHomework(vector arr) { vector arrs = arr; sort(arrs.begin(), arrs.end()); unordered_map d1, d2;

for (size_t i = 0; i < arr.size(); i++) {
    d1[arr[i]] = arrs[i];
    d2[arr[i]] = arrs[arr.size() - 1 - i];
}

return min(getswaps(d1), getswaps(d2));

}

javascript

function lilysHomework(arr) {

    let sorted = arr.slice().sort((a, b) => a - b);
    let arr2 = arr.slice();
    let check = {};
    let check2 = {};
    let ans = 0;
    let ans2 = 0;
    for (let i=0;i<sorted.length;++i) {
        check[sorted[i]] = i;
    }
    for (let i=0;i<sorted.length;++i) {
        check2[sorted[i]] = sorted.length-1-i;
    }

    for(let i=0;i<arr.length;) {
        if (check[arr[i]] != i) {
            let t = arr[i];
            let t_i = check[arr[i]];
            arr[i] = arr[check[arr[i]]];
            arr[t_i] = t;
            ++ans;
        } else {
            ++i;
        }    
    }
    
    for(let i=arr2.length - 1;i>0;) {
        if (check2[arr2[i]] != i) {
            let t = arr2[i];
            let t_i = check2[arr2[i]];
            arr2[i] = arr2[check2[arr2[i]]];
            arr2[t_i] = t;
            ++ans2;
        } else {
            --i;
        }    
    }
    
    return ans < ans2 ? ans : ans2;
}