• 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

Interview Questions

Leetcode: Merge Intervals

January 18, 2020 by Arshdeep Singh

Given a collection of intervals, merge all overlapping intervals.

Example 1:
Input: [[2,6],[8,10],[15,18], [1,3]]
Output: [ [1,6] , [8,10] , [15,18] ]
Explanation: Since intervals [1,3] and [2,6] overlaps, merge them into [1,6].

Example
Solution
… Read More

Filed Under: Amazon Interview Question, Flipkart Interview Questions, Google, Interview Questions, LeetCode Tagged With: Array, LeetCode, MergeIntervals

Diagonal Traversal of Binary Tree

February 23, 2018 by Dhaval Dave

Given a Binary Tree, print the diagonal traversal of the binary tree
Consider lines of slope -1 passing between nodes. Given a Binary Tree, print all diagonal elements in a binary tree belonging to same … Read More

Filed Under: Adobe Interview Questions, Amazon Interview Question, Interview Questions, Microsoft Interview Questions, Tree Tagged With: BFS, Binary Tree, tree

Coin Collection Dynamic Programming

February 4, 2018 by Dhaval Dave

Problem Statement:Coin Collection Dynamic Programming

Given a rectangular grid where each cell contains some coins. You are at the first row and you want to go to the last row with the objective of collecting … Read More

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

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

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

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

  • Page 1
  • Page 2
  • Page 3
  • …
  • Page 10
  • 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 Nearest Minimum number in left side in O(n)

C Program for TAIL command of UNIX

Client Server C program

FizzBuzz Solution C C++

Binary Tree Isomorphic to each other

Handle duplicates in Binary Search Tree

Count Possible Decodings of a given Digit Sequence

Trie Dictionary

Find next greater number with same set of digits

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

Circular Linked List

Difference between a LinkedList and a Binary Search Tree BST

DFS (Depth First Search)

Printing Longest Common Subsequence

Knight Tour Problem (Graph – Breadth First Search)

Test Cases for Round Function

LeetCode: Container With Most Water

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

Advanced SQL Injection

Maximum of all subarrays of size k

Password Predictor

Check a String is SUBSEQUENCE of another String Find Minimum length for that ( DNA Matching )

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

Longest Increasing Subsequence

Top 10 Interviews Techniqes for Campus Interview in IIT NIT BITS for MTech

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 ?

Convert number to words java

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

25 horses 5 tracks Find 3 fastest puzzle

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

Copyright © 2025 · Genesis Framework · WordPress · Log in