• 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

FizzBuzz Solution C C++

HackeEarth Flipkart’s Drone

C++ OOPs Part1

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

Diagonal Traversal of Binary Tree

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

Right view of Binary tree

BlueStone E-commerce Interview Experience

Given a float number convert it into the string WITHOUT using any inbuilt Function

Printing intermediate Integers between one element & next element of array

Binary Tree in Java

Reverse a Linked List in groups of given size

Count Possible Decodings of a given Digit Sequence

VMWare SDEII Interview

The greedy coins game Dynamic Programming

Coin Collection Dynamic Programming

DFS (Depth First Search)

Find the element that appears once others appears thrice

Convert number to words java

Mirror of Tree

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

Find Pythagorean Triplets in an array in O(N)

How Radix sort works

Code Chef PRGIFT Solution

Python String and numbers

Get Minimum element in O(1) from input numbers or Stack

SAP Off Campus Hiring_ March 2015 Sample Questions

Knight Tour Problem (Graph – Breadth First Search)

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

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

Copyright © 2025 · Genesis Framework · WordPress · Log in