• 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

Algorithm

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

Apriori algorithm C Code Data Mining

November 29, 2015 by Dhaval Dave

Apriori Algorithm  is an algorithm for data mining of frequent data set and association rule learning over transactional databases. It identifies the frequent individual items in the database for example, collections of items bought by … Read More

Filed Under: Algorithm, Data Mining, Interview Questions, problem Tagged With: c

  • « Previous Page
  • Page 1
  • Page 2

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

Reverse a Linked List in groups of given size

Adobe Interview Questions 8 month Exp

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

In Given LinkedList Divide LL in N Sub parts and delete first K nodes of each part

25 horses 5 tracks Find 3 fastest puzzle

Generate next palindrome number

Convert number to words java

flattens 2 D linked list to a single sorted link list

LeetCode: Container With Most Water

Mirror of Tree

Add Sub Multiply very large number stored as string

SAP Interview Questions

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

Given Set of words or A String find whether chain is possible from these words or not

Length of the longest substring without repeating characters

Amazon Interview Experience – SDE Chennai

Print Power Set of a Set

Sequence Finder Dynamic Programming

DFS (Depth First Search)

Flipkart SDET Interview Experience

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

Printing Longest Common Subsequence

Convert Decimal to Roman numbers / Romanizer HackerEarth Code

VMWare SDEII Interview

Find an index i such that Arr [i] = i in array of n distinct integers sorted in ascending order.

Code Chef PRGIFT Solution

Singly linked list

Sort an array according to the order defined by another array

Maximum path sum between two leaves

Client Server C program

Copyright © 2026 · Genesis Framework · WordPress · Log in