### Problem Statement :

```You are given a list of list of integers intervals where each element contains the inclusive interval [start, end].

Return the most frequently occurring number in the intervals. If there are ties, return the smallest number.

Constraints

n ≤ 100,000 where n is the length of intervals

Example 1

Input

intervals = [

[1, 4],

[3, 5],

[6, 9],

[7, 9]

]

Output

3

Explanation

The most frequent numbers are [3, 4, 7, 8, 9] and they all occur twice but 3 is the smallest one.```

### Solution :

```                        ```Solution in C++ :

int solve(vector<vector<int>>& intervals) {
map<int, int> counts;
for (const auto& i : intervals) {
counts[i]++;
counts[i + 1]--;
}

int level = 0;
int max_level = 0;
int ans = 0;

for (const auto& p : counts) {
level += p.second;
if (level > max_level) {
max_level = level;
ans = p.first;
}
}

return ans;
}```
```

```                        ```Solution in Java :

import java.util.*;

class Solution {
private class Node {
int val;
int state;
public Node(int v, int state) {
this.val = v;
this.state = state;
}
}
private int res;
private int ans = -1;
private int count = 0;
List<Node> list = new ArrayList();
public int solve(int[][] intervals) {
for (int[] interval : intervals) {
}
Collections.sort(list, (n1, n2) -> {
if (n1.val == n2.val)
return n1.state - n2.state;
return n1.val - n2.val;
});
for (int i = 0; i < list.size(); i++) {
Node node = list.get(i);
int diff = (node.state == 0) ? 1 : -1;
count += diff;
if (count > ans) {
ans = count;
res = node.val;
}
}
return res;
}
}```
```

```                        ```Solution in Python :

class Solution:
def solve(self, intervals):
OPEN, CLOSE = 0, 1

events = []
for s, e in intervals:
events.append([s, OPEN])
events.append([e, CLOSE])
events.sort()

active = max_active = 0
for x, cmd in events:
active += 1 if cmd == OPEN else -1
max_active = max(max_active, active)

for x, cmd in events:
active += 1 if cmd == OPEN else -1
if active == max_active:
return x

return 0```
```

## Delete a Node

Delete the node at a given position in a linked list and return a reference to the head node. The head is at position 0. The list may be empty after you delete the node. In that case, return a null value. Example: list=0->1->2->3 position=2 After removing the node at position 2, list'= 0->1->-3. Function Description: Complete the deleteNode function in the editor below. deleteNo

## Print in Reverse

Given a pointer to the head of a singly-linked list, print each data value from the reversed list. If the given list is empty, do not print anything. Example head* refers to the linked list with data values 1->2->3->Null Print the following: 3 2 1 Function Description: Complete the reversePrint function in the editor below. reversePrint has the following parameters: Sing

## Reverse a linked list

Given the pointer to the head node of a linked list, change the next pointers of the nodes so that their order is reversed. The head pointer given may be null meaning that the initial list is empty. Example: head references the list 1->2->3->Null. Manipulate the next pointers of each node in place and return head, now referencing the head of the list 3->2->1->Null. Function Descriptio

## Compare two linked lists

You’re given the pointer to the head nodes of two linked lists. Compare the data in the nodes of the linked lists to check if they are equal. If all data attributes are equal and the lists are the same length, return 1. Otherwise, return 0. Example: list1=1->2->3->Null list2=1->2->3->4->Null The two lists have equal data attributes for the first 3 nodes. list2 is longer, though, so the lis

## Merge two sorted linked lists

This challenge is part of a tutorial track by MyCodeSchool Given pointers to the heads of two sorted linked lists, merge them into a single, sorted linked list. Either head pointer may be null meaning that the corresponding list is empty. Example headA refers to 1 -> 3 -> 7 -> NULL headB refers to 1 -> 2 -> NULL The new list is 1 -> 1 -> 2 -> 3 -> 7 -> NULL. Function Description C

## Get Node Value

This challenge is part of a tutorial track by MyCodeSchool Given a pointer to the head of a linked list and a specific position, determine the data value at that position. Count backwards from the tail node. The tail is at postion 0, its parent is at 1 and so on. Example head refers to 3 -> 2 -> 1 -> 0 -> NULL positionFromTail = 2 Each of the data values matches its distance from the t