feat: add 1829 and 2275

Author: remy727

README.md

@@ -436,6 +436,7 @@
 | 1802 | Maximum Value at a Given Index in a Bounded Array | [Ruby](./algorithms/ruby/1802-maximum-value-at-a-given-index-in-a-bounded-array.rb) | Medium |
 | 1814 | Count Nice Pairs in an Array | [Ruby](./algorithms/ruby/1814-count-nice-pairs-in-an-array.rb) | Medium |
 | 1822 | Sign of the Product of an Array | [Ruby](./algorithms/ruby/1822-sign-of-the-product-of-an-array.rb) | Easy |
+| 1829 | Maximum XOR for Each Query | [Ruby](./algorithms/ruby/1829-maximum-xor-for-each-query.rb) | Medium |
 | 1838 | Frequency of the Most Frequent Element | [Ruby](./algorithms/ruby/1838-frequency-of-the-most-frequent-element.rb) | Medium |
 | 1845 | Seat Reservation Manager | [Ruby](./algorithms/ruby/1845-seat-reservation-manager.rb) | Medium |
 | 1846 | Maximum Element After Decreasing and Rearranging | [Ruby](./algorithms/ruby/1846-maximum-element-after-decreasing-and-rearranging.rb) | Medium |
@@ -470,6 +471,7 @@
 | 2264 | Largest 3-Same-Digit Number in String | [Ruby](./algorithms/ruby/2264-largest-3-same-digit-number-in-string.rb) | Easy |
 | 2265 | Count Nodes Equal to Average of Subtree | [Ruby](./algorithms/ruby/2265-count-nodes-equal-to-average-of-subtree.rb) | Medium |
 | 2272 | Substring With Largest Variance | [Ruby](./algorithms/ruby/2272-substring-with-largest-variance.rb) | Hard |
+| 2275 | Largest Combination With Bitwise AND Greater Than Zero | [Ruby](./algorithms/ruby/2275-largest-combination-with-bitwise-and-greater-than-zero.rb) | Medium |
 | 2300 | Successful Pairs of Spells and Potions | [Ruby](./algorithms/ruby/2300-successful-pairs-of-spells-and-potions.rb) | Medium |
 | 2305 | Fair Distribution of Cookies | [Ruby](./algorithms/ruby/2305-fair-distribution-of-cookies.rb) | Medium |
 | 2316 | Count Unreachable Pairs of Nodes in an Undirected Graph | [Ruby](./algorithms/ruby/2316-count-unreachable-pairs-of-nodes-in-an-undirected-graph.rb) | Medium |

algorithms/ruby/1829-maximum-xor-for-each-query.rb

