caius · February 14, 2018 11:34
diff --git a/ascending_subarray.rb b/ascending_subarray.rb
 # Given an input array, find the longest subarray within it (without sort) that contains numbers in ascending order
 input = [12, 4, 78, 90, 45, 23]

 out = input.length.downto(1) do |i|
  subarr = input.each_cons(i).find do |arr|
    arr.each_cons(2).map { |a, b| a < b }.uniq == [true]
  end
  break(subarr) if subarr
 end

 out # => [4, 78, 90]
	# Given an input array, find the longest subarray within it (without sort) that contains numbers in ascending order
	input = [12, 4, 78, 90, 45, 23]

	out = input.length.downto(1) do \|i\|
	subarr = input.each_cons(i).find do \|arr\|
	arr.each_cons(2).map { \|a, b\| a < b }.uniq == [true]
	end
	break(subarr) if subarr
	end

	out # => [4, 78, 90]