# HackerRank Coding question on variable sized array (Dynamic Programming)

### Problem Statement:

Consider an n element array, a, where each index i in the array contains a reference to an array of  ki integers (where the value of  ki varies from array to array). See the Explanation section below for a diagram.

Given a , you must answer q queries. Each query is in the format i  j, where denotes an index in array a and  j  denotes an index in the array located at a[i] . For each query, find and print the value of element  j in the array at location a[i] on a new line.

### Input Format:

The first line contains two space-separated integers denoting the respective values of n (the number of variable-length arrays) and q (the number of queries).
Each line i of the n subsequent lines contains a space-separated sequence in the format k a[i]0 a[i]1 … a[i]k-1 describing the K-element array located at a[i].
Each of the q subsequent lines contains two space-separated integers describing the respective values of i (an index in array ) and j (an index in the array referenced by a[i] ) for a query.

#### Constraints:

• 1≤n≤105
• 1≤k≤3.105
• 1≤q≤105
• n≤∑k≤3.105
• 0≤i<n
• 0≤j<n
• All indices in this challenge are zero-based.
• All the given numbers are non negative and are not greater than 106.

#### Output Format:

For each pair of i and j values (i.e., for each query), print a single integer that denotes the element located at index  j of the array referenced by a[i]. There should be a total of q lines of output.

5
9

#### Explanation:

The diagram below depicts our assembled Sample Input: We perform the following q=2 queries:

Find the array located at index i=0 , which corresponds to a=[1,5,4] . We must print the value at index j=1 of this array which, as you can see, is  5 .
Find the array located at index i=1 , which corresponds to a=[1,2,8,9,3] . We must print the value at index j=3 of this array which, as you can see, is 9 .

#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
int n,q,size,value,col,index;
cin>>n>>q;
vector<vector<int>>v;
for(int i=0;i<n;i++)
{
vector<int>iv;
cin>>size;
for(int j=0;j<size;j++)
{
cin>>value;
iv.push_back(value);
}
v.push_back(iv);
}
for(int k=0;k<q;k++)
{
cin>>col>>index;
cout<<v[col][index]<<endl;
}
return 0;
}

### 1 thought on “HackerRank Coding question on variable sized array (Dynamic Programming)”

1. Loving the information on this site, you have done outstanding job on the articles.