• 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

Maximum occurred Smallest integer in n ranges

February 9, 2017 by Dhaval Dave

Maximum occurred integer in n ranges

Given n ranges in the form of Start Number and End Number in Two Array L and R such that
L[i]-R[i] is one range given. Our task is to find the maximum occurred smallest (first) integer in all the ranges. Means If more than one integer occurs max times, print the smallest one.
In other you can find similar code in 
Time Complexity: O(n + MAX) and Space Complexity : O(Max) 
We have tried to reduce complexity to O(n+m), space complexity : O(m) where m is largest integer in L or R 
means m is largest range number.

Maximum occurred integer in n range
Maximum occurred Smallest integer in n range

Simple Solution : 
To find Maximum occurred integer in N ranges, we can think  of One Hash where we can store all range values 
example if L[0]=4,R[0]=6, HMap[4] = 1, HMap[5] = 1, HMap[6] = 1
Traverse or iterate full hashmap and find smallest such number in N range. 
To create hashMap, u’ll iterate through all numbers so Time complexity increases to n*m.
Time Complexity : O(n*m) , Space Complexity : O(m)
where m is largest number in Ranges given.
But We can find Maximum occurred integer in N rage ( same answer)  with Different Logic Where Space Complexity remains same : O(m).
Logic is Explained for Maximum occurred integer : We create an array arr[] of size m  ( m is maximum value of all intervals given ) . The idea is to add +1 to each Li index and -1 to corresponding Ri index in arr[].
After this, find the prefix sum of the array. (prefix sum is adding all previous value to prefix array, which shows the occurance of any index in n ranges) 
Adding +1 at Li shows the starting point of ith Range and adding -1 shows the ending point of ith range. Finally we return the array index that has maximum prefix sum

Algorithm to solve the problem:

  1. Initialize an array prefix [] to 0.
  2. For each range i, add +1 at Li index and -1 at Ri of the array.
  3. Find the prefix sum of the array and find the smallest index having maximum prefix sum.
// code owner www.gohired.in
//C++ program to find maximum occured element in given N ranges.
#include <iostream>
#include <algorithm>
#include <cstring>
using namespace std;

// Return the maximum occurred element in all ranges.
int maximumOccuredSmallestElement(int L[], int R[], int n,int largest)
{
	// Initalising all element of array to 0.
	int prefixArray[largest];
	memset(prefixArray, 0, sizeof arr);

	for (int i = 0; i < n; i++)
	{
		prefixArray[L[i]] += 1;
		prefixArray[R[i] + 1] -= 1;
	}
	
	int msum = prefixArray[0], ind;
	for (int i = 1; i < largest; i++)
	{
		prefixArray[i] += prefixArray[i-1];
                //SEE this Array and understand how this code and Logic of prefix works
		cout <<"prefix ["<<i<<"] = "<<prefixArray[i]<<endl;
		if (msum < prefixArray[i])
		{
			msum = prefixArray[i];
			ind = i;
		}
	}
	return ind;
}
// Driven Program
int main()
{
	int L[] = { 1, 4, 9, 13, 21 };
	int R[] = { 15, 8, 12, 20, 30 };
	int largest=0;
	int n = sizeof(L)/sizeof(L[0]);
        for(int i=0;i<n;i++){
            largest = max(largest,max(L[i],R[i]));
        }
	cout << maximumOccuredSmallestElement(L, R, n, largest+1) << endl;
	return 0;
}

Similar Articles

Filed Under: Interview Questions, problem Tagged With: Array

Reader Interactions

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

Printing intermediate Integers between one element & next element of array

How Radix sort works

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

Max Sum in circularly situated Values

Maximum path sum between two leaves

Find if two rectangles overlap

LeetCode: Binary Tree Maximum Path Sum

Maximum sum contiguous subarray of an Array

Search element in a matrix with all rows and columns in sorted order

Find Pythagorean Triplets in an array in O(N)

The greedy coins game Dynamic Programming

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

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

Convert Decimal to Roman numbers / Romanizer HackerEarth Code

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

Microsoft BING Interview Experience

TicTacToe Game As Asked in Flipkart

Facebook Interview Question : Interleave List

flattens 2 D linked list to a single sorted link list

Singly linked list

Linked List V/S Binary Search Tree

Convert number to words java

Skiing on Mountains Matrix

Test Cases for Round Function

CodeChef’ RRCOPY

Maximum of all subarrays of size k

Urban Ladder Written Test.

Diagonal Traversal of Binary Tree

Naurki.com Security Breach

VMWare Openings

Copyright © 2023 · Genesis Framework · WordPress · Log in