Inversion Count

Table of Contents

• 315. Count of Smaller Numbers After Self (Hard)
• 493. Reverse Pairs (Hard)
• 327. Count of Range Sum (Hard)
• 2426. Number of Pairs Satisfying Inequality (Hard)
• 1850. Minimum Adjacent Swaps to Reach the Kth Smallest Number (Medium)
• 2193. Minimum Number of Moves to Make Palindrome (Hard)
• 1885. Count Pairs in Two Arrays (Medium) 👑

315. Count of Smaller Numbers After Self

• LeetCode | 力扣

• Tags: Array, Binary Search, Divide And Conquer, Binary Indexed Tree, Segment Tree, Merge Sort, Ordered Set

493. Reverse Pairs

• LeetCode | 力扣

• Tags: Array, Binary Search, Divide And Conquer, Binary Indexed Tree, Segment Tree, Merge Sort, Ordered Set

327. Count of Range Sum

• LeetCode | 力扣

• Tags: Array, Binary Search, Divide And Conquer, Binary Indexed Tree, Segment Tree, Merge Sort, Ordered Set

2426. Number of Pairs Satisfying Inequality

• LeetCode | 力扣

• Tags: Array, Binary Search, Divide And Conquer, Binary Indexed Tree, Segment Tree, Merge Sort, Ordered Set

1850. Minimum Adjacent Swaps to Reach the Kth Smallest Number

• LeetCode | 力扣

• Tags: Two Pointers, String, Greedy

2193. Minimum Number of Moves to Make Palindrome

• LeetCode | 力扣

• Tags: Two Pointers, String, Greedy, Binary Indexed Tree

1885. Count Pairs in Two Arrays 👑

• LeetCode | 力扣

• Tags: Array, Two Pointers, Binary Search, Sorting