Stack

Problem Description Given a string expression, check if brackets present in the expression are balanced or not. Brackets are balanced if the bracket which opens last, closes first. You need to return true if it is balanced, false otherwise (Solve using given DATA STRUCTURE ONLY) Note: This problem was asked in initial rounds in Facebook Example Sample Input 1: { a + [ b+ (c + d)] + (e + f) }