Algorithms: Matching Parenthesis Problem in Swift
Hey folks, Leo here. This is a classic algorithm problem and the solution is very straightforward. The problem: Given a string of parenthesis ‘(‘ and ‘)’, write a function that returns true if there are matching pairs and false if there are not. A matching pair means, there should be a closing parenthesis for an […]
