Update and rename 3002-Maximum size of a set after removals.md to 3002-maximum-size-of-a-set-after-removals.md

Author: ajay-dhangar

dsa-solutions/lc-solutions/3000-3099/3002-Maximum size of a set after removals.md renamed to dsa-solutions/lc-solutions/3000-3099/3002-maximum-size-of-a-set-after-removals.md

@@ -151,7 +151,3 @@ public:
 
 - Time complexity: $O(n)$, where n is the total number of elements in both nums1 and nums2. Calculating the set intersection and differences takes linear time.
 - Space complexity: $O(n)$ , where n is the total number of elements in both nums1 and nums2. The space complexity is dominated by the sets n1 and n2, which store unique elements from the input arrays.
-
-- **LeetCode Problem**: [Maximum Size of a Set After Removals](]https://leetcode.com/problems/maximum-size-of-a-set-after-removals/description/)
-
-- **Solution Link**: [LeetCode Solution](https://leetcode.com/problems/maximum-size-of-a-set-after-removals/solutions/5211330/97-beats-python3-set)