Скачать или смотреть Valid parentheses - Essential algorithms

Valid parentheses is considered to be an easy problem but it is better to have a solid idea on how to solve it since it is very common on the interviews. We'll discuss common variations and solve two of them.

The problem description from Leetcode:
"Given a string 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."

0:00 Introduction
3:15 Variations
4:42 Step by step example (Valid)
8:05 Step by step example (Invalid)
9:15 Implementation with 3 bracket types
14:50 Complexity
15:33 Implementation with 1 bracket type