Java Simple and easy to understand solution, T O(n/2), S O(1) , clean code with comments
PLEASE UPVOTE IF YOU LIKE THIS SOLUTION\n\n\n\n\nclass Solution {\n    public int minOperations(int n) {\n        \n        int operations = 0;\n        \n     
**PLEASE UPVOTE IF YOU LIKE THIS SOLUTION**\n\n\n\n```\nclass Solution {\n    public int minOperations(int n) {\n        \n        int operations = 0;\n        \n        /* sum of difference between, n - arr[i], i => [0, n /2)\n        */\n        \n        for(int i = 0; i < n / 2; i++){\n            //append the difference\n            operations += (n - (2  * i + 1));\n        }\n        \n        return operations;\n        \n    }\n\n}\n```
['Java']