exercism-66 All your Base

Author: kumar91gopi

README.md

@@ -283,6 +283,7 @@ solution of many challenges of [Leetcode](https://leetcode.com/), [Exercism](htt
 63. [Perfect Numbers](https://github.com/kumar91gopi/Algorithms-and-Data-Structures-in-Ruby/blob/master/exercism/perfect_numbers.rb)
 64. [Binary Search](https://github.com/kumar91gopi/Algorithms-and-Data-Structures-in-Ruby/blob/master/exercism/binary_search.rb)
 65. [Matching Brackets](https://github.com/kumar91gopi/Algorithms-and-Data-Structures-in-Ruby/blob/master/exercism/matching_brackets.rb)
+66. [All Your Base](https://github.com/kumar91gopi/Algorithms-and-Data-Structures-in-Ruby/blob/master/exercism/all_your_base.rb)
 
 <a name="leetcode"/>
 

exercism/all_your_base.rb

@@ -0,0 +1,21 @@
+# Problem: https://exercism.org/tracks/ruby/exercises/all-your-base
+
+# Solution:
+class BaseConverter
+    def self.convert(input_base, digits, output_base)
+      raise ArgumentError if input_base<=1 or output_base<=1
+      return [0] if digits.empty?
+      num = 0
+      digits.reverse.each_with_index do |digit,idx|
+        raise ArgumentError if digit<0 or digit>=input_base
+        num+=(digit*(input_base**idx))
+      end
+      output = num==0 ? [0] : []
+      until num==0
+        num,remainder = num.divmod(output_base)
+        output.push(remainder)
+      end
+      output = output.reverse
+    end
+end
+