• 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

Arshdeep Singh

System Design: Designing a LLD for Hotel Booking

February 3, 2020 by Arshdeep Singh

Hotel Reservation system such as Oyo, Trivago, Hotels.com etc is a really big project, considering different aspects of System Design. The main challenges included in that is to design HLD of the whole system which … Read More

Filed Under: Uncategorized

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: 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

Amazon Interview On-Campus For Internship – 1

Trapping Rain Water

Number of Islands BFS/DFS

Reversal of LinkedList

SAP Off Campus Hiring_ March 2015 Sample Questions

Implement LRU Cache

Binary Tree in Java

Connect n ropes with minimum cost

Maximum size of square sub matrix with all 1’s in a binary matrix

‘N’ Story Building, with 1,2,3 steps how many ways can a person reach top of building.

Binary Tree in Java

Cisco Hiring Event 21st – 22nd Feb 2015

Python Dictionaries

Longest Increasing Subsequence

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

Sort Stack in place

Possible sizes of bus to carry n groups of friends

Password Predictor

Handle duplicates in Binary Search Tree

Printing Longest Common Subsequence

SAP Off Campus Hiring_ March 2015 Computer Skills

ADOBE Aptitude C Language Test

Generate next palindrome number

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

Daughter’s Age VeryGood Puzzle

1014 Practice Question of New GRE – Princeton

Implement a generic binary search algorithm for Integer Double String etc

Fibonacci Hashing & Fastest Hashtable

Check if an array has duplicate numbers in O(n) time and O(1) space

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

Copyright © 2025 · Genesis Framework · WordPress · Log in