Day 14 – Inversions, Max Product Subarray, Merge Intervals, In-Place Merging, Duplicates, and Binary Search Patterns

Count Inversions (Merge Sort Based) Counts pairs (i, j) such that i < j and arr[i] > arr[j]. int merge(vector<int>& arr, int low, int mid, int high) { vector<int> temp; int i = low, j = mid + 1, cnt = 0; while (i <= mid && j <= high) { ...