This method is the answer to the problem of "New Year's Chaos" in which he receives an int [] and must answer how many bribes there have been; If a person bribes more than 2 times it is total chaos.

MinimumBribes.java

    static void minimumBribes(int[] q) {
        int ans=0;

        for(int i=q.length -1; i >= 0 ; i--) {
            if (q[i] - (i+1) > 2) {
                System.out.println("Too chaotic");
                return;
            }
            for (int j = Integer.max(0, q[i] - 2); j < i; j++)
                if (q[j] > q[i]) ans++;
        }
        System.out.println(ans);
    }