diff --git a/2401. Longest Nice Subarray b/2401. Longest Nice Subarray
new file mode 100644
index 0000000..12a72e6
--- /dev/null
+++ b/2401. Longest Nice Subarray	
@@ -0,0 +1,24 @@
+class Solution {
+public:
+    int longestNiceSubarray(vector<int>& nums) {
+        int n=nums.size();
+        int left=0, right=0, maxi=INT_MIN;
+        while(right<n){
+            bool isNice=true;
+            for(int i=left; i<right; i++){
+                if((nums[i] & nums[right])!=0){
+                    isNice=false;
+                    break;
+                }
+            }
+            if(isNice){
+                maxi=max(maxi, (right-left)+1);
+                right++;
+            }
+            else{
+                left++;
+            }
+        }
+        return maxi;
+    }
+};