Skip to content

2025-03-06 v. 8.8.5: added "1829. Maximum XOR for Each Query" #974

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 1 commit into from
Mar 6, 2025
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension


Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
1 change: 1 addition & 0 deletions README.md
Original file line number Diff line number Diff line change
Expand Up @@ -718,6 +718,7 @@ Profile on LeetCode: [fartem](https://leetcode.com/fartem/).
| 1797. Design Authentication Manager | [Link](https://leetcode.com/problems/design-authentication-manager/) | [Link](./lib/medium/1797_design_authentication_manager.rb) | [Link](./test/medium/test_1797_design_authentication_manager.rb) |
| 1814. Count Nice Pairs in an Array | [Link](https://leetcode.com/problems/count-nice-pairs-in-an-array/) | [Link](./lib/medium/1814_count_nice_pairs_in_an_array.rb) | [Link](./test/medium/test_1814_count_nice_pairs_in_an_array.rb) |
| 1823. Find the Winner of the Circular Game | [Link](https://leetcode.com/problems/find-the-winner-of-the-circular-game/) | [Link](./lib/medium/1823_find_the_winner_of_the_circular_game.rb) | [Link](./test/medium/test_1823_find_the_winner_of_the_circular_game.rb) |
| 1829. Maximum XOR for Each Query | [Link](https://leetcode.com/problems/maximum-xor-for-each-query/) | [Link](./lib/medium/1829_maximum_xor_for_each_query.rb) | [Link](./test/medium/test_1829_maximum_xor_for_each_query.rb) |
| 2116. Check if a Parentheses String Can Be Valid | [Link](https://leetcode.com/problems/check-if-a-parentheses-string-can-be-valid/) | [Link](./lib/medium/2116_check_if_a_parentheses_string_can_be_valid.rb) | [Link](./test/medium/test_2116_check_if_a_parentheses_string_can_be_valid.rb) |
| 2425. Bitwise XOR of All Pairings | [Link](https://leetcode.com/problems/bitwise-xor-of-all-pairings/) | [Link](./lib/medium/2425_bitwise_xor_of_all_pairings.rb) | [Link](./test/medium/test_2425_bitwise_xor_of_all_pairings.rb) |
| 2429. Minimize XOR | [Link](https://leetcode.com/problems/minimize-xor/) | [Link](./lib/medium/2429_minimize_xor.rb) | [Link](./test/medium/test_2429_minimize_xor.rb) |
Expand Down
2 changes: 1 addition & 1 deletion leetcode-ruby.gemspec
Original file line number Diff line number Diff line change
Expand Up @@ -5,7 +5,7 @@ require 'English'
::Gem::Specification.new do |s|
s.required_ruby_version = '>= 3.0'
s.name = 'leetcode-ruby'
s.version = '8.8.4'
s.version = '8.8.5'
s.license = 'MIT'
s.files = ::Dir['lib/**/*.rb'] + %w[README.md]
s.executable = 'leetcode-ruby'
Expand Down
17 changes: 17 additions & 0 deletions lib/medium/1829_maximum_xor_for_each_query.rb
Original file line number Diff line number Diff line change
@@ -0,0 +1,17 @@
# frozen_string_literal: true

# https://leetcode.com/problems/maximum-xor-for-each-query/
# @param {Integer[]} nums
# @param {Integer} maximum_bit
# @return {Integer[]}
def get_maximum_xor(nums, maximum_bit)
result = ::Array.new(nums.size, 0)
xor = (1 << maximum_bit) - 1

(0...nums.size).each do |i|
xor ^= nums[i]
result[nums.size - i - 1] = xor
end

result
end
37 changes: 37 additions & 0 deletions test/medium/test_1829_maximum_xor_for_each_query.rb
Original file line number Diff line number Diff line change
@@ -0,0 +1,37 @@
# frozen_string_literal: true

require_relative '../test_helper'
require_relative '../../lib/medium/1829_maximum_xor_for_each_query'
require 'minitest/autorun'

class MaximumXORForEachQueryTest < ::Minitest::Test
def test_default_one
assert_equal(
[0, 3, 2, 3],
get_maximum_xor(
[0, 1, 1, 3],
2
)
)
end

def test_default_two
assert_equal(
[5, 2, 6, 5],
get_maximum_xor(
[2, 3, 4, 7],
3
)
)
end

def test_default_three
assert_equal(
[4, 3, 6, 4, 6, 7],
get_maximum_xor(
[0, 1, 2, 2, 5, 7],
3
)
)
end
end