`{"id":"bfc7522e-3c64-433c-a86b-7d7e2a0a8e29","name":"Minimum Deletions To Make Sorted Array","description":"1. You are given a number N representing number of elements.\r\n2. You are given N space separated numbers representing (ELE)elements.\r\n3. Find the minimum number of deletions/removals needed such that remaining elements are (strictly)sorted.","inputFormat":"A number N(number of elements)\r\nELE1 ,ELE2 ,ELE3 ,ELE4 ,ELE5 .... ELEn (N space separated elements)","outputFormat":"Find the minimum number of deletions/removals.\r\nCheck the sample output and question video.","constraints":"1 &lt;= N &lt;= 100000\r\n1 &lt;= Elei &lt;= 50000","sampleCode":{"cpp":{"code":""},"java":{"code":"import java.util.Scanner;\r\n\r\npublic class Main{\r\n public static int minimumDeletionsToSorted(int []arr){\r\n // write your code here\r\n return -1;\r\n }\r\n public static void main(String []args){\r\n Scanner scn = new Scanner(System.in);\r\n int n = scn.nextInt();\r\n int arr[] = new int[n];\r\n\r\n for(int i = 0 ;i < n;i++){\r\n arr[i] = scn.nextInt();\r\n }\r\n\r\n System.out.println(minimumDeletionsToSorted(arr));\r\n }\r\n}"},"node":{"code":""},"ruby":{"code":""},"python":{"code":""}},"points":10,"difficulty":"easy","sampleInput":"10\r\n40 10 55 18 14 41 61 62 25 50 \r\n","sampleOutput":"5\r\n","questionVideo":"","hints":[],"associated":[],"solutionSeen":false,"tags":[],"meta":{"path":[{"id":0,"name":"home"},{"id":"0c54b191-7b99-4f2c-acb3-e7f2ec748b2a","name":"Data Structures and Algorithms","slug":"data-structures-and-algorithms","type":0},{"id":"5539a6e8-c8bf-4f04-805c-e43e9d20e72a","name":"Dynamic Programming For Intermediate","slug":"dynamic-programming-for-intermediate-408","type":0},{"id":"3ab234cf-305f-4a78-81a3-63af4ed19898","name":"Minimum Deletions To Make Sorted Array","slug":"minimum-deletions-to-make-sorted-array","type":1}],"next":{"id":"8f1010b0-00ab-4a0d-9ecf-e10eba378292","name":"Min Max Value Expression","type":1,"slug":"min-max-value-expression"},"prev":{"id":"1ee90a75-1600-40e7-b230-ca2f74f93b82","name":"Minimum Deletions To Make Palindromic Sequence","type":1,"slug":"minimum-deletions-to-make-palindromic-sequence"}}}`

# Minimum Deletions To Make Sorted Array

1. You are given a number N representing number of elements. 2. You are given N space separated numbers representing (ELE)elements. 3. Find the minimum number of deletions/removals needed such that remaining elements are (strictly)sorted.

`{"id":"bfc7522e-3c64-433c-a86b-7d7e2a0a8e29","name":"Minimum Deletions To Make Sorted Array","description":"1. You are given a number N representing number of elements.\r\n2. You are given N space separated numbers representing (ELE)elements.\r\n3. Find the minimum number of deletions/removals needed such that remaining elements are (strictly)sorted.","inputFormat":"A number N(number of elements)\r\nELE1 ,ELE2 ,ELE3 ,ELE4 ,ELE5 .... ELEn (N space separated elements)","outputFormat":"Find the minimum number of deletions/removals.\r\nCheck the sample output and question video.","constraints":"1 &lt;= N &lt;= 100000\r\n1 &lt;= Elei &lt;= 50000","sampleCode":{"cpp":{"code":""},"java":{"code":"import java.util.Scanner;\r\n\r\npublic class Main{\r\n public static int minimumDeletionsToSorted(int []arr){\r\n // write your code here\r\n return -1;\r\n }\r\n public static void main(String []args){\r\n Scanner scn = new Scanner(System.in);\r\n int n = scn.nextInt();\r\n int arr[] = new int[n];\r\n\r\n for(int i = 0 ;i < n;i++){\r\n arr[i] = scn.nextInt();\r\n }\r\n\r\n System.out.println(minimumDeletionsToSorted(arr));\r\n }\r\n}"},"node":{"code":""},"ruby":{"code":""},"python":{"code":""}},"points":10,"difficulty":"easy","sampleInput":"10\r\n40 10 55 18 14 41 61 62 25 50 \r\n","sampleOutput":"5\r\n","questionVideo":"","hints":[],"associated":[],"solutionSeen":false,"tags":[],"meta":{"path":[{"id":0,"name":"home"},{"id":"0c54b191-7b99-4f2c-acb3-e7f2ec748b2a","name":"Data Structures and Algorithms","slug":"data-structures-and-algorithms","type":0},{"id":"5539a6e8-c8bf-4f04-805c-e43e9d20e72a","name":"Dynamic Programming For Intermediate","slug":"dynamic-programming-for-intermediate-408","type":0},{"id":"3ab234cf-305f-4a78-81a3-63af4ed19898","name":"Minimum Deletions To Make Sorted Array","slug":"minimum-deletions-to-make-sorted-array","type":1}],"next":{"id":"8f1010b0-00ab-4a0d-9ecf-e10eba378292","name":"Min Max Value Expression","type":1,"slug":"min-max-value-expression"},"prev":{"id":"1ee90a75-1600-40e7-b230-ca2f74f93b82","name":"Minimum Deletions To Make Palindromic Sequence","type":1,"slug":"minimum-deletions-to-make-palindromic-sequence"}}}`

Editor

# Minimum Deletions To Make Sorted Array

easy

1. You are given a number N representing number of elements. 2. You are given N space separated numbers representing (ELE)elements. 3. Find the minimum number of deletions/removals needed such that remaining elements are (strictly)sorted.

## Constraints

1 <= N <= 100000 1 <= Elei <= 50000

## Format

### Input

A number N(number of elements) ELE1 ,ELE2 ,ELE3 ,ELE4 ,ELE5 .... ELEn (N space separated elements)

### Output

Find the minimum number of deletions/removals. Check the sample output and question video.

## Example

Sample Input

```.css-23h8hz{color:inherit;font-size:0.875rem;line-height:1.125rem;letter-spacing:0.016rem;font-weight:var(--chakra-fontWeights-normal);white-space:pre-wrap;}10 40 10 55 18 14 41 61 62 25 50 ```

### Sample Output

```.css-3oaykw{color:var(--chakra-colors-active-primary);font-size:0.875rem;line-height:1.125rem;letter-spacing:0.016rem;font-weight:var(--chakra-fontWeights-normal);white-space:pre-wrap;font-family:Monospace;}5 ```

Discussions

Show Discussion

Related Resources