diff --git a/PairsWithKDiff.swift b/PairsWithKDiff.swift
new file mode 100644
index 00000000..80b01167
--- /dev/null
+++ b/PairsWithKDiff.swift
@@ -0,0 +1,53 @@
+//
+//  PairsWithKDiff.swift
+//  DSA-Practice
+//
+//  Created by Paridhi Malviya on 4/5/26.
+//
+
+class PairsWithKDiff {
+    
+    init() {
+        
+    }
+    
+    func findPairs(_ nums: [Int], _ k: Int) -> Int {
+        if (k < 0) {
+            return 0
+        }
+
+        var seen = Set<Int>()
+        //store the smaller element in result to avoid duplicates
+        var result = Set<Int>()
+        for num in nums {
+             if (seen.contains(num - k)) {
+                result.insert(num-k)
+             }
+             if (seen.contains(num + k)) {
+                result.insert(num)
+             }
+             seen.insert(num)
+        }
+        return result.count
+    }
+    
+    func findPairsUsingMap(_ nums: [Int], _ k: Int) -> Int {
+        var map = [Int: Int]()
+
+        for num in nums {
+            map[num, default: 0] += 1
+        }
+        var count = 0
+        for (num, frequency) in map {
+            if (k == 0) {
+                if (map[num]! > 1) {
+                    count += 1
+                }
+            } else if (map[num + k] != nil) {
+                count += 1
+            }
+        }
+        return count
+    }
+
+}
diff --git a/PascalsTriangle.swift b/PascalsTriangle.swift
new file mode 100644
index 00000000..50989470
--- /dev/null
+++ b/PascalsTriangle.swift
@@ -0,0 +1,38 @@
+//
+//  PascalsTriangle.swift
+//  DSA-Practice
+//
+//  Created by Paridhi Malviya on 4/5/26.
+//
+
+class PascalsTriangle {
+    
+    init() {
+        
+    }
+    
+    func generate(_ numRows: Int) -> [[Int]] {
+        var output = [[Int]]()
+
+        for i in 0..<numRows {
+            if (i <= 1) {
+                var o = [Int]()
+                for _ in 0...i {
+                    o.append(1)
+                }
+                output.append(o)
+            } else {
+                var o = Array(repeating: -1, count: i + 1)
+                for k in 0...i  {
+                    if (k == 0 || k == i) {
+                        o[k] = 1
+                    } else {
+                        o[k] = output[i-1][k-1] + output[i-1][k]
+                    }
+                }
+                output.append(o)
+            }
+        }
+        return output
+    }
+}
diff --git a/README.md b/README.md
deleted file mode 100644
index f7a4d082..00000000
--- a/README.md
+++ /dev/null
@@ -1,3 +0,0 @@
-# Competitive_Coding-3
-
-Please submit the interview problems posted in slack channel here. The problems and statements are intentionally not shown here so that students are not able to see them in advance 
diff --git a/Sample.java b/Sample.java
deleted file mode 100644
index f5c45b5f..00000000
--- a/Sample.java
+++ /dev/null
@@ -1,7 +0,0 @@
-// Time Complexity :
-// Space Complexity :
-// Did this code successfully run on Leetcode :
-// Any problem you faced while coding this :
-
-
-// Your code here along with comments explaining your approach
\ No newline at end of file