Balanced Brackets Sequel - Amazon Top Interview Questions


Problem Statement :


Given a string s containing round, curly, and square open and closing brackets, return whether the brackets are balanced.

Constraints

n ≤ 100,000 where n is the length of s

Example 1

Input

s = "[(])"

Output

False

Example 2

Input

s = "([])[]({})"

Output

True


Solution :



title-img 




                        Solution in C++ :

bool solve(string s) {
    stack<char> stack;

    for (char c : s) {
        if (c == '(' || c == '{' || c == '[')
            stack.push(c);
        else {
            if (stack.empty())
                return false;
            else if (c == ')' && stack.top() != '(')
                return false;
            else if (c == '}' && stack.top() != '{')
                return false;
            else if (c == ']' && stack.top() != '[')
                return false;
            else
                stack.pop();
        }
    }

    return stack.empty();
}
                    




                        Solution in Python : 
                            
class Solution:
    def solve(self, s):
        # The stack to keep track of opening brackets.
        stack = []

        # Hash map for keeping track of mappings. This keeps the code very clean.
        # Also makes adding more types of parenthesis easier
        mapping = {")": "(", "}": "{", "]": "["}

        for char in s:
            # if char is a closing bracket
            if char in mapping:
                # Pop the top most element else #, the top most element must be an opening bracket
                # of the same type
                top = stack.pop() if stack else "#"

                if mapping[char] != top:
                    return False
            else:
                stack.append(char)

        # if the stack is empty, we have a valid expression
        # the stack wont be empty for cases like (()
        return not stack


View More Similar Problems

Jesse and Cookies

Jesse loves cookies. He wants the sweetness of all his cookies to be greater than value K. To do this, Jesse repeatedly mixes two cookies with the least sweetness. He creates a special combined cookie with: sweetness Least sweet cookie 2nd least sweet cookie). He repeats this procedure until all the cookies in his collection have a sweetness > = K. You are given Jesse's cookies. Print t

View Solution →

Find the Running Median

The median of a set of integers is the midpoint value of the data set for which an equal number of integers are less than and greater than the value. To find the median, you must first sort your set of integers in non-decreasing order, then: If your set contains an odd number of elements, the median is the middle element of the sorted sample. In the sorted set { 1, 2, 3 } , 2 is the median.

View Solution →

Minimum Average Waiting Time

Tieu owns a pizza restaurant and he manages it in his own way. While in a normal restaurant, a customer is served by following the first-come, first-served rule, Tieu simply minimizes the average waiting time of his customers. So he gets to decide who is served first, regardless of how sooner or later a person comes. Different kinds of pizzas take different amounts of time to cook. Also, once h

View Solution →

Merging Communities

People connect with each other in a social network. A connection between Person I and Person J is represented as . When two persons belonging to different communities connect, the net effect is the merger of both communities which I and J belongs to. At the beginning, there are N people representing N communities. Suppose person 1 and 2 connected and later 2 and 3 connected, then ,1 , 2 and 3 w

View Solution →

Components in a graph

There are 2 * N nodes in an undirected graph, and a number of edges connecting some nodes. In each edge, the first value will be between 1 and N, inclusive. The second node will be between N + 1 and , 2 * N inclusive. Given a list of edges, determine the size of the smallest and largest connected components that have or more nodes. A node can have any number of connections. The highest node valu

View Solution →

Kundu and Tree

Kundu is true tree lover. Tree is a connected graph having N vertices and N-1 edges. Today when he got a tree, he colored each edge with one of either red(r) or black(b) color. He is interested in knowing how many triplets(a,b,c) of vertices are there , such that, there is atleast one edge having red color on all the three paths i.e. from vertex a to b, vertex b to c and vertex c to a . Note that

View Solution →