# Balanced Brackets

### Problem Statement :

```A bracket is considered to be any one of the following characters: (, ), {, }, [, or ].

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 ().

A matching pair of brackets is not balanced if the set of brackets it encloses are not matched. For example, {[(])} is not balanced because the contents in between { and } are not balanced. The pair of square brackets encloses a single, unbalanced opening bracket, (, and the pair of parentheses encloses a single, unbalanced closing square bracket, ].

By this logic, we say a sequence of brackets is balanced if the following conditions are met:

It contains no unmatched brackets.
The subset of brackets enclosed within the confines of a matched pair of brackets is also a matched pair of brackets.

Given n strings of brackets, determine whether each sequence of brackets is balanced. If a string is balanced, return YES. Otherwise, return NO.

Function Description

Complete the function isBalanced in the editor below. It must return a string: YES if the sequence is balanced or NO if it is not.

isBalanced has the following parameter(s):

s: a string of brackets

Input Format

The first line contains a single integer n, the number of strings.
Each of the next n lines contains a single string s, a sequence of brackets.

Output Format

For each string, return YES or NO.```

### Solution :

```                            ```Solution in C :

In C ++ :

#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include<stack>
using namespace std;
#include<map>

int main() {
map<char,char>lol;
lol[')']='(';
lol[']']='[';
lol['}']='{';
int t;
cin >> t;
while(t--)
{
string s;
stack<char>st;
cin >> s;
int flag=0;
for(int i=0;s[i]!='\0';i++)
{
if(s[i]=='(' || s[i]=='{' || s[i]=='[')
st.push(s[i]);
else{
if(!st.empty() and lol[s[i]]==st.top())
st.pop();
else
{
flag=1;
break;
}
}
}

if(!flag and st.empty())
cout << "YES" << endl;
else
cout << "NO " << endl;
}
return 0;
}

In Java :

import java.io.*;
import java.util.*;

public class Solution {

public static void main(String[] args) {

Scanner sc = new Scanner(System.in);
try{
int numTest = Integer.parseInt(sc.nextLine());
for(int i = 0; i < numTest; i++){

if(isBalanced(sc.nextLine())){
System.out.println("YES");
} else {
System.out.println("NO");
}
}
} catch(Exception e){
System.out.println("Invalid Input");
}
}
public static boolean isBalanced(String s){
if(s == null || s.length() % 2 != 0) return false;
Stack<Character> stack = new Stack<Character>();
for(int i = 0; i < s.length(); i++){
char c = s.charAt(i);
if(c == '(' || c == '{' || c == '['){
stack.push(c);
} else if(c == ')' || c == '}' || c == ']'){
if(!stack.isEmpty()){
char latestOpenP = stack.pop();
if(latestOpenP == '(' && c != ')'){
return false;
} else if(latestOpenP == '{' && c != '}'){
return false;
} else if(latestOpenP == '[' && c != ']'){
return false;
}
} else {
return false;
}
}
}

return stack.isEmpty();
}
}

In C :

#include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>
int same(char a,char b)
{
if(a=='['&& b==']')
return 1;
if(a=='{'&& b=='}')
return 1;
if(a=='('&& b==')')
return 1;
return 0;
}
int check(char *a)
{
char stack[1001],top=-1;
for(int j=0;j<strlen(a);j++)
{
if(a[j]=='['||a[j]=='{'||a[j]=='(')
stack[++top]=a[j];
if(a[j]==']'||a[j]=='}'||a[j]==')')
{
if(top==-1)
{
return 0;
}
else
{
if(!same(stack[top--],a[j]))
{
return 0;
}
}
}
}
if(top!=-1)
{
return 0;
}
return 1;
}
int main() {
char a[1001];
int n,valid;
scanf("%d",&n);
for(int i=0;i<n;i++)
{
scanf("%s",a);
valid = check(a);
if(valid==1)
printf("YES\n");
else
printf("NO\n");
}
return 0;
}

In Python3 :

#! /usr/bin/python3

def check():
stack = []
s = input()
for c in s:
#print(c)
if c == '(':
stack.append(0);
elif c == ')':
if len(stack) > 0 and stack[-1] == 0:
stack.pop()
else:
return -1
elif c == '[':
stack.append(2)
elif c == ']':
if len(stack) > 0 and stack[-1] == 2:
stack.pop()
else:
return -1
if c == '{':
stack.append(4)
elif c == '}':
if len(stack) > 0 and stack[-1] == 4:
stack.pop()
else:
return -1

if len(stack) == 0:
return 0
else:
return -1

def solve():
t = int(input())
for i in range(0,t):
if check() == 0:
print("YES")
else:
print("NO")
solve()```
```

## Inserting a Node Into a Sorted Doubly Linked List

Given a reference to the head of a doubly-linked list and an integer ,data , create a new DoublyLinkedListNode object having data value data and insert it at the proper location to maintain the sort. Example head refers to the list 1 <-> 2 <-> 4 - > NULL. data = 3 Return a reference to the new list: 1 <-> 2 <-> 4 - > NULL , Function Description Complete the sortedInsert function

## Reverse a doubly linked list

This challenge is part of a tutorial track by MyCodeSchool Given the pointer to the head node of a doubly linked list, reverse the order of the nodes in place. That is, change the next and prev pointers of the nodes so that the direction of the list is reversed. Return a reference to the head node of the reversed list. Note: The head node might be NULL to indicate that the list is empty.

## Tree: Preorder Traversal

Complete the preorder function in the editor below, which has 1 parameter: a pointer to the root of a binary tree. It must print the values in the tree's preorder traversal as a single line of space-separated values. Input Format Our test code passes the root node of a binary tree to the preOrder function. Constraints 1 <= Nodes in the tree <= 500 Output Format Print the tree's

## Tree: Postorder Traversal

Complete the postorder function in the editor below. It received 1 parameter: a pointer to the root of a binary tree. It must print the values in the tree's postorder traversal as a single line of space-separated values. Input Format Our test code passes the root node of a binary tree to the postorder function. Constraints 1 <= Nodes in the tree <= 500 Output Format Print the

## Tree: Inorder Traversal

In this challenge, you are required to implement inorder traversal of a tree. Complete the inorder function in your editor below, which has 1 parameter: a pointer to the root of a binary tree. It must print the values in the tree's inorder traversal as a single line of space-separated values. Input Format Our hidden tester code passes the root node of a binary tree to your \$inOrder* func

## Tree: Height of a Binary Tree

The height of a binary tree is the number of edges between the tree's root and its furthest leaf. For example, the following binary tree is of height : image Function Description Complete the getHeight or height function in the editor. It must return the height of a binary tree as an integer. getHeight or height has the following parameter(s): root: a reference to the root of a binary