Skip to content


Brackets Balanced Program

Balanced Parenthesis Program

We have an expression that contains brackets and alphanumeric characters, and we need to check whether the parenthesis are balanced or not. Balanced Parenthesis means an equal number of opening and closing brackets. Example Solution Approach – Using Stack Why Stack Data Structure? Here, our priority is to find if… Read More »Balanced Parenthesis Program

Check if two strings are Anagram

Anagram in Strings

Given, two strings and we need to check if those strings form an anagram. If you are wondering what’s an Anagram? When the characters of one word are obtained from rearranging the letters/characters of another word, they are called anagrams. Example Note: Important!, Anagrams can be a single word or… Read More »Anagram in Strings