Data Structures/Array Operations
fundamentalrandom-access
Press play to start
1void insertAt(int arr[], int *n, int idx, int val) {
2 (*n)++;
3 for (int i = *n - 1; i > idx; i--) {
4 arr[i] = arr[i - 1];
5 }
6 arr[idx] = val;
7}
Step 1/0

Practice

LeetCode·#1480 Running Sum of 1d ArrayEasyHackerRank·Arrays - DSEasyBeecrowd·#1001 Extremely BasicEasy
OperationBestAverageWorst
accessO(1)O(1)O(1)
insert middleO(n)O(n)O(n)
remove middleO(n)O(n)O(n)
searchO(1)O(n)O(n)
SpaceO(1)