• 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

Generic Object Oriented Stack with Template

Count Possible Decodings of a given Digit Sequence

Amazon Interview Experience – SDE Chennai

Possible sizes of bus to carry n groups of friends

The greedy coins game Dynamic Programming

Find Percentage of Words matching in Two Strings

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

Closed Parentheses checker

Coin Collection Dynamic Programming

Sort an array according to the order defined by another array

Trie Dictionary

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

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

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

Generate next palindrome number

Maximum path sum between two leaves

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

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

Memory Efficient LinkedList

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

Find the smallest window in a string containing all characters of another string

Common Ancestor in a Binary Tree or Binary Search Tree

Level order traversal in Spiral form

strtok()

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

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

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

Walmart Labs Interview Experience

BlueStone E-commerce Interview Experience

Practo Hiring Experience

Copyright © 2026 · Genesis Framework · WordPress · Log in