exercism-65 matching Brackets

Author: kumar91gopi

README.md

@@ -282,6 +282,7 @@ solution of many challenges of [Leetcode](https://leetcode.com/), [Exercism](htt
 62. [Nth Prime](https://github.com/kumar91gopi/Algorithms-and-Data-Structures-in-Ruby/blob/master/exercism/nth_prime.rb)
 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)
 
 <a name="leetcode"/>
 

exercism/matching_brackets.rb

@@ -0,0 +1,21 @@
+# Problem: https://exercism.org/tracks/ruby/exercises/matching-brackets
+
+# Solution
+class Brackets
+    BRACKETS = {
+                "(" => ")",
+                "{" => "}",
+                "[" => "]"
+              }
+    def self.paired?(input)
+      stack = []
+      input.chars.each do |char|
+        if BRACKETS.keys.include?(char)
+          stack.push(char) 
+        elsif BRACKETS.values.include?(char)
+          char == BRACKETS[stack[-1]] ? stack.pop : (return false)
+        end
+      end
+      stack.empty?
+    end
+end