diff --git a/LeetCode/0523_K_diff_Pairs_in_an_Array.py b/LeetCode/0523_K_diff_Pairs_in_an_Array.py
new file mode 100644
index 0000000..1e96cc0
--- /dev/null
+++ b/LeetCode/0523_K_diff_Pairs_in_an_Array.py
@@ -0,0 +1,14 @@
+from collections import Counter
+class Solution:
+    def findPairs(self, nums: List[int], k: int) -> int:
+        ans = 0
+        c = Counter(nums)
+        if k == 0:
+            for val in c.values():
+                if val > 1:
+                    ans += 1
+            return ans
+        for i in c.keys():
+            if i + k in c.keys():
+                ans += 1
+        return ans
diff --git a/LeetCode/1288_Remove_Covered_Intervals.py b/LeetCode/1288_Remove_Covered_Intervals.py
new file mode 100644
index 0000000..143dc05
--- /dev/null
+++ b/LeetCode/1288_Remove_Covered_Intervals.py
@@ -0,0 +1,11 @@
+class Solution:
+    def removeCoveredIntervals(self, intervals: List[List[int]]) -> int:
+        intervals.sort(key=lambda x: (x[0], -x[1]))
+        inside = 0
+        right = -1
+        for i, j in intervals:
+            if j <= right:
+                inside += 1
+            else:
+                right = j
+        return len(intervals) - inside