• 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

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

Maximum sum contiguous subarray of an Array

December 25, 2017 by Dhaval Dave

Given an Array A with n integers both positive and negative, find the maximum sum contiguous subarray within A which has the largest sum

… Read More

Filed Under: Algorithm, Array, Interview Experience, Interview Questions, problem Tagged With: Array, Dynamic Programming, Kadane

Regular Expression Matching

December 22, 2017 by Dhaval Dave

You are given a string T which consists of 0’s and 1’s. Now you input two non-empty strings U and V. Then your task is to match the Regular Expression  – U*V with the given … Read More

Filed Under: Algorithm, Amazon Interview Question, Interview Questions Tagged With: implementation, kmp matching, string

Knight Tour Problem (Graph – Breadth First Search)

December 22, 2017 by Dhaval Dave

Knight Tour Problem : Given a chess board of size n x n, initial position of knight and final position of knight. We need to find the minimum number of steps required to reach final … Read More

Filed Under: Algorithm, Amazon Interview Question, Flipkart Interview Questions, Graph, Microsoft Interview Questions Tagged With: algorithm, BFS, Graph

Maximum size of square sub matrix with all 1’s in a binary matrix

December 12, 2017 by Dhaval Dave

Maximum size of square sub matrix with all 1

Consider a binary matrix as shown in the figure below. You need to find the maximum size of square sub matrix with all 1’s.

Sample problem
… Read More

Filed Under: Algorithm, Amazon Interview Question, Flipkart Interview Questions, Microsoft Interview Questions Tagged With: Dynamic Programming

Edit Distance ( Dynamic Programming )

December 6, 2017 by Dhaval Dave

Problem

Given two strings x and y, What is the cheapest possible way to convert x into y where following operations are allowed to perform –

  1. Substitute a character c of x with c’.
  2. Insert
… Read More

Filed Under: Algorithm, Amazon Interview Question, Flipkart Interview Questions, Interview Questions, Microsoft Interview Questions Tagged With: Dynamic Programming, string

Skiing on Mountains Matrix

June 9, 2017 by Dhaval Dave

Skiing on Mountains Matrix : “John Snow” likes Skiing on Mountains a lot.That’s not very surprising, since skiing is really great. The problem with skiing is one have to slide downwards to gain speed. Also … Read More

Filed Under: Interview Questions, problem Tagged With: 2d matrix, Dynamic Programming

Trapping Rain Water

May 25, 2017 by Dhaval Dave

trapping rain water

Trapping Rain Water or Water collected between towers : Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it is able to trap after … Read More

Filed Under: Amazon Interview Question, Hacker Earth Questions, Interview Questions, Uncategorized Tagged With: Array

The greedy coins game Dynamic Programming

April 24, 2017 by Dhaval Dave

The greedy coins game Dynamic Programming Solution :

Question statement There is a row of 2n coins on the table; each coin can have any positive integer value. Two players alternate turns.

On a player’s … Read More

Filed Under: Interview Questions, problem, Puzzle Tagged With: Dynamic Programming

Handle duplicates in Binary Search Tree

April 17, 2017 by Dhaval Dave

In a Binary Search Tree (BST), all keys in left subtree of a key must be smaller and all keys in right subtree must be greater. So a Binary Search Tree by definition has distinct … Read More

Filed Under: Amazon Interview Question, Flipkart Interview Questions, Hacker Earth Questions, Interview Questions, Microsoft Interview Questions, problem Tagged With: Binary Search Tree, Binary Tree

  • « Previous Page
  • Page 1
  • Page 2
  • Page 3
  • Page 4
  • Page 5
  • …
  • Page 18
  • Next Page »

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

Client Server C program

strtok()

CodeChef Code SGARDEN

Serialise Deserialise N-ary Tree

Python List

Printing each word reverse in string

Generic Object Oriented Stack with Template

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

Find two non repeating elements in an array of repeating elements

C Program for TAIL command of UNIX

LeetCode: Container With Most Water

C++ OOPs Part2

Subset Sum Problem Dynamic programming

Find position of the only set bit

Level order traversal in Spiral form

Convert Decimal to Roman numbers / Romanizer HackerEarth Code

Convert number to words java

Best Java Book | Top Java Programming Book for Beginners

1014 Practice Question of New GRE – Princeton

Templates in C++

Count Possible Decodings of a given Digit Sequence

How Radix sort works

Find and print longest consecutive number sequence in a given sequence in O(n)

ADOBE Aptitude C Language Test

Find Percentage of Words matching in Two Strings

Find min element in Sorted Rotated Array (With Duplicates)

Hackerearth : Counting Subarrays

Urban Ladder Written Test.

Given a sorted array and a number x, find the pair in array whose sum is closest to x

Binary Tree Isomorphic to each other

Copyright © 2023 · Genesis Framework · WordPress · Log in