algoruby 0.1.0

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA256:
+  metadata.gz: db51ef24911c717bb07b383b60d70f6ce6eb584e40ef4b9a34a8b6cf2e0fbb31
+  data.tar.gz: ff7716a24e6ab7ff58d8d5891f840b2a693d4696f405e06ed7375016c69303e2
+SHA512:
+  metadata.gz: 5a3a164faaf41cf88566047c04086db352311c9810c231344b78b3ce7f1795e600f186821520c0a3fdcd7fa580408c9eb3f75fd9b6bb227ebc66e0590a5af15e
+  data.tar.gz: 41a27356713d59f5a6a4da95844b19d0a28e11aa93bc1b47e70b1ea8f120ffe3f1bfa72a82af5328ea53e207db78a7186682037099143a242b4f1aa730b34e79

data/CODE_OF_CONDUCT.md

@@ -0,0 +1,132 @@
+# Contributor Covenant Code of Conduct
+
+## Our Pledge
+
+We as members, contributors, and leaders pledge to make participation in our
+community a harassment-free experience for everyone, regardless of age, body
+size, visible or invisible disability, ethnicity, sex characteristics, gender
+identity and expression, level of experience, education, socio-economic status,
+nationality, personal appearance, race, caste, color, religion, or sexual
+identity and orientation.
+
+We pledge to act and interact in ways that contribute to an open, welcoming,
+diverse, inclusive, and healthy community.
+
+## Our Standards
+
+Examples of behavior that contributes to a positive environment for our
+community include:
+
+* Demonstrating empathy and kindness toward other people
+* Being respectful of differing opinions, viewpoints, and experiences
+* Giving and gracefully accepting constructive feedback
+* Accepting responsibility and apologizing to those affected by our mistakes,
+  and learning from the experience
+* Focusing on what is best not just for us as individuals, but for the overall
+  community
+
+Examples of unacceptable behavior include:
+
+* The use of sexualized language or imagery, and sexual attention or advances of
+  any kind
+* Trolling, insulting or derogatory comments, and personal or political attacks
+* Public or private harassment
+* Publishing others' private information, such as a physical or email address,
+  without their explicit permission
+* Other conduct which could reasonably be considered inappropriate in a
+  professional setting
+
+## Enforcement Responsibilities
+
+Community leaders are responsible for clarifying and enforcing our standards of
+acceptable behavior and will take appropriate and fair corrective action in
+response to any behavior that they deem inappropriate, threatening, offensive,
+or harmful.
+
+Community leaders have the right and responsibility to remove, edit, or reject
+comments, commits, code, wiki edits, issues, and other contributions that are
+not aligned to this Code of Conduct, and will communicate reasons for moderation
+decisions when appropriate.
+
+## Scope
+
+This Code of Conduct applies within all community spaces, and also applies when
+an individual is officially representing the community in public spaces.
+Examples of representing our community include using an official email address,
+posting via an official social media account, or acting as an appointed
+representative at an online or offline event.
+
+## Enforcement
+
+Instances of abusive, harassing, or otherwise unacceptable behavior may be
+reported to the community leaders responsible for enforcement at
+[INSERT CONTACT METHOD].
+All complaints will be reviewed and investigated promptly and fairly.
+
+All community leaders are obligated to respect the privacy and security of the
+reporter of any incident.
+
+## Enforcement Guidelines
+
+Community leaders will follow these Community Impact Guidelines in determining
+the consequences for any action they deem in violation of this Code of Conduct:
+
+### 1. Correction
+
+**Community Impact**: Use of inappropriate language or other behavior deemed
+unprofessional or unwelcome in the community.
+
+**Consequence**: A private, written warning from community leaders, providing
+clarity around the nature of the violation and an explanation of why the
+behavior was inappropriate. A public apology may be requested.
+
+### 2. Warning
+
+**Community Impact**: A violation through a single incident or series of
+actions.
+
+**Consequence**: A warning with consequences for continued behavior. No
+interaction with the people involved, including unsolicited interaction with
+those enforcing the Code of Conduct, for a specified period of time. This
+includes avoiding interactions in community spaces as well as external channels
+like social media. Violating these terms may lead to a temporary or permanent
+ban.
+
+### 3. Temporary Ban
+
+**Community Impact**: A serious violation of community standards, including
+sustained inappropriate behavior.
+
+**Consequence**: A temporary ban from any sort of interaction or public
+communication with the community for a specified period of time. No public or
+private interaction with the people involved, including unsolicited interaction
+with those enforcing the Code of Conduct, is allowed during this period.
+Violating these terms may lead to a permanent ban.
+
+### 4. Permanent Ban
+
+**Community Impact**: Demonstrating a pattern of violation of community
+standards, including sustained inappropriate behavior, harassment of an
+individual, or aggression toward or disparagement of classes of individuals.
+
+**Consequence**: A permanent ban from any sort of public interaction within the
+community.
+
+## Attribution
+
+This Code of Conduct is adapted from the [Contributor Covenant][homepage],
+version 2.1, available at
+[https://www.contributor-covenant.org/version/2/1/code_of_conduct.html][v2.1].
+
+Community Impact Guidelines were inspired by
+[Mozilla's code of conduct enforcement ladder][Mozilla CoC].
+
+For answers to common questions about this code of conduct, see the FAQ at
+[https://www.contributor-covenant.org/faq][FAQ]. Translations are available at
+[https://www.contributor-covenant.org/translations][translations].
+
+[homepage]: https://www.contributor-covenant.org
+[v2.1]: https://www.contributor-covenant.org/version/2/1/code_of_conduct.html
+[Mozilla CoC]: https://github.com/mozilla/diversity
+[FAQ]: https://www.contributor-covenant.org/faq
+[translations]: https://www.contributor-covenant.org/translations

data/LICENSE.txt

@@ -0,0 +1,21 @@
+The MIT License (MIT)
+
+Copyright (c) 2025 Amit Leshed
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in
+all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+THE SOFTWARE.

data/README.md

@@ -0,0 +1,72 @@
+# Algoruby
+
+Algoruby is a Ruby gem providing ready-to-use, production-friendly algorithmic patterns, including classics like Two Sum, K-Sum, Sliding Window, Binary Search, and more — all wrapped in clean Ruby interfaces.
+run `bin/console` to experiment.
+
+Features
+
+    * Array & Hashing Patterns: Two Sum, Two Sum Closest, Group Anagrams.
+
+    * Sliding Window: Rolling sums, maximums, substring problems.
+
+    * Binary Search: Works with numbers, strings, times, and custom objects.
+
+    * Dynamic Programming: Maximum Subarray (Kadane's Algorithm).
+
+    * Generalized Solutions: K-Sum, Exclude Aggregator, and more.
+
+## Installation
+
+TODO: Replace `UPDATE_WITH_YOUR_GEM_NAME_IMMEDIATELY_AFTER_RELEASE_TO_RUBYGEMS_ORG` with your gem name right after releasing it to RubyGems.org. Please do not do it earlier due to security reasons. Alternatively, replace this section with instructions to install your gem from git if you don't plan to release to RubyGems.org.
+
+Install the gem and add to the application's Gemfile by executing:
+
+```bash
+bundle add UPDATE_WITH_YOUR_GEM_NAME_IMMEDIATELY_AFTER_RELEASE_TO_RUBYGEMS_ORG
+```
+
+If bundler is not being used to manage dependencies, install the gem by executing:
+
+```bash
+gem install UPDATE_WITH_YOUR_GEM_NAME_IMMEDIATELY_AFTER_RELEASE_TO_RUBYGEMS_ORG
+```
+
+## Usage
+
+```bash
+require "algoruby"
+```
+
+Examples:
+
+```bash
+Algoruby::GroupAnagrams.call(["bebop", "bobep", "pebop", "epbop", "opbeb", "peobe"])
+#=> [["bebop", "bobep", "opbeb"], ["pebop", "epbop"], ["peobe"]]
+
+Algoruby::BinarySearch.call(["Trane", "Bird", "Dizz", "Bud", "Monk" ], "Dizz")
+#=> 2
+
+Algoruby::SlidingWindow.each_window([1, 2, 3, 4, 5], 3)
+#=> [[1, 2, 3], [2, 3, 4], [3, 4, 5]]
+
+Algoruby::SlidingWindow.aggregate([1, 2, 3, 4, 5], 3) { |w| w.sum }
+#=> [6, 9, 12]
+```
+
+## Development
+
+After checking out the repo, run `bin/setup` to install dependencies. Then, run `rake test` to run the tests. You can also run `bin/console` for an interactive prompt that will allow you to experiment.
+
+To install this gem onto your local machine, run `bundle exec rake install`. To release a new version, update the version number in `version.rb`, and then run `bundle exec rake release`, which will create a git tag for the version, push git commits and the created tag, and push the `.gem` file to [rubygems.org](https://rubygems.org).
+
+## Contributing
+
+Bug reports and pull requests are welcome on GitHub at https://github.com/amitleshed/algoruby. This project is intended to be a safe, welcoming space for collaboration, and contributors are expected to adhere to the [code of conduct](https://github.com/amitleshed/algoruby/blob/main/CODE_OF_CONDUCT.md).
+
+## License
+
+The gem is available as open source under the terms of the [MIT License](https://opensource.org/licenses/MIT).
+
+## Code of Conduct
+
+Everyone interacting in the Algoruby project's codebases, issue trackers, chat rooms and mailing lists is expected to follow the [code of conduct](https://github.com/[USERNAME]/algoruby/blob/main/CODE_OF_CONDUCT.md).

data/Rakefile

@@ -0,0 +1,8 @@
+# frozen_string_literal: true
+
+require "bundler/gem_tasks"
+require "minitest/test_task"
+
+Minitest::TestTask.create
+
+task default: :test

data/lib/algoruby/binary_search/binary_search.rb

@@ -0,0 +1,21 @@
+module Algoruby
+  class BinarySearch
+    def self.call(array, target)
+      left, right = 0, array.size - 1
+
+      while left <= right
+        mid = (left + right) / 2
+        
+        if array[mid] == target
+          return mid
+        elsif array[mid] < target
+          left = mid + 1
+        else
+          right = mid - 1
+        end
+      end
+
+      nil
+    end
+  end
+end

data/lib/algoruby/exclude_aggregator/exclude_aggregator.rb

@@ -0,0 +1,29 @@
+module Algoruby
+  class ExcludeAggregator
+    # @param array [Array<Numeric>] the array of elements
+    # @param neutral [Numeric] the identity element for the operation
+    #        (e.g., 1 for product, 0 for sum)
+    # @yield [acc, value] the aggregation block
+    
+    def self.call(array, neutral:, &block)
+      n = array.length
+      result = Array.new(n, neutral)
+
+      # Prefix aggregation
+      prefix = neutral
+      (0...n).each do |i|
+        result[i] = prefix
+        prefix = block.call(prefix, array[i])
+      end
+
+      # Suffix aggregation
+      suffix = neutral
+      (n-1).downto(0).each do |i|
+        result[i] = block.call(result[i], suffix)
+        suffix = block.call(suffix, array[i])
+      end
+
+      result
+    end
+  end
+end

data/lib/algoruby/group_anagrams/group_anagrams.rb

@@ -0,0 +1,14 @@
+module Algoruby
+  class GroupAnagrams
+    def self.call(strs)
+      groups = Hash.new { |h, k| h[k] = [] }
+      
+      strs.each do |word|
+        key = word.chars.sort.join
+        groups[key] << word
+      end
+
+      groups.values
+    end
+  end
+end

data/lib/algoruby/has_duplicate/has_duplicate.rb

@@ -0,0 +1,21 @@
+require 'set'
+
+module Algoruby
+  class HasDuplicate
+    # Checks if an array has any duplicates
+    #
+    # @param array [Array<Object>] any array (numbers, strings, etc.)
+    # @return [Boolean]
+
+    def self.call(array)
+      seen = Set.new
+
+      array.each do |item|
+        return true if seen.include?(item)
+        seen.add(item)
+      end
+
+      false
+    end
+  end
+end

data/lib/algoruby/ksum/ksum.rb

@@ -0,0 +1,43 @@
+module Algoruby
+  class KSum
+    def self.call(nums, target, k)
+      nums.sort!
+      k_sum(nums, target, k, 0)
+    end
+
+    private
+
+    def self.k_sum(nums, target, k, start)
+      result = []
+
+      # Base case: 2Sum
+      if k == 2
+        left, right = start, nums.length - 1
+        while left < right
+          sum = nums[left] + nums[right]
+          if sum == target
+            result << [nums[left], nums[right]]
+            left += 1
+            right -= 1
+            left += 1 while left < right && nums[left] == nums[left - 1]
+            right -= 1 while left < right && nums[right] == nums[right + 1]
+          elsif sum < target
+            left += 1
+          else
+            right -= 1
+          end
+        end
+        return result
+      end
+
+      # Recursive case: k > 2
+      (start..nums.length - k).each do |i|
+        next if i > start && nums[i] == nums[i - 1]
+        sub_results = k_sum(nums, target - nums[i], k - 1, i + 1)
+        sub_results.each { |sr| result << [nums[i]] + sr }
+      end
+
+      result
+    end
+  end
+end

data/lib/algoruby/max_subarray/max_subarray.rb

@@ -0,0 +1,14 @@
+module Algoruby
+  class MaximumSubarray
+    def self.call(nums)
+      current_sum = max_sum = nums.first
+
+      nums[1..-1].each do |num|
+        current_sum = [num, current_sum + num].max
+        max_sum = [max_sum, current_sum].max
+      end
+
+      max_sum
+    end
+  end
+end

data/lib/algoruby/sliding_window/sliding_window.rb

@@ -0,0 +1,40 @@
+module Algoruby
+  class SlidingWindow
+    # Returns every contiguous window of size k
+    #
+    # @param array [Array] the array to iterate
+    # @param k [Integer] size of the window
+    # @return [Array<Array>] all windows
+    def self.each_window(array, k)
+      return [] if k > array.size || k <= 0
+
+      result = []
+      (0..array.size - k).each do |i|
+        window = array[i, k]
+        if block_given?
+          yield window
+        else
+          result << window
+        end
+      end
+
+      result unless block_given?
+    end
+
+    # Computes an aggregate across all windows
+    #
+    # @param array [Array]
+    # @param k [Integer]
+    # @yield [window] block to compute value for each window
+    # @return [Array] results for all windows
+    def self.aggregate(array, k)
+      results = []
+      
+      each_window(array, k) do |window|
+        results << yield(window)
+      end
+
+      results
+    end
+  end
+end

data/lib/algoruby/two_sum/two_sum.rb

@@ -0,0 +1,15 @@
+module Algoruby
+  class TwoSum
+    def self.call(nums, target)
+      hash = {}
+
+      nums.each_with_index do |num, i|
+        complement = target - num
+        return [hash[complement], i] if hash.key?(complement)
+        hash[num] = i
+      end
+      
+      nil
+    end
+  end
+end

data/lib/algoruby/two_sum/two_sum_closest.rb

@@ -0,0 +1,38 @@
+module Algoruby
+  class TwoSumClosest
+    # Finds two numbers whose sum is closest to the target
+
+    # @param nums [Array<Integer>] the input array
+    # @param target [Integer] the target sum
+    # @return [Array<Integer>] the pair of numbers closest to the target
+
+    def self.call(nums, target)
+      raise ArgumentError, "Array must have at least two elements" if nums.size < 2
+
+      nums.sort!
+      left, right = 0, nums.size - 1
+      closest_pair = [nums[left], nums[right]]
+      closest_diff = (nums[left] + nums[right] - target).abs
+
+      while left < right
+        current_sum = nums[left] + nums[right]
+        current_diff = (current_sum - target).abs
+
+        if current_diff < closest_diff
+          closest_diff = current_diff
+          closest_pair = [nums[left], nums[right]]
+        end
+
+        if current_sum < target
+          left += 1
+        elsif current_sum > target
+          right -= 1
+        else
+          return [nums[left], nums[right]]
+        end
+      end
+
+      closest_pair
+    end
+  end
+end

data/lib/algoruby/two_sum/two_sum_less_than.rb

@@ -0,0 +1,28 @@
+module Algoruby
+  class TwoSumLessThan
+    def self.call(nums, less_than)
+      return nil if nums.size < 2
+
+      nums.sort!
+      left, right = 0, nums.length - 1
+      max_sum = -Float::INFINITY
+      best_pair = nil
+
+      while left < right
+        sum = nums[left] + nums[right]
+
+        if sum < less_than
+          if sum > max_sum
+            max_sum = sum
+            best_pair = [nums[left], nums[right]]
+          end
+          left += 1
+        else
+          right -= 1
+        end
+      end
+
+      best_pair
+    end
+  end
+end

data/lib/algoruby/two_sum/two_sum_sorted.rb

@@ -0,0 +1,20 @@
+module Algoruby
+  class TwoSumSorted
+    def self.call(nums, target)
+      left, right = 0, nums.length - 1
+
+      while left < right
+        sum = nums[left] + nums[right]
+        if sum == target
+          return [nums[left], nums[right]]
+        elsif sum < target
+          left += 1
+        else
+          right -= 1
+        end
+      end
+
+      nil
+    end
+  end
+end

data/lib/algoruby/version.rb

@@ -0,0 +1,5 @@
+# frozen_string_literal: true
+
+module Algoruby
+  VERSION = "0.1.0"
+end

data/lib/algoruby.rb

@@ -0,0 +1,17 @@
+# frozen_string_literal: true
+
+require "algoruby/version"
+require "algoruby/ksum/ksum"
+require "algoruby/two_sum/two_sum"
+require "algoruby/two_sum/two_sum_closest"
+require "algoruby/two_sum/two_sum_less_than"
+require "algoruby/two_sum/two_sum_sorted"
+require "algoruby/has_duplicate/has_duplicate"
+require "algoruby/exclude_aggregator/exclude_aggregator"
+require "algoruby/max_subarray/max_subarray"
+require "algoruby/group_anagrams/group_anagrams"
+require "algoruby/sliding_window/sliding_window"
+require "algoruby/binary_search/binary_search"
+
+module Algoruby
+end

data/sig/algoruby.rbs

@@ -0,0 +1,4 @@
+module Algoruby
+  VERSION: String
+  # See the writing guide of rbs: https://github.com/ruby/rbs#guides
+end

metadata

@@ -0,0 +1,75 @@
+--- !ruby/object:Gem::Specification
+name: algoruby
+version: !ruby/object:Gem::Version
+  version: 0.1.0
+platform: ruby
+authors:
+- Amit Leshed
+autorequire:
+bindir: exe
+cert_chain: []
+date: 2025-07-22 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: debug
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+description: test
+email:
+- amitleshed@icloud.com
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- CODE_OF_CONDUCT.md
+- LICENSE.txt
+- README.md
+- Rakefile
+- lib/algoruby.rb
+- lib/algoruby/binary_search/binary_search.rb
+- lib/algoruby/exclude_aggregator/exclude_aggregator.rb
+- lib/algoruby/group_anagrams/group_anagrams.rb
+- lib/algoruby/has_duplicate/has_duplicate.rb
+- lib/algoruby/ksum/ksum.rb
+- lib/algoruby/max_subarray/max_subarray.rb
+- lib/algoruby/sliding_window/sliding_window.rb
+- lib/algoruby/two_sum/two_sum.rb
+- lib/algoruby/two_sum/two_sum_closest.rb
+- lib/algoruby/two_sum/two_sum_less_than.rb
+- lib/algoruby/two_sum/two_sum_sorted.rb
+- lib/algoruby/version.rb
+- sig/algoruby.rbs
+homepage:
+licenses:
+- MIT
+metadata: {}
+post_install_message:
+rdoc_options: []
+require_paths:
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: 3.2.0
+required_rubygems_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: '0'
+requirements: []
+rubygems_version: 3.4.1
+signing_key:
+specification_version: 4
+summary: test
+test_files: []