Create README - LeetHub

MishkatIT · MishkatIT · commit f7bb89ce8af2 · 2025-03-18T16:10:01.000-07:00
diff --git a/2401-longest-nice-subarray/README.md b/2401-longest-nice-subarray/README.md
@@ -1,4 +1,4 @@
-<h2><a href="https://leetcode.com/problems/longest-nice-subarray/?envType=daily-question&envId=2025-03-18">2401. Longest Nice Subarray</a></h2><h3>Medium</h3><hr><p>You are given an array <code>nums</code> consisting of <strong>positive</strong> integers.</p>
+<h2><a href="https://leetcode.com/problems/longest-nice-subarray">2401. Longest Nice Subarray</a></h2><h3>Medium</h3><hr><p>You are given an array <code>nums</code> consisting of <strong>positive</strong> integers.</p>
 
 <p>We call a subarray of <code>nums</code> <strong>nice</strong> if the bitwise <strong>AND</strong> of every pair of elements that are in <strong>different</strong> positions in the subarray is equal to <code>0</code>.</p>
 

Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-<h2><a href="https://leetcode.com/problems/longest-nice-subarray/?envType=daily-question&envId=2025-03-18">2401. Longest Nice Subarray</a></h2><h3>Medium</h3><hr><p>You are given an array <code>nums</code> consisting of <strong>positive</strong> integers.</p>`
	`1`	`+<h2><a href="https://leetcode.com/problems/longest-nice-subarray">2401. Longest Nice Subarray</a></h2><h3>Medium</h3><hr><p>You are given an array <code>nums</code> consisting of <strong>positive</strong> integers.</p>`
`2`	`2`
`3`	`3`	`<p>We call a subarray of <code>nums</code> <strong>nice</strong> if the bitwise <strong>AND</strong> of every pair of elements that are in <strong>different</strong> positions in the subarray is equal to <code>0</code>.</p>`
`4`	`4`