Maximum Subarray in Ruby

Published on 14 May 2026 (Updated: 14 May 2026)

Welcome to the Maximum Subarray in Ruby page! Here, you'll find the source code for this program as well as a description of how the program works.

Current Solution

# frozen_string_literal: true

USAGE = 'Usage: Please provide a list of integers in the format: "1, 2, 3, 4, 5"'

def usage!
  warn USAGE
  exit 1
end

def parse_list(str)
  str.split(",").map { Integer(it.strip) }
rescue ArgumentError, NoMethodError
  usage!
end

def max_subarray_sum(arr)
  return arr.first if arr.length == 1
  return arr.sum if arr.none?(&:negative?)

  current = max = arr.first

  arr[1..].each do |x|
    current = [x, current + x].max
    max = [max, current].max
  end

  max
end

raw = ARGV.first
usage! if raw.nil? || raw.strip.empty?

arr = parse_list(raw)
usage! if arr.length < 1

puts max_subarray_sum(arr)

Maximum Subarray in Ruby was written by:

If you see anything you'd like to change or update, please consider contributing.

How to Implement the Solution

No 'How to Implement the Solution' section available. Please consider contributing.

How to Run the Solution

No 'How to Run the Solution' section available. Please consider contributing.