diff --git a/Easy/flipping-image.cpp b/Easy/flipping-image.cpp
new file mode 100644
index 0000000..5af62ab
--- /dev/null
+++ b/Easy/flipping-image.cpp
@@ -0,0 +1,47 @@
+/*                    LEETCODE PROBLEM: 832
+                      Flipping an Image
+                      
+https://leetcode.com/problems/flipping-an-image/
+  
+Given an n x n binary matrix image, flip the image  horizontally, then invert it, and return the resulting image.
+To flip an image horizontally means that each row of the image is reversed.
+For example, flipping [1,1,0] horizontally results in [0,1,1].
+To invert an image means that each 0 is replaced by 1, and each 1 is replaced by 0.
+For example, inverting [0,1,1] results in [1,0,0].
+ 
+Example 1:
+  Input: image = [[1,1,0],[1,0,1],[0,0,0]]
+  Output: [[1,0,0],[0,1,0],[1,1,1]]
+  Explanation: First reverse each row: [[0,1,1],[1,0,1],[0,0,0]].
+  Then, invert the image: [[1,0,0],[0,1,0],[1,1,1]]
+*/
+class Solution {
+public:
+    vector<vector<int>> flipAndInvertImage(vector<vector<int>>& image) {
+        
+        for(int i=0;i<image.size();i++)
+        {
+            int start=0;
+            int end=image[i].size()-1;
+            while(start<end)
+            {
+                swap(image[i][start],image[i][end]);
+                start++;
+                end--;  
+            } 
+            for(int j=0;j<image[i].size();j++)
+            {
+                if(image[i][j]==0)
+                {
+                    image[i][j]=1;
+                }
+                else
+                {
+                    image[i][j]=0;
+                }
+            }
+        }
+        
+        return image;
+    }
+};