• 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

Dhaval Dave

Sequence Finder Dynamic Programming

January 28, 2018 by Dhaval Dave

Sequence Finder

Given two arrays A and B of equal size, you have to determine whether the following the sequence is possible or not.

… Read More

Filed Under: Algorithm, Array, Interview Questions, Uncategorized Tagged With: Array, Dynamic Programming

Subset Sum Problem Dynamic programming

January 23, 2018 by Dhaval Dave

Example

Problem Statement of Subset Sum Dynamic Programming

Given a set T containing a list of integers and a sum S, does a subset of T exists whose sum is equal to S.

NOTE – Subset … Read More

Filed Under: Adobe Interview Questions, Algorithm, Amazon Interview Question, Array, Data Structure, Flipkart Interview Questions, Interview Questions Tagged With: Array, Dynamic Programming

Generate largest number arranging a no. of given non negative integer numbers

January 16, 2018 by Dhaval Dave

Problem : Generate largest number –

Given a list of non negative integers, arrange them in such a manner that they form the largest number possible. The result is going to be very large, hence … Read More

Filed Under: Amazon Interview Question

Stickler thief

December 28, 2017 by Dhaval Dave

Stickler thief and wants to loot money from a society of n houses placed in a line. He is a weird person and follows a rule while looting the houses and according to the rule … Read More

Filed Under: Uncategorized

Introduction To Number Theory ( Part 1 )

December 27, 2017 by Dhaval Dave

Number Theory is used a lot for solving real world problems and for the same reason It’s asked most of the time in interviews. This article marks the beginning of series of articles over Number … Read More

Filed Under: Algorithm, Amazon Interview Question, Flipkart Interview Questions, Interview Questions, Microsoft Interview Questions Tagged With: Euclid's Algorithm, Modular Exponentiation, Number Theory

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

  • « Previous Page
  • Page 1
  • Page 2
  • Page 3
  • Page 4
  • …
  • Page 17
  • 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

Find loop in Singly linked list

The Magic HackerEarth Nirvana solutions Hiring Challenge

Reversal of LinkedList

DFS (Depth First Search)

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 ?

Print Power Set of a Set

How Radix sort works

Fibonacci Hashing & Fastest Hashtable

The greedy coins game Dynamic Programming

Implement a generic binary search algorithm for Integer Double String etc

Reverse a Linked List in groups of given size

Wrong Directions given find minimum moves so that he can reach to the destination

Templates in C++

Minimum insertions to form a palindrome

Doubly linked list

Given a string, find the first character which is non-repetitive

Linked List V/S Binary Search Tree

Binary Tree in Java

Flipkart Set 1 On Campus with Answers

Binary Tree in Java

Python Dictionaries

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

VMWare SDEII Interview

Find position of the only set bit

Serialise Deserialise N-ary Tree

flattens 2 D linked list to a single sorted link list

Best Java Book | Top Java Programming Book for Beginners

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

Test Cases for Round Function

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

Copyright © 2026 · Genesis Framework · WordPress · Log in