• 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

Find min element in Sorted Rotated Array (With Duplicates)

flattens 2 D linked list to a single sorted link list

strtok()

Fibonacci Hashing & Fastest Hashtable

Find Nearest Minimum number in left side in O(n)

Adobe Interview Questions 8 month Exp

Python Array String

Trapping Rain Water

Daughter’s Age VeryGood Puzzle

How strtok() Works

Count number of ways to reach a given score in a game

Maximum difference between two elements s.t larger element appears after the smaller number

SAP Off Campus Hiring_ March 2015 Sample Questions

Client Server C program

Printing Longest Common Subsequence

Find position of the only set bit

Advanced SQL Injection

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

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

Amazon Interview On-Campus For Internship – 1

Mirror of Tree

Find next greater number with same set of digits

HackeEarth Flipkart’s Drone

Practo Hiring Experience

Connect n ropes with minimum cost

Reversal of LinkedList

Reliance Jio Software Developer Interview Experience

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

Handle duplicates in Binary Search Tree

The Magic HackerEarth Nirvana solutions Hiring Challenge

Copyright © 2025 · Genesis Framework · WordPress · Log in