add 2980

Author: fishercoder1534

paginated_contents/algorithms/3rd_thousand/README.md

@@ -1,6 +1,7 @@
 | #    | Title                                                                                                                                                                                      | Solutions                                                                                                                                                              | Video                                | Difficulty                               | Tag                                                                  
 |------|--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|------------------------------------------------------------------------------------------------------------------------------------------------------------------------|--------------------------------------|------------------------------------------|----------------------------------------------------------------------
-| 2996 | [Smallest Missing Integer Greater Than Sequential Prefix Sum](https://leetcode.com/problems/smallest-missing-integer-greater-than-sequential-prefix-sum/)                                                                                                            | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2996.java)                                       |                                      | Easy                                     | 
+| 2996 | [Smallest Missing Integer Greater Than Sequential Prefix Sum](https://leetcode.com/problems/smallest-missing-integer-greater-than-sequential-prefix-sum/)                                                                                                            | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2996.java)                                       |                                      | Easy                                     |
+| 2980 | [Check if Bitwise OR Has Trailing Zeros](https://leetcode.com/problems/check-if-bitwise-or-has-trailing-zeros/)                                                                                                            | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2980.java)                                       |                                      | Easy                                     | Bit Manipulation
 | 2976 | [Minimum Cost to Convert String I](https://leetcode.com/problems/minimum-cost-to-convert-string-i/)                                                                                                            | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2976.java)                                       |                                      | Medium                                   | Graph, Shortest Path
 | 2974 | [Minimum Number Game](https://leetcode.com/problems/minimum-number-game/)                                                                                                             | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2974.java)                                       |                                      | Easy                                     |
 | 2970 | [Count the Number of Incremovable Subarrays I](https://leetcode.com/problems/count-the-number-of-incremovable-subarrays-i/)                                                                                                         | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2970.java)                                       |                                      | Easy                                     |

src/main/java/com/fishercoder/solutions/thirdthousand/_2980.java

@@ -0,0 +1,20 @@
+package com.fishercoder.solutions.thirdthousand;
+
+public class _2980 {
+    public static class Solution1 {
+        /**
+         * 1. bitwise OR can never unset a bit, so if the solution exists, there must be a pair of elements;
+         * 2. as the rightmost bit must stay unset, it's essentially looking for a pair of two even numbers.
+         */
+        public boolean hasTrailingZeros(int[] nums) {
+            for (int i = 0; i < nums.length; i++) {
+                for (int j = i + 1; j < nums.length; j++) {
+                    if (nums[i] % 2 == 0 && nums[j] % 2 == 0) {
+                        return true;
+                    }
+                }
+            }
+            return false;
+        }
+    }
+}