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 | LeetCode CH (Hard)
-
Tags: array, binary search, divide and conquer, binary indexed tree, segment tree, merge sort, ordered set
493. Reverse Pairs¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: array, binary search, divide and conquer, binary indexed tree, segment tree, merge sort, ordered set
327. Count of Range Sum¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: array, binary search, divide and conquer, binary indexed tree, segment tree, merge sort, ordered set
2426. Number of Pairs Satisfying Inequality¶
-
LeetCode | LeetCode CH (Hard)
-
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 | LeetCode CH (Medium)
-
Tags: two pointers, string, greedy
2193. Minimum Number of Moves to Make Palindrome¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: two pointers, string, greedy, binary indexed tree
1885. Count Pairs in Two Arrays¶
-
LeetCode | LeetCode CH (Medium)
-
Tags: array, two pointers, binary search, sorting