• 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

LeetCode

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

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

Puzzle : 100 doors in a row Visit and Toggle the door. What state the door will be after nth pass ?

Printing Longest Common Subsequence

Spanning Tree

Find two non repeating elements in an array of repeating elements

1014 Practice Question of New GRE – Princeton

Client Server C program

LeetCode: Container With Most Water

Convert number to words java

Find min element in Sorted Rotated Array (With Duplicates)

Given a string, find the first character which is non-repetitive

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

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

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

Regular Expression Matching

Given array of 0’s and 1’s. All 0’s are coming first followed by 1’s. find the position of first 1

Sort Stack in place

Level order traversal in Spiral form

Find the element that appears once others appears thrice

Urban Ladder Written Test.

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

Trie Dictionary

Max Sum in circularly situated Values

Binary Tree in Java

Reliance Jio Software Developer Interview Experience

Find an index i such that Arr [i] = i in array of n distinct integers sorted in ascending order.

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

Implement a generic binary search algorithm for Integer Double String etc

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

LeetCode: Binary Tree Maximum Path Sum

BlueStone E-commerce Interview Experience

Copyright © 2026 · Genesis Framework · WordPress · Log in