• 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

Google

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

LeetCode: Container With Most Water

October 29, 2019 by Arshdeep Singh

Given n non-negative integers a1, a2, …, an , where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the … Read More

Filed Under: Amazon Interview Question, Array, Facebook, Google, LeetCode Tagged With: Array, Two Pointer

LeetCode : Word Search

October 16, 2019 by Dhaval Dave

Word Search : Given a 2D board and a word, search if the word exists in the grid.
The word can be constructed from letters of sequentially adjacent cell,
where “adjacent” cells are those horizontally … Read More

Filed Under: Amazon Interview Question, Google, LeetCode Tagged With: 2d matrix, Array, DFS, Matrix, Recursion

Leetcode: Edit Distance

October 10, 2019 by Arshdeep Singh

Given two words word1 and word2, find the edit distance between word1 and word2 i.e. minimum number of operations required to convert word1 to word2.

You have the following 3 operations permitted on … Read More

Filed Under: Algorithm, Amazon Interview Question, Google, LeetCode, Uncategorized Tagged With: Dynamic Programming, Recursion, string

LeetCode: Binary Tree Maximum Path Sum

October 5, 2019 by Arshdeep Singh

Given a non-empty binary tree, find the maximum path sum.

For this problem, a path is defined as any sequence of nodes from some starting node to any node in the tree along the parent-child … Read More

Filed Under: Amazon Interview Question, Data Structure, Flipkart Interview Questions, Google, LeetCode, Microsoft Interview Questions Tagged With: Binary Tree, tree

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

Rectangular chocolate bar Create at least one piece which consists of exactly nTiles tiles

BlueStone E-commerce Interview Experience

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

BFS (Breath First Search)

Find if a binary tree is height balanced ?

Sequence Finder Dynamic Programming

TicTacToe Game As Asked in Flipkart

Number of Islands BFS/DFS

Find position of the only set bit

Python String and numbers

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

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

FizzBuzz Solution C C++

Sort an array according to the order defined by another array

Closed Parentheses checker

strtok()

Reliance Jio Software Developer Interview Experience

Memory Efficient LinkedList

Calculate price of parking from parking start end time prices

ADOBE Aptitude C Language Test

1014 Practice Question of New GRE – Princeton

Amazon Interview Experience – SDE Chennai

Reverse a Linked List in groups of given size

C++ OOPs Part1

write a c program that given a set a of n numbers and another number x determines whether or not there exist two elements in s whose sum is exactly x

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

Find two non repeating elements in an array of repeating elements

Serialise Deserialise N-ary Tree

VMWare SDEII Interview

Interfaces in C++ (Abstract Classes in C++)

Copyright © 2025 · Genesis Framework · WordPress · Log in