Skip to content
Related Articles

Related Articles

Delete array element in given index range [L – R]
  • Difficulty Level : Hard
  • Last Updated : 15 Mar, 2019

Given an array A[] and size of array is N. The task is to delete element of array A[] are in given range L to R both are exclusive.

Examples:

Input : N = 12
        A[] = { 3, 5, 3, 4, 9, 3, 1, 6, 3, 11, 12, 3}
        L = 2
        R = 7
Output : 3 5 3 6 3 11 12 3 
since A[2] = 3 but this is exclude 
A[7] =  6 this also exclude 

Input : N = 10
        A[] ={ 5, 8, 11, 15, 26, 14, 19, 17, 10, 14 }
        L = 4
        R = 6
Output :5 8 11 15 26 19 17 10 14

A naive approach is to delete element in range L to R with extra space.

Below is the implementation of the above approach:

C++




// C++ code to delete element
// in given range
#include <bits/stdc++.h>
using namespace std;
  
// Delete L to R element
vector<int> deleteElement(int A[], int L, int R, int N)
{
    vector<int> B;
  
    for (int i = 0; i < N; i++) 
        if (i <= L || i >= R) 
           B.push_back(A[i]);        
      
    return B;
}
  
// main Driver
int main()
{
    int A[] = { 3, 5, 3, 4, 9, 3, 1, 6, 3, 11, 12, 3 };
    int L = 2, R = 7;
    int n = sizeof(A) / sizeof(A[0]);
    vector<int> res = deleteElement(A, L, R, n);
    for (auto x : res)
        cout << x << " ";
    return 0;
}
Java



import java.util.Vector;
  
// Java code to delete element 
// in given range 
class GFG {
// Delete L to R element 
  
    static Vector<Integer> deleteElement(int A[], int L, int R, int N) {
        Vector<Integer> B = new Vector<>();
  
        for (int i = 0; i < N; i++) {
            if (i <= L || i >= R) {
                B.add(A[i]);
            }
        }
  
        return B;
    }
  
// main Driver 
    public static void main(String[] args) {
        int A[] = {3, 5, 3, 4, 9, 3, 1, 6, 3, 11, 12, 3};
        int L = 2, R = 7;
        int n = A.length;
        Vector<Integer> res = deleteElement(A, L, R, n);
        for (Integer x : res) {
            System.out.print(x + " ");
        }
    }
}
// This code is contributed by PrinciRaj1992
Python3



# Python 3 code to delete element
# in given range
  
# Delete L to R element
def deleteElement(A, L, R, N):
    B = []
  
    for i in range(0, N, 1):
        if (i <= L or i >= R):
            B.append(A[i]) 
      
    return B
  
# Driver Code
if __name__ == '__main__':
    A = [3, 5, 3, 4, 9, 3, 1,
             6, 3, 11, 12, 3] 
    L = 2
    R = 7
    n = len(A)
    res = deleteElement(A, L, R, n)
    for i in range(len(res)):
        print(res[i], end = " ")
  
# THis code is implemented by
# Surendra_Gangwar
C#



// C# code to delete element 
// in given range 
using System; 
using System.Collections.Generic; 
  
class GFG 
{ 
      
    // Delete L to R element 
    static List<int> deleteElement(int []A, 
                        int L, int R, int N) 
    { 
        List<int> B = new List<int>(); 
        for (int i = 0; i < N; i++)
        { 
            if (i <= L || i >= R) 
            { 
                B.Add(A[i]); 
            } 
        } 
        return B; 
    } 
  
    // Driver code
    public static void Main()
    { 
        int []A = {3, 5, 3, 4, 9, 3, 1, 6, 
                            3, 11, 12, 3}; 
        int L = 2, R = 7; 
        int n = A.Length; 
        List<int> res = deleteElement(A, L, R, n); 
        foreach (int x in res) 
        { 
            Console.Write(x + " "); 
        } 
    } 
}
  
// This code is contributed by Rajput-Ji
PHP



<?php
// PHP code to delete element
// in given range
  
// Delete L to R element
function deleteElement($A, $L, $R, $N)
{
    $B = array();
  
    for ($i = 0; $i < $N; $i++) 
    {
        if ($i <= $L or $i >= $R)
            $B[] = $A[$i];
    }
    return $B;
}
  
// Driver Code
$A = array(3, 5, 3, 4, 9, 3, 1,
              6, 3, 11, 12, 3);
$L = 2;
$R = 7;
$n = count($A);
$res = deleteElement($A, $L, $R, $n);
for ($i = 0; $i < count($res); $i++)
echo "$res[$i] ";
  
// This code is implemented by
// Srathore
?>
Output:


3 5 3 6 3 11 12 3

Time Complexity: O(n)
Auxiliary Space : O(n)
An efficient solution without using extra space.
Below is the implementation of the above approach:
C++



// C++ code to delete element
// in given range
#include <bits/stdc++.h>
using namespace std;
  
// Delete L to R elements
int deleteElement(int A[], int L, int R, int N)
{
    int i, j = 0;
    for (i = 0; i < N; i++) {
        if (i <= L || i >= R) {
            A[j] = A[i];
            j++;
        }
    }
  
    // Return size of Array
    // after delete element
    return j; 
}
  
// main Driver
int main()
{
    int A[] = { 5, 8, 11, 15, 26, 14, 19, 17, 10, 14 };
    int L = 2, R = 7;
    int n = sizeof(A) / sizeof(A[0]);
    int res_size = deleteElement(A, L, R, n);
    for (int i = 0; i < res_size; i++)
        cout << A[i] << " ";
    return 0;
}
Java



