Understand what an inversion is and look into ways of solving the problem of counting inversions in an array.
Also find me here:
Baeldung Author
Said Sryheni
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):
Finding a Cycle in a Singly Linked-List
Filed under Algorithms, Path Finding
Have a look at algorithms for finding a cycle in a singly linked-list.
Finding the Most Significant Bit
Filed under Algorithms, Core Concepts
A quick and practical guide to finding the most significant bit.
Non-Recursive Merge Sort
Filed under Algorithms, Sorting
A quick and practical overview of the non-recursive merge sort algorithm.
Introduction to Depth First Search Algorithm (DFS)
Filed under Algorithms, Graph Traversal
A quick and practical overview of the DFS algorithm.
Merge Two Sorted Arrays Into a Sorted Array
Filed under Sorting
A quick and practical guide to merging two sorted arrays into a single sorted array.
Efficient Ways to Find the Intersection of Lists
Filed under Algorithms, Data Structures
A quick and practical guide to finding the intersection of linked lists.
Remove Duplicates From a Linked List
Filed under Algorithms, Programming
A quick and practical tutorial to removing duplicates from a linked list.
Maximizing Profit for Given Stock Quotes
Filed under Math and Logic
A quick and practical guide to maximizing profit for given stock quotes.
Getting a Path From a Root to a Node in a Binary Tree
Filed under Path Finding
A quick and practical guide to getting a path from a root to a node in a binary tree.