@@ -0,0 +1,64 @@
+# frozen_string_literal: true
+
+# 1829. Maximum XOR for Each Query
+# Medium
+# https://leetcode.com/problems/maximum-xor-for-each-query
+
+=begin
+You are given a sorted array nums of n non-negative integers and an integer maximumBit. You want to perform the following query n times:
+1. Find a non-negative integer k < 2maximumBit such that nums[0] XOR nums[1] XOR ... XOR nums[nums.length-1] XOR k is maximized. k is the answer to the ith query.
+2. Remove the last element from the current array nums.
+Return an array answer, where answer[i] is the answer to the ith query.
+
+Example 1:
+Input: nums = [0,1,1,3], maximumBit = 2
+Output: [0,3,2,3]
+Explanation: The queries are answered as follows:
+1st query: nums = [0,1,1,3], k = 0 since 0 XOR 1 XOR 1 XOR 3 XOR 0 = 3.
+2nd query: nums = [0,1,1], k = 3 since 0 XOR 1 XOR 1 XOR 3 = 3.
+3rd query: nums = [0,1], k = 2 since 0 XOR 1 XOR 2 = 3.
+4th query: nums = [0], k = 3 since 0 XOR 3 = 3.
+Example 2:
+Input: nums = [2,3,4,7], maximumBit = 3
+Output: [5,2,6,5]
+Explanation: The queries are answered as follows:
+1st query: nums = [2,3,4,7], k = 5 since 2 XOR 3 XOR 4 XOR 7 XOR 5 = 7.
+2nd query: nums = [2,3,4], k = 2 since 2 XOR 3 XOR 4 XOR 2 = 7.
+3rd query: nums = [2,3], k = 6 since 2 XOR 3 XOR 6 = 7.
+4th query: nums = [2], k = 5 since 2 XOR 5 = 7.
+Example 3:
+Input: nums = [0,1,2,2,5,7], maximumBit = 3
+Output: [4,3,6,4,6,7]
+
+Constraints:
+* nums.length == n
+* 1 <= n <= 105
+* 1 <= maximumBit <= 20
+* 0 <= nums[i] < 2maximumBit
+* nums​​​ is sorted in ascending order.
+=end
+
+# @param {Integer[]} nums
+# @param {Integer} maximum_bit
+# @return {Integer[]}
+def get_maximum_xor(nums, maximum_bit)
+  mask = (1 << maximum_bit) - 1
+  curr = 0
+  nums.map do |num|
+    curr ^= num
+    curr ^ mask
+  end.reverse
+end
+
+# **************** #
+#       TEST       #
+# **************** #
+
+require "test/unit"
+class Test_get_maximum_xor < Test::Unit::TestCase
+  def test_
+    assert_equal [0, 3, 2, 3], get_maximum_xor([0, 1, 1, 3], 2)
+    assert_equal [5, 2, 6, 5], get_maximum_xor([2, 3, 4, 7], 3)
+    assert_equal [4, 3, 6, 4, 6, 7], get_maximum_xor([0, 1, 2, 2, 5, 7], 3)
+  end
+end

algorithms/ruby/2275-largest-combination-with-bitwise-and-greater-than-zero.rb

@@ -0,0 +1,64 @@
+# frozen_string_literal: true
+
+# 2275. Largest Combination With Bitwise AND Greater Than Zero
+# Medium
+# https://leetcode.com/problems/largest-combination-with-bitwise-and-greater-than-zero
+
+=begin
+The bitwise AND of an array nums is the bitwise AND of all integers in nums.
+* For example, for nums = [1, 5, 3], the bitwise AND is equal to 1 & 5 & 3 = 1.
+* Also, for nums = [7], the bitwise AND is 7.
+You are given an array of positive integers candidates. Evaluate the bitwise AND of every combination of numbers of candidates. Each number in candidates may only be used once in each combination.
+Return the size of the largest combination of candidates with a bitwise AND greater than 0.
+
+Example 1:
+Input: candidates = [16,17,71,62,12,24,14]
+Output: 4
+Explanation: The combination [16,17,62,24] has a bitwise AND of 16 & 17 & 62 & 24 = 16 > 0.
+The size of the combination is 4.
+It can be shown that no combination with a size greater than 4 has a bitwise AND greater than 0.
+Note that more than one combination may have the largest size.
+For example, the combination [62,12,24,14] has a bitwise AND of 62 & 12 & 24 & 14 = 8 > 0.
+Example 2:
+Input: candidates = [8,8]
+Output: 2
+Explanation: The largest combination [8,8] has a bitwise AND of 8 & 8 = 8 > 0.
+The size of the combination is 2, so we return 2.
+
+Constraints:
+* 1 <= candidates.length <= 105
+* 1 <= candidates[i] <= 107
+=end
+
+# @param {Integer[]} candidates
+# @return {Integer}
+def largest_combination(candidates)
+  max_count = 0
+  count = 0
+
+  for i in 0..31 do
+    count = 0
+
+    candidates.each do |num|
+      if num & (1 << i) != 0
+        count += 1
+      end
+    end
+
+    max_count = [count, max_count].max
+  end
+
+  max_count
+end
+
+# **************** #
+#       TEST       #
+# **************** #
+
+require "test/unit"
+class Test_largest_combination < Test::Unit::TestCase
+  def test_
+    assert_equal 4, largest_combination([16, 17, 71, 62, 12, 24, 14])
+    assert_equal 2, largest_combination([8, 8])
+  end
+end