**Minimum Removals to Make Mountain List - Microsoft Top Interview Questions**

### Problem Statement :

You are given a list of integers nums. Return the minimum number of elements we can remove from nums such that the list becomes a mountain list. A mountain list is a list that is first strictly increasing and then strictly decreasing. Each of the increasing and decreasing parts should be non-empty. You can assume that a solution exists. Constraints n ≤ 100,000 where n is the length of nums Example 1 Input nums = [1, 6, 5, 7, 4] Output 1 Explanation We can remove 6 to get [1, 5, 7, 4]

### Solution :

` ````
Solution in C++ :
int solve(vector<int>& nums) {
int n = nums.size();
vector<int> lis;
vector<int> dp(n);
int idx = 0;
for (auto i : nums) {
auto it = lower_bound(lis.begin(), lis.end(), i);
if (it == lis.end())
lis.push_back(i);
else
*it = i;
dp[idx++] = lis.size();
}
for (auto i : dp) cout << i << " ";
cout << endl;
int ans = INT_MAX;
idx = 0;
reverse(nums.begin(), nums.end());
lis.clear();
for (auto i : nums) {
auto it = lower_bound(lis.begin(), lis.end(), i);
if (it == lis.end())
lis.push_back(i);
else
*it = i;
if (dp[n - idx - 1] > 1 && lis.size() > 1) {
ans = min(ans, n - (int)lis.size() - dp[n - idx - 1] + 1);
}
idx++;
}
return ans == INT_MAX ? -1 : ans;
}
```

` ````
Solution in Python :
class Solution:
def solve(self, nums):
n = len(nums)
def lis(nums):
lengths = []
mono_list = [math.inf]
for num in nums:
index = bisect_left(mono_list, num)
if index == len(mono_list):
mono_list.append(num)
else:
mono_list[index] = num
lengths.append(len(mono_list) if index > 0 else -math.inf)
return lengths
increasing = lis(nums)
decreasing = lis(reversed(nums))[::-1]
return n - max(increasing[i] + decreasing[i] - 1 for i in range(1, n - 1))
```

## View More Similar Problems

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

View Solution →## 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

View Solution →## 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

View Solution →## 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

View Solution →## 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

View Solution →## 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

View Solution →