Deleting Elements in an Array - Array Operations
Last Updated :
09 Nov, 2024
In this post, we will look into deletion operation in an Array, i.e., how to delete an element from an Array, such as:
- Delete an Element from the Beginning of an Array
- Delete an Element from a Given Position in an Array
- Delete First Occurrence of Given Element from an Array
- Remove All Occurrences of an Element in an Array
- Delete an Element from the End of an array
Delete an Element from the Beginning of an Array
Given an array of integers, the task is to delete an element from the beginning of the array.
Examples:
Input: arr[] = [10, 20, 30, 40]
Output: [20, 30, 40]
Input: arr[] = [20]
Output: []
To delete an element from the beginning of an array, we need to shift all subsequent elements one position to the left to fill the gap created by the removal. After shifting all the elements, reduce the array size by 1 to remove the extra element at the end. To know more about the implementation, please refer Delete an Element from the Beginning of an Array.
Delete an Element from a Given Position in an Array
Given an array of integers, the task is to delete an element from a given position in the array.
Examples:
Input: arr[] = [10, 20, 30, 40], pos = 1
Output: [20, 30, 40]
Input: arr[] = [10, 20, 30, 40], pos = 2
Output: [10, 30, 40]
Input: arr[] = [10, 20, 30, 40], pos = 4
Output: [10, 20, 30]
To delete an element from a given position in an array, all elements occurring after the given position need to be shifted one position to the left. After shifting all the elements, reduce the array size by 1 to remove the extra element at the end. To know more about the implementation, please refer Delete an Element from a Given Position in an Array.
Delete First Occurrence of Given Element from an Array
Given an array of integers, the task is to delete a given element from the array. If there are multiple occurrences of the element, we need to remove only its first occurrence.
Examples:
Input: arr[] = [10, 20, 30, 40], ele = 20
Output: [10, 30, 40]
Input: arr[] = [10, 20, 30, 40], ele = 25
Output: [10, 20, 30, 40]
Input: arr[] = [10, 20, 20, 20 30], ele = 20
Output: [10, 20, 20, 30]
To delete the first occurrence of a given element from an array, first iterate through the array to find the first occurrence of the element and as soon as we find it, we need to shift all subsequent elements one position to the left. After shifting the elements, the reduce the array size by one to remove the extra element at the end. To know more about the implementation, please refer Delete First Occurrence of Given Element from an Array.
Remove All Occurrences of an Element in an Array
Given an array of integers and an integer ele, the task is to remove all occurrences of ele in-place and return the count of elements not equal to ele. The modified array should first have those elements which are not equal to ele, and the remaining elements can be ignored.
Examples:
Input: arr[] = [3, 2, 2, 3], ele = 3
Output: 2
Explanation: The answer is 2 because there are 2 elements which are not equal to 3 and modified arr[] = [2, 2, _, _]
Input: arr[] = [0, 1, 3, 0, 2, 2, 4, 2], ele = 2
Output: 5
Explanation: The answer is 5 because there are 5 elements which are not equal to 2 and modified arr[] = [0, 1, 3, 0, 4, _, _, _].
The approach is to iterate through the array while maintaining a subarray at the beginning containing only elements that are not equal to ele. We can use a counter, k, to track the end of this subarray. Each time we encounter an element not equal to ele, we place it at the k-th index and then increment k. To know more about the implementation, please refer Remove All Occurrences of an Element in an Array.
Delete an Element from the End of an Array
Given an array of integers, the task is to delete an element from the end of the array.
Examples:
Input: arr[] = [10, 20, 30, 40]
Output: [10, 20, 30]
Input: arr[] = [20]
Output: []
To delete an element from the end of an array, we can simply reduce the size of array by 1. To know more about the implementation, please refer Delete an Element from the End of an Array.
Similar Reads
DSA Tutorial - Learn Data Structures and Algorithms
DSA (Data Structures and Algorithms) is the study of organizing data efficiently using data structures like arrays, stacks, and trees, paired with step-by-step procedures (or algorithms) to solve problems effectively. Data structures manage how data is stored and accessed, while algorithms focus on
7 min read
Non-linear Components
In electrical circuits, Non-linear Components are electronic devices that need an external power source to operate actively. Non-Linear Components are those that are changed with respect to the voltage and current. Elements that do not follow ohm's law are called Non-linear Components. Non-linear Co
11 min read
Quick Sort
QuickSort is a sorting algorithm based on the Divide and Conquer that picks an element as a pivot and partitions the given array around the picked pivot by placing the pivot in its correct position in the sorted array. It works on the principle of divide and conquer, breaking down the problem into s
12 min read
Merge Sort - Data Structure and Algorithms Tutorials
Merge sort is a popular sorting algorithm known for its efficiency and stability. It follows the divide-and-conquer approach. It works by recursively dividing the input array into two halves, recursively sorting the two halves and finally merging them back together to obtain the sorted array. Merge
14 min read
Breadth First Search or BFS for a Graph
Given a undirected graph represented by an adjacency list adj, where each adj[i] represents the list of vertices connected to vertex i. Perform a Breadth First Search (BFS) traversal starting from vertex 0, visiting vertices from left to right according to the adjacency list, and return a list conta
15+ min read
Bubble Sort Algorithm
Bubble Sort is the simplest sorting algorithm that works by repeatedly swapping the adjacent elements if they are in the wrong order. This algorithm is not suitable for large data sets as its average and worst-case time complexity are quite high.We sort the array using multiple passes. After the fir
8 min read
Insertion Sort Algorithm
Insertion sort is a simple sorting algorithm that works by iteratively inserting each element of an unsorted list into its correct position in a sorted portion of the list. It is like sorting playing cards in your hands. You split the cards into two groups: the sorted cards and the unsorted cards. T
9 min read
Binary Search Algorithm - Iterative and Recursive Implementation
Binary Search Algorithm is a searching algorithm used in a sorted array by repeatedly dividing the search interval in half. The idea of binary search is to use the information that the array is sorted and reduce the time complexity to O(log N). Binary Search AlgorithmConditions to apply Binary Searc
15 min read
Data Structures Tutorial
Data structures are the fundamental building blocks of computer programming. They define how data is organized, stored, and manipulated within a program. Understanding data structures is very important for developing efficient and effective algorithms. What is Data Structure?A data structure is a st
2 min read
Dijkstra's Algorithm to find Shortest Paths from a Source to all
Given a weighted undirected graph represented as an edge list and a source vertex src, find the shortest path distances from the source vertex to all other vertices in the graph. The graph contains V vertices, numbered from 0 to V - 1.Note: The given graph does not contain any negative edge. Example
12 min read