Merge Sort problems

9 Merge Sort DSA practice problems on CampusCode, each with statement, examples and constraints.

• 359. Sort Linked List (Merge Sort) Medium Linked List
• 396. Sort List in O(n log n) Time and O(1) Space Hard Linked List
• 401. Count Inversions via Merge Sort Hard Linked List
• 532. Count of Smaller Numbers After Self Hard Binary Search
• 533. Count of Range Sum Hard Binary Search
• 534. Reverse Pairs (Modified Merge Sort) Hard Binary Search
• 945. Count of Range Sum (Merge Sort + BST) Hard Trees
• 953. Count of Range Sum (Segment Tree) Hard Trees
• 956. Count Inversions Using BIT Hard Trees