From 76ea9ab21a44f76f1984ee3d23691d23e822b19f Mon Sep 17 00:00:00 2001 From: fartem Date: Fri, 17 Jan 2025 10:46:26 +0300 Subject: [PATCH] 2025-01-17 v. 8.1.3: added "2683. Neighboring Bitwise XOR" --- README.md | 1 + leetcode-ruby.gemspec | 2 +- lib/medium/2683_neighboring_bitwise_xor.rb | 6 ++++ .../test_2683_neighboring_bitwise_xor.rb | 31 +++++++++++++++++++ 4 files changed, 39 insertions(+), 1 deletion(-) create mode 100644 lib/medium/2683_neighboring_bitwise_xor.rb create mode 100644 test/medium/test_2683_neighboring_bitwise_xor.rb diff --git a/README.md b/README.md index 1f487849..feb1d0c5 100644 --- a/README.md +++ b/README.md @@ -653,6 +653,7 @@ Profile on LeetCode: [fartem](https://leetcode.com/fartem/). | 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) | | 2657. Find the Prefix Common Array of Two Arrays | [Link](https://leetcode.com/problems/find-the-prefix-common-array-of-two-arrays/) | [Link](./lib/medium/2657_find_the_prefix_common_array_of_two_arrays.rb) | [Link](./test/medium/test_2657_find_the_prefix_common_array_of_two_arrays.rb) | +| 2683. Neighboring Bitwise XOR | [Link](https://leetcode.com/problems/neighboring-bitwise-xor/) | [Link](./lib/medium/2683_neighboring_bitwise_xor.rb) | [Link](./test/medium/test_2683_neighboring_bitwise_xor.rb) | | 3223. Minimum Length of String After Operations | [Link](https://leetcode.com/problems/minimum-length-of-string-after-operations/) | [Link](./lib/medium/3223_minimum_length_of_string_after_operations.rb) | [Link](./test/medium/test_3223_minimum_length_of_string_after_operations.rb) | ### Hard diff --git a/leetcode-ruby.gemspec b/leetcode-ruby.gemspec index 6d68bade..07225d27 100644 --- a/leetcode-ruby.gemspec +++ b/leetcode-ruby.gemspec @@ -5,7 +5,7 @@ require 'English' ::Gem::Specification.new do |s| s.required_ruby_version = '>= 3.0' s.name = 'leetcode-ruby' - s.version = '8.1.2.1' + s.version = '8.1.3' s.license = 'MIT' s.files = ::Dir['lib/**/*.rb'] + %w[README.md] s.executable = 'leetcode-ruby' diff --git a/lib/medium/2683_neighboring_bitwise_xor.rb b/lib/medium/2683_neighboring_bitwise_xor.rb new file mode 100644 index 00000000..72e2a003 --- /dev/null +++ b/lib/medium/2683_neighboring_bitwise_xor.rb @@ -0,0 +1,6 @@ +# frozen_string_literal: true + +# https://leetcode.com/problems/neighboring-bitwise-xor/ +# @param {Integer[]} derived +# @return {Boolean} +def does_valid_array_exist(derived) = derived.reduce(:^).zero? diff --git a/test/medium/test_2683_neighboring_bitwise_xor.rb b/test/medium/test_2683_neighboring_bitwise_xor.rb new file mode 100644 index 00000000..c623d84b --- /dev/null +++ b/test/medium/test_2683_neighboring_bitwise_xor.rb @@ -0,0 +1,31 @@ +# frozen_string_literal: true + +require_relative '../test_helper' +require_relative '../../lib/medium/2683_neighboring_bitwise_xor' +require 'minitest/autorun' + +class NeighboringBitwiseXORTest < ::Minitest::Test + def test_default_one + assert( + does_valid_array_exist( + [1, 1, 0] + ) + ) + end + + def test_default_two + assert( + does_valid_array_exist( + [1, 1] + ) + ) + end + + def test_default_three + assert( + !does_valid_array_exist( + [1, 0] + ) + ) + end +end