Generate an array of size N according to the given rules
Last Updated :
21 May, 2024
Given a number N, the task is to create an array arr[] of size N, where the value of the element at every index i is filled according to the following rules:
- arr[i] = ((i - 1) - k), where k is the index of arr[i - 1] that has appeared second most recently. This rule is applied when arr[i - 1] is present more than once in the array
- arr[i] = 0. This rule is applied when arr[i - 1] is present only once or when i = 1.
Examples:
Input: N = 8
Output: 0 0 1 0 2 0 2 2
Explanation:
For i = 0: There is no element in the array arr[]. So, 0 is placed in the first index. arr[] = {0}.
For i = 1: There is only one element in the array arr[]. The occurrence of arr[i - 1] (= 0) is only one. Therefore, the array is filled according to the rule 2. arr = {0, 0}.
For i = 2: There are two elements in the array. The second most occurrence of arr[i - 1] = arr[0] = 0. So, arr[2] = 1. arr[] = {0, 0, 1}.
For i = 3: There is no second occurrence of arr[i - 1] = 1. Therefore, arr[3] = 0. arr[] = {0, 0, 1, 0}
For i = 4: The second recent occurrence of arr[i - 1] = 0 is 1. Therefore, (i - 1 - k) = (4 - 1 - 1) = 2. arr[] = {0, 0, 1, 0, 2}.
For i = 5: There is only one occurrence of arr[i - 1] = 2. Therefore, arr[5] = 0. arr[] = {0, 0, 1, 0, 2, 0}.
For i = 6: The second recent occurrence of arr[i - 1] = 0 is 3. Therefore, (i - 1 - k) = (6 - 1 - 3) = 2. arr[] = {0, 0, 1, 0, 2, 0, 2}.
For i = 7: The second recent occurrence of arr[i - 1] = 2 is 4. Therefore, (i - 1 - k) = (7 - 1 - 4) = 2. arr[] = {0, 0, 1, 0, 2, 0, 2, 2}
Input: N = 5
Output: 0 0 1 0 2
Approach: The idea is to first create an array filled with zeroes of size N. Then for every iteration, we search if the element has occurred in the near past. If yes, then we follow rule 1. Else, rule 2 is followed to fill the array.
Below is the implementation of the above approach:
Java
// Java implementation to generate
// an array of size N by following
// the given rules
class GFG
{
static int a[];
// Function to search the most recent
// location of element N
// If not present in the array
// it will return -1
static int search(int a[],int k, int x)
{
int j;
for ( j = k - 1; j > -1 ; j--)
{
if(a[j] == x)
return j ;
}
return -1 ;
}
// Function to generate an array
// of size N by following the given rules
static void genArray(int []arr, int N)
{
// Loop to fill the array
// as per the given rules
for(int i = 0; i < N - 1; i++)
{
// Check for the occurrence
// of arr[i - 1]
if(search(arr, i, arr[i]) == -1)
arr[i + 1] = 0 ;
else
arr[i + 1] = (i-search(arr, i, arr[i])) ;
}
}
// Driver code
public static void main (String[] args)
{
int N = 5 ;
int size = N + 1 ;
int a[] = new int [N];
genArray(a, N) ;
for (int i = 0; i < N ; i ++)
System.out.print(a[i]+" " );
}
}
// This code is contributed by Yash_R
# Python implementation to generate
# an array of size N by following
# the given rules
# Function to search the most recent
# location of element N
# If not present in the array
# it will return -1
def search(a, k, x):
for j in range(k-1, -1, -1) :
if(a[j]== x):
return j
return -1
# Function to generate an array
# of size N by following the given rules
def genArray(arr, N):
# Loop to fill the array
# as per the given rules
for i in range(0, N-1, 1):
# Check for the occurrence
# of arr[i - 1]
if(search(arr, i, arr[i])==-1):
arr[i + 1]= 0
else:
arr[i + 1]=(i-search(arr, i, arr[i]))
# Driver code
if __name__ == "__main__":
N = 5
size = N + 1
a =[0]*N
genArray(a, N)
print(a)
// C# implementation to generate
// an array of size N by following
// the given rules
using System;
public class GFG
{
static int []a;
// Function to search the most recent
// location of element N
// If not present in the array
// it will return -1
static int search(int []a,int k, int x)
{
int j;
for ( j = k - 1; j > -1 ; j--)
{
if(a[j] == x)
return j ;
}
return -1 ;
}
// Function to generate an array
// of size N by following the given rules
static void genArray(int []arr, int N)
{
// Loop to fill the array
// as per the given rules
for(int i = 0; i < N - 1; i++)
{
// Check for the occurrence
// of arr[i - 1]
if(search(arr, i, arr[i]) == -1)
arr[i + 1] = 0 ;
else
arr[i + 1] = (i-search(arr, i, arr[i])) ;
}
}
// Driver code
public static void Main (string[] args)
{
int N = 5 ;
int size = N + 1 ;
int []a = new int [N];
genArray(a, N) ;
for (int i = 0; i < N ; i ++)
Console.Write(a[i]+" " );
}
}
// This code is contributed by AnkitRai01
<script>
// Javascript implementation to generate
// an array of size N by following
// the given rules
// Function to search the most recent
// location of element N
// If not present in the array
// it will return -1
function search( a, k, x)
{
var j;
for ( j = k - 1; j > -1 ; j--)
{
if(a[j] == x)
return j ;
}
return -1 ;
}
// Function to generate an array
// of size N by following the given rules
function genArray(arr, N)
{
// Loop to fill the array
// as per the given rules
for(var i = 0; i < N - 1; i++)
{
// Check for the occurrence
// of arr[i - 1]
if(search(arr, i, arr[i]) == -1)
arr[i + 1] = 0 ;
else
arr[i + 1] = (i-search(arr, i, arr[i])) ;
}
}
// Driver code
var N = 5 ;
var size = N + 1 ;
var a = [0, 0, 0, 0, 0];
genArray(a, N) ;
document.write("["+a+"]");
// This code is contributed by rutvik_56.
</script>
// C++ implementation to generate
// an array of size N by following
// the given rules
#include <bits/stdc++.h>
using namespace std;
// Function to search the most recent
// location of element N
// If not present in the array
// it will return -1
int search(int a[], int k, int x)
{
int j;
for ( j = k - 1; j > -1 ; j--)
{
if(a[j] == x)
return j ;
}
return -1 ;
}
// Function to generate an array
// of size N by following the given rules
void genArray(int arr[], int N)
{
// Loop to fill the array
// as per the given rules
for(int i = 0; i < N - 1; i++)
{
// Check for the occurrence
// of arr[i - 1]
if(search(arr, i, arr[i]) == -1)
arr[i + 1] = 0 ;
else
arr[i + 1] = (i-search(arr, i, arr[i])) ;
}
}
// Driver code
int main()
{
int N = 5 ;
int size = N + 1 ;
int a[] = {0, 0, 0, 0, 0};
genArray(a, N) ;
for (int i = 0; i < N ; i ++)
cout << a[i] << " " ;
return 0;
}
// This code is contributed by shivanisinghss2110
Time Complexity: O(N2)
Auxiliary Space: O(1)
Using Dictionary:
To generate the array of size N while adhering to the given rules with improved efficiency, we can utilize an approach that avoids searching for elements in the array for each iteration. Instead, we can maintain a dictionary to store the most recent index of each element encountered. This approach reduces the time complexity significantly compared to the provided solution by eliminating the need for repeated linear searches.
- We initialize a dictionary to store the most recent index of each element encountered in the array.
- We start filling the array with zeroes.
- For each iteration, we check if the current element has occurred previously.
- If yes, we calculate the difference between the current index and the second most recent occurrence of the element.
- If not, we continue filling the array with zeroes.
- Finally, we return the generated array.
C++
#include <iostream>
#include <unordered_map>
#include <vector>
using namespace std;
vector<int> genArray(int N)
{
vector<int> arr(N);
unordered_map<int, int>
recentIndex; // Map to store most recent index of
// elements
for (int i = 1; i < N; i++) {
if (recentIndex.find(arr[i - 1])
!= recentIndex.end()
&& recentIndex[arr[i - 1]] != i - 1) {
arr[i] = (i - 1) - recentIndex[arr[i - 1]];
}
recentIndex[arr[i - 1]] = i - 1;
}
return arr;
}
// Driver code
int main()
{
int N = 5;
vector<int> result = genArray(N);
for (int num : result) {
cout << num << " ";
}
cout << endl;
return 0;
}
import java.util.HashMap;
import java.util.Map;
public class GenArray {
public static int[] genArray(int N)
{
int[] arr = new int[N];
Map<Integer, Integer> recentIndex
= new HashMap<>(); // Dictionary to store most
// recent index of elements
for (int i = 1; i < N; i++) {
if (recentIndex.containsKey(arr[i - 1])
&& recentIndex.get(arr[i - 1]) != i - 1) {
arr[i]
= (i - 1) - recentIndex.get(arr[i - 1]);
}
recentIndex.put(arr[i - 1], i - 1);
}
return arr;
}
// Driver code
public static void main(String[] args)
{
int N = 5;
int[] result = genArray(N);
for (int num : result) {
System.out.print(num + " ");
}
}
}
// This code is contributed by shivamgupta0987654321
def genArray(N):
arr = [0] * N
recent_index = {} # Dictionary to store most recent index of elements
for i in range(1, N):
if arr[i - 1] in recent_index and recent_index[arr[i - 1]] != i - 1:
arr[i] = i - 1 - recent_index[arr[i - 1]]
recent_index[arr[i - 1]] = i - 1
return arr
# Driver code
if __name__ == "__main__":
N = 5
result = genArray(N)
print(result)
function genArray(N) {
let arr = new Array(N).fill(0);
let recentIndex = {}; // Object to store most recent index of elements
for (let i = 1; i < N; i++) {
if (recentIndex[arr[i - 1]] !== undefined && recentIndex[arr[i - 1]] !== i - 1) {
arr[i] = i - 1 - recentIndex[arr[i - 1]];
}
recentIndex[arr[i - 1]] = i - 1;
}
return arr;
}
// Driver code
let N = 5;
let result = genArray(N);
console.log(result);
Time Complexity: O(N)
Space Complexity: O(N)
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
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
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
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
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
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
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
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
Selection Sort Selection Sort is a comparison-based sorting algorithm. It sorts an array by repeatedly selecting the smallest (or largest) element from the unsorted portion and swapping it with the first unsorted element. This process continues until the entire array is sorted.First we find the smallest element an
8 min read