Valid Parentheses - Stack - C++ - Leetcode 20

preview_player
Показать описание
In this video, we are going to look at one of the most fundamental questions of Stack: Valid Parantheses.

Description: 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.

Applications of stack:
Stacks can be used to check for the balancing of paranthesis in an expression.
Redo-undo features at many places such as editors, photoshop, etc.
Forward and backward feature in web browsers.

In this video, you’ll also learn about asymptotic notations, they are basically mathematical notations which represent order of growth of any mathematical function. There are three famous notations which you’ll see in this video, they are big O , Theta , Omega.

Welcome to the first video Tutorial on Data Structures And Algorithms. In this video I am going to provide an Introduction to Data Structures And Algorithms. This Course is created to Explain the Fundamentals of data structures and algorithms. This video Will explain What is data?, What is data structure?, The Need for Data Structures, What is algorithm?

#DataStructures #Algorithms #DSandAlgo #ProgrammingKnowledge

★★★Top Online Courses From ProgrammingKnowledge ★★★

★★★ Online Courses to learn ★★★

★★★ Follow ★★★

DISCLAIMER: This video and description contains affiliate links, which means that if you click on one of the product links, I’ll receive a small commission. This help support the channel and allows us to continue to make videos like this. Thank you for the support!
Рекомендации по теме
Комментарии
Автор

do u factor in the possibility of the input being {([])} which is syntactically wrong from mathematical sense because the parenthesis is supposed to come after the square brackets which eventually come after the curly brackets?

tanhnguyen