Problem Given a string validate if it is well formed.

Given a string of round, curly, and square open and closing brackets, return whether the brackets are balanced (well-formed). For example, given the string "([])", you should return true. Given the string "([)]" or "((()", you should return false.

Package wellFormedString

A basic runner for debug. A class to hold the the tags that were created A class that iterates through the string, makes decisions and stores values.

Uses a LinkedList and appends the last value - if a closing bracket is found then it sees if the last elemtns inthe LinkedList can be removed. This has test cases additionally - 17 test cases - pretty thorough.