// Java code to delete element
// in given range
class GFG 
{
  
// Delete L to R elements
static int deleteElement(int A[], int L, 
                         int R, int N)
{
    int i, j = 0;
    for (i = 0; i < N; i++) 
    {
        if (i <= L || i >= R)
        {
            A[j] = A[i];
            j++;
        }
    }
  
    // Return size of Array
    // after delete element
    return j; 
}
  
// Driver Code
public static void main(String args[])
{
    int A[] = new int[] { 5, 8, 11, 15, 26, 
                        14, 19, 17, 10, 14 };
    int L = 2, R = 7;
    int n = A.length;
    int res_size = deleteElement(A, L, R, n);
    for (int i = 0; i < res_size; i++)
    System.out.print(A[i] + " ");
}
}
  
// This code is contributed
// by Kirti_Mangal
Python 3



# Python 3 program  to delete element 
# in given range
  
# Function to delete L to R element 
def deleteElement(A, L, R, N) :
  
    j = 0
    for i in range(N) :
        if i <= L or i >= R :
            A[j] = A[i]
            j += 1
  
    # Return size of Array 
    # after delete element 
    return j
      
# Driver Code
if __name__ == "__main__" :
  
    A = [5, 8, 11, 15, 26, 14, 19, 17, 10, 14]
    L, R = 2,7
  
    n = len(A)
    res_size = deleteElement(A, L, R, n)
  
    for i in range(res_size) :
        print(A[i],end = " ")
  
# This code is contributed by ANKITRAI1
C#



// C# code to delete element 
// in given range 
using System;
  
class GFG 
{ 
  
// Delete L to R elements 
static int deleteElement(int []A, int L, 
                         int R, int N) 
{ 
    int i, j = 0; 
    for (i = 0; i < N; i++) 
    { 
        if (i <= L || i >= R) 
        { 
            A[j] = A[i]; 
            j++; 
        } 
    } 
  
    // Return size of Array 
    // after delete element 
    return j; 
} 
  
// Driver Code 
public static void Main() 
{ 
    int []A = new int[] { 5, 8, 11, 15, 26, 
                         14, 19, 17, 10, 14 }; 
    int L = 2, R = 7; 
    int n = A.Length; 
    int res_size = deleteElement(A, L, R, n); 
    for (int i = 0; i < res_size; i++) 
        Console.Write(A[i] + " "); 
} 
} 
  
// This code is contributed by 29AjayKumar
PHP



<?php
// PHP code to delete element
// in given range
  
// Delete L to R elements
function deleteElement(&$A, $L, $R, $N)
{
    $i= 0;
    $j = 0;
    for ($i = 0; $i < $N; $i++) 
    {
        if ($i <= $L || $i >= $R)
        {
            $A[$j] = $A[$i];
            $j++;
        }
    }
  
    // Return size of Array
    // after delete element
    return $j; 
}
  
// Driver Code
$A = array(5, 8, 11, 15, 26, 
           14, 19, 17, 10, 14);
$L = 2;
$R = 7;
$n = sizeof($A);
$res_size = deleteElement($A, $L, $R, $n);
for ($i = 0; $i < $res_size; $i++)
{
    echo ($A[$i]);
    echo (" ");
} 
  
// This code is contributed 
// by Shivi_Aggarwal
?>
Output:
5 8 11 17 10 14

Time Complexity: O(n)
Auxiliary Space : O(1)
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.
My Personal Notes
arrow_drop_up
Next
last_page
Delete an element from array (Using two traversals and one traversal)
Recommended Articles
Page :
Minimum index i such that all the elements from index i to given index are equal
11, Feb 19
Range Query on array whose each element is XOR of index value and previous element
24, Dec 17
Queries for elements having values within the range A to B in the given index range using Segment Tree
27, Apr 20
Find element at given index after given range reversals
28, Sep 17
Farthest index that can be reached from the Kth index of given array by given operations
02, Dec 20
Perform append, update, delete and range sum queries on the given array
18, Dec 19
Count of contiguous subarrays possible for every index by including the element at that index
08, May 20
Queries to print count of distinct array elements after replacing element at index P by a given element
16, Oct 20
Queries for number of distinct elements from a given index till last index in an array
17, Jun 19
Queries for bitwise OR in the index range [L, R] of the given array
16, May 19
Queries for bitwise AND in the index range [L, R] of the given array
16, May 19
Sort the array in a given index range
13, Dec 18
Find if a crest is present in the index range [L, R] of the given array
18, Nov 19
Maximum index a pointer can reach in N steps by avoiding a given index B | Set 2
15, Mar 21
Check if it is possible to reach to the index with value K when start index is given
25, Jun 20
Remaining array element after repeated removal of last element and subtraction of each element from next adjacent element
23, Feb 21
Sort Array such that smallest is at 0th index and next smallest it at last index and so on
08, Jul 20
Queries to calculate sum of array elements present at every Yth index starting from the index X
13, Jan 21
Rearrange array such that even index elements are smaller and odd index elements are greater
08, Oct 17
Rearrange given array such that no array element is same as its index
02, Dec 20
Delete an element from array (Using two traversals and one traversal)
30, Mar 15
Queries to update a given index and find gcd in range
18, Apr 19
Queries for greatest pair sum in the given index range using Segment Tree
08, May 20
Smallest index in given range of indices which is not equal to X
30, Jun 20
Article Contributed By :
https://media.geeksforgeeks.org/auth/avatar.png
Rajput-Ji
@Rajput-Ji
Vote for difficulty
Current difficulty :
Hard





Improved By :
Article Tags :
Practice Tags :
Report Issue

We use cookies to ensure you have the best browsing experience on our website. By using our site, you
acknowledge that you have read and understood our
Cookie Policy &
        Privacy Policy

Lightbox