A bracket is considered to be any one of the following characters: (, ), {, }, [, or ]. The coding problem is defined in Hacker Rank platform. The problem can expand your Data Structure knowledge, as well as can helps you to crack Interviews. Two brackets are considered to be a matched pair if the an opening bracket (i.e., (, [, or {) occurs to the left of a closing bracket (i.e., ), ], or }) of the exact same type. There are three types of matched pairs of brackets: [], {}, and (). If the set of brackets it encloses are not matched, then a matching pair of brackets is not balanced. For example, {[(])} is not balanced because…