• 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

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

Fibonacci Hashing & Fastest Hashtable

July 31, 2018 by Dhaval Dave

Fibonacci Hashing : How do we find out what this Fibonacci Hashing is?
In real world Fibonacci hashing is not implemented or used even a part of it, because it’s actually more (Time and Space) … Read More

Filed Under: Algorithm, Data Structure, problem Tagged With: Hashing, Hashmap, Mathematical

Hackerearth : Counting Subarrays

July 7, 2018 by Dhaval Dave

Given an array A of N positive integer values. A sub-array of this array is called Odd-Even sub-array if the number of odd integers in this sub-array is equal to the number  of even integers … Read More

Filed Under: Algorithm, Array, Hacker Earth Questions Tagged With: Array, Hashing, implementation

Facebook Interview Question : Interleave List

May 14, 2018 by Dhaval Dave

Interleave List

Interleave List If input = [[1,2,3], [9, 0], [5], [-4,-5,-2,-3,-1]] then output = [1,9,5,-4,2,0,-5,3,-2,-3,-1];
Asked in Facebook F2F… Read More

Filed Under: Algorithm, Data Structure, Facebook Tagged With: 2d matrix, Array, Linked List

Serialise Deserialise N-ary Tree

April 19, 2018 by Dhaval Dave

Serialise Deserialise N-ary Tree : N-ary tree’s each node contains at-most N children. Serialise the tree means storing the tree in array or file maintaining tree’s exact structure. On the other hand Deserialise the tree … Read More

Filed Under: Uncategorized

  • Page 1
  • Page 2
  • Page 3
  • …
  • Page 18
  • 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

How Radix sort works

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

Amazon Interview On-Campus For Internship – 1

Binary Tree in Java

Find if two rectangles overlap

Common Ancestor in a Binary Tree or Binary Search Tree

robot standing at first cell of an M*N matrix. It can move only in two directions, right and down. In how many ways, it can reach to the last cell i.e. (M, N) Code it

Calculate price of parking from parking start end time prices

The Magic HackerEarth Nirvana solutions Hiring Challenge

Python Dictionaries

Maximum sum contiguous subarray of an Array

Print all nodes that are at distance k from a leaf node

Python Array String

SAP Off Campus Hiring_ March 2015 Analytical Aptitude

CodeChef’ RRCOPY

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

CodeChef Code SGARDEN

SAP Off Campus Hiring_ March 2015 Sample Questions

Sequence Finder Dynamic Programming

Convert number to words java

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

Test Cases for Round Function

25 horses 5 tracks Find 3 fastest puzzle

Reliance Jio Software Developer Interview Experience

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

Print Power Set of a Set

Circular Linked List

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

Find shortest distances between every pair of vertices ( Dynamic Programming Floyd Warshall Algorithm)

Copyright © 2026 · Genesis Framework · WordPress · Log in