BIT problems

8 BIT DSA practice problems on CampusCode, each with statement, examples and constraints.

• 532. Count of Smaller Numbers After Self Hard Binary Search
• 535. K Empty Slots Hard Binary Search
• 932. Binary Indexed Tree — Prefix Sum Medium Trees
• 938. Count of Smaller Numbers After Self (BST/BIT) Hard Trees
• 945. Count of Range Sum (Merge Sort + BST) Hard Trees
• 956. Count Inversions Using BIT Hard Trees
• 957. Kth Smallest Element in a Sorted Matrix Hard Trees
• 958. 2D Range Sum Queries (2D BIT / Prefix) Hard Trees