diff --git a/48.Rotate Image.java b/48.Rotate Image.java
new file mode 100644
index 0000000..09bebed
--- /dev/null
+++ b/48.Rotate Image.java	
@@ -0,0 +1,20 @@
+public class Solution {
+    public void rotate(int[][] matrix) {
+        for(int i = 0; i<matrix.length; i++){
+            for(int j = i; j<matrix[0].length; j++){
+                int temp = 0;
+                temp = matrix[i][j];
+                matrix[i][j] = matrix[j][i];
+                matrix[j][i] = temp;
+            }
+        }
+        for(int i =0 ; i<matrix.length; i++){
+            for(int j = 0; j<matrix.length/2; j++){
+                int temp = 0;
+                temp = matrix[i][j];
+                matrix[i][j] = matrix[i][matrix.length-1-j];
+                matrix[i][matrix.length-1-j] = temp;
+            }
+        }
+    }
+}
\ No newline at end of file
diff --git a/two sum.cpp b/two sum.cpp
index e17336c..ae9486d 100644
--- a/two sum.cpp	
+++ b/two sum.cpp	
@@ -1,12 +1,12 @@
-https://leetcode.com/problems/two-sum/  
-class Solution {
-public:
-    vector<int> twoSum(vector<int>& nums, int target) {
-     map<int,int> m;
-         for(int i=0; i<nums.size(); i++){
-             if(m.find(target-nums[i])==m.end()) m[nums[i]]=i;
-             else return {i,m[target-nums[i]]};
-         }
-        return{};
-    }
+https://leetcode.com/problems/two-sum/  
+class Solution {
+public:
+    vector<int> twoSum(vector<int>& nums, int target) {
+     map<int,int> m;
+         for(int i=0; i<nums.size(); i++){
+             if(m.find(target-nums[i])==m.end()) m[nums[i]]=i;
+             else return {i,m[target-nums[i]]};
+         }
+        return{};
+    }
 };
\ No newline at end of file