• Skip to primary navigation
  • Skip to content
  • Skip to primary sidebar
  • Skip to secondary sidebar

GoHired

Interview Questions asked in Google, Microsoft, Amazon

Join WeekEnd Online Batch from 4-April-2020 on How to Crack Coding Interview in Just 10 Weeks : Fees just 20,000 INR

  • Home
  • Best Java Books
  • Algorithm
  • Internship
  • Certificates
  • About Us
  • Contact Us
  • Privacy Policy
  • Array
  • Stack
  • Queue
  • LinkedList
  • DP
  • Strings
  • Tree
  • Mathametical
  • Puzzles
  • Graph

backtracking

Closed Parentheses checker

December 26, 2017 by Dhaval Dave

example explaining problem

‏Problem Statement:

You are given 3 types of parentheses (),{},[]. Now you are supposed to check whether a given string containing some parentheses is closed or not.

example depicting closed sequence… Read More

Filed Under: Amazon Interview Question, Interview Questions Tagged With: algorithm, backtracking

Primary Sidebar

Join WeekEnd Online/Offline Batch from 4-April-2020 on How to Crack Coding Interview in Just 10 Weeks : Fees just 20,000 INR

Join WeekEnd Online/Offline Batch from 4-April-2020

WhatsApp us

Secondary Sidebar

Custom Search

  • How I cracked AMAZON
  • LeetCode
  • Adobe
  • Amazon
  • Facebook
  • Microsoft
  • Hacker Earth
  • CSE Interview

Top Rated Questions

SAP Interview Questions

Practo Hiring Experience

K’th Largest Element in BST when modification to BST is not allowed

LeetCode: Container With Most Water

Amazon Interview On-Campus For Internship – 1

HackeEarth Flipkart’s Drone

Given array of 0’s and 1’s. All 0’s are coming first followed by 1’s. find the position of first 1

N teams are participating. each team plays twice with all other teams. Some of them will go to the semi final. Find Minimum and Maximum number of matches that a team has to win to qualify for finals ?

There are N nuts and N bolts, u have to find all the pairs of nuts and bolts in minimum no. of iteration

Binary Tree in Java

Sequence Finder Dynamic Programming

building with N steps, we can take 1,2,3 steps calculate number of ways to reach at top of building

Find the smallest window in a string containing all characters of another string

robot standing at first cell of an M*N matrix. It can move only in two directions, right and down. In how many ways, it can reach to the last cell i.e. (M, N) Code it

Client Server C program

Leetcode: Merge Intervals

Generate next palindrome number

Regular Expression Matching

Daughter’s Age VeryGood Puzzle

CodeChef’ RRCOPY

Leetcode: Edit Distance

Interfaces in C++ (Abstract Classes in C++)

Doubly linked list

SAP Hiring Off-Campus General Aptitude

Inorder and Preorder traversals of a Binary Tree given. Output the Postorder traversal of it.

Find Pythagorean Triplets in an array in O(N)

Print vertical sum of all the axis in the given binary tree

Flipkart Set 1 On Campus with Answers

Advanced SQL Injection

Find Percentage of Words matching in Two Strings

Copyright © 2026 · Genesis Framework · WordPress · Log in