Here is my c++ solution, you can watch the explanation here : https://youtu.be/MYdQxgmJ4Sk

vector<int> dynamicArray(int n, vector<vector<int>> queries) {
    int lastAnswer = 0;
    vector<int> result;
    vector<vector<int>> arr(n);
    for(auto query: queries) {
        int type = query[0], x = query[1], y = query[2];
        int idx = (x ^ lastAnswer) % n;
        if(type == 1) {
            arr[idx].push_back(y);
        }
        else {
           lastAnswer = arr[idx][y % arr[idx].size()];
           result.push_back(lastAnswer);
        }
    }
    return result;
}

A little remind: You need to modulo the index with n to prevent out of bounds. Thanks me later xD

[` [ vector dynamicArray(int n, vector> queries) {

vector> arr(n,vector()); vector ans;

int row = queries.size();


int lastanswer = 0;
for(int i = 0 ; i < row; i++)
{

    int q = queries[i][0];
    int x = queries[i][1];
    int y = queries[i][2];

     int idx =( x ^ lastanswer)% n;
    //Query type 1
    if(q == 1)
    {
       // cout<<idx <<endl;
        arr[idx].push_back(y);
       // cout<<arr[idx] [0] << endl;
    }else  if(q == 2) //Query type 2
    {
         int id = y % arr[idx].size();
         lastanswer = arr[idx][id];
         ans.push_back(lastanswer); 
    }

}
return  ans;

} ] `(https://)

vector dynamicArray(int n, vector> queries) {

vector> arr(n,vector()); vector ans;

int row = queries.size();


int lastanswer = 0;
for(int i = 0 ; i < row; i++)
{

    int q = queries[i][0];
    int x = queries[i][1];
    int y = queries[i][2];

     int idx =( x ^ lastanswer)% n;
    //Query type 1
    if(q == 1)
    {
       // cout<<idx <<endl;
        arr[idx].push_back(y);
       // cout<<arr[idx] [0] << endl;
    }else  if(q == 2) //Query type 2
    {
         int id = y % arr[idx].size();
         lastanswer = arr[idx][id];
         ans.push_back(lastanswer); 
    }

}
return  ans;

}

Dynamic arrays provide flexibility in memory allocation, allowing efficient resizing as elements are added or removed. They are widely used in data structures and algorithms for handling varying data sizes.

On a side note, if you want to send flowers from the USA, many reliable services offer international flower delivery!