Yatra.com

30+ posts

Similar Topics

DSA

20.6k+ articles

Experiences

11.6k+ articles

Interview Experiences

10.7k+ articles

3k+ articles

1.8k+ articles

220+ articles

210+ articles

150+ articles

110+ articles

90+ articles

C++ Program To Check For Balanced Brackets In An Expression (Well-Formedness) Using Stack

Last Updated: 17 August 2023

Given an expression string exp, write a program to examine whether the pairs and the orders of "{", "}", "(", ")", "[", "]" are correct in exp.Example: Input: exp = "[()]{...read more

C Program To Check For Balanced Brackets In An Expression (Well-Formedness) Using Stack

Last Updated: 20 April 2023

Given an expression string exp, write a program to examine whether the pairs and the orders of "{", "}", "(", ")", "[", "]" are correct in exp.Example:Input: exp = "[()]{}...read more

Java Program To Check For Balanced Brackets In An Expression (Well-Formedness) Using Stack

Last Updated: 14 December 2021

Given an expression string exp, write a program to examine whether the pairs and the orders of "{", "}", "(", ")", "[", "]" are correct in exp.Example: Input: exp = "[()]{...read more

Python Program To Check For Balanced Brackets In An Expression (Well-Formedness) Using Stack

Last Updated: 19 May 2022

Given an expression string exp, write a program to examine whether the pairs and the orders of "{", "}", "(", ")", "[", "]" are correct in exp.Example: Input: exp = "[()]{...read more

Python-Data-Structures

DSA

C# Program To Check For Balanced Brackets In An Expression (Well-Formedness) Using Stack

Last Updated: 15 December 2021

Given an expression string exp, write a program to examine whether the pairs and the orders of "{", "}", "(", ")", "[", "]" are correct in exp.Example: Input: exp = "[()]{...read more

Javascript Program To Check For Balanced Brackets In An Expression (Well-Formedness) Using Stack

Last Updated: 14 December 2021

Given an expression string exp, write a program to examine whether the pairs and the orders of "{", "}", "(", ")", "[", "]" are correct in exp.Example: Input: exp = "[()]{...read more

Minimum Number of Manipulations required to make two Strings Anagram Without Deletion of Character

Last Updated: 01 September 2023

Given two strings s1 and s2, we need to find the minimum number of manipulations required to make two strings anagram without deleting any character.Note:- The anagram str ...read more

Repeatedly search an element by doubling it after every successful search

Last Updated: 23 May 2022

Given an array "a[]" and integer "b". Find whether b is present in a[] or not. If present, then double the value of b and search again. We repeat these steps until b is no ...read more

Print all Subsequences of String which Start with Vowel and End with Consonant.

Last Updated: 23 August 2023

Given a string return all possible subsequences which start with a vowel and end with a consonant. A String is a subsequence of a given String, that is generated by deleti ...read more

Last Updated: 12 January 2023

We have discussed Backtracking and Knight's tour problem in Set 1. Let us discuss Rat in a Maze as another example problem that can be solved using Backtracking.A Maze is ...read more

Sort an array of 0s, 1s and 2s | Dutch National Flag problem

Last Updated: 03 August 2023

Given an array A[] consisting of only 0s, 1s, and 2s. The task is to write a function that sorts the given array. The functions should put all 0s first, then all 1s and al...read more

Check for Balanced Brackets in an expression (well-formedness)

Last Updated: 04 May 2023

Given an expression string exp, write a program to examine whether the pairs and the orders of "{", "}", "(", ")", "[", "]" are correct in the given expression.Example:Inp...read more

1 2 >>

1 2 >>

1 2 >>