Understand what an inversion is and look into ways of solving the problem of counting inversions in an array.
I am a backend JEE developer specialized in technologies like Spring and Hibernate with +3 years of experience. I have been an ICPC competitive programmer using C++ for +5 years. You can check my ICPCID on https://icpc.baylor.edu/ICPCID/VHOFJ5IO88M4
Here's what I've written (so far):
Have a look at algorithms for finding a cycle in a singly linked-list.
A quick and practical guide to finding the most significant bit.
A quick and practical overview of the non-recursive merge sort algorithm.
A quick and practical overview of the DFS algorithm.
A quick and practical guide to merging two sorted arrays into a single sorted array.
A quick and practical guide to finding the intersection of linked lists.
A quick and practical tutorial to removing duplicates from a linked list.
A quick and practical guide to maximizing profit for given stock quotes.
A quick and practical guide to getting a path from a root to a node in a binary tree.