Algorithms Roadmap
Day 5: Strings (Easy)
Given two strings s and t, return true if t is an anagram of s, and false otherwise.
2. Valid Parentheses
Given a string s containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.
An input string is valid if:
a. Open brackets must be closed by the same type of brackets.
b. Open brackets must be closed in the correct order.
c. Every close bracket has a corresponding open bracket of the same type.
Day 5 - Strings (Easy)
Given two strings s and t, return true if t is an anagram of s, and false otherwise.
2. Valid Parentheses
Given a string s containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.
An input string is valid if:
a. Open brackets must be closed by the same type of brackets.
b. Open brackets must be closed in the correct order.
c. Every close bracket has a corresponding open bracket of the same type.
Sponsor Us|Community|Blog|Youtube
Have Feedback or want to contribute? Email: hello[@]100DaysOfCode.io
100DaysOfCode@2024