Working on this LeetCode problem. Probably a classic.
Given a string s containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.
An input string is valid if:
Open brackets must be closed by the same type of brackets.
Open brackets must be closed in the correct order.
Most solution work with a stack. That's new for me but seems a good solution. Is that also possbile with APL or should I think about a more APL'like solution? (whatever that might be, but I'll try to figure something out)