Help me in solving PREFSUFF problem

help
,
1

My issue

can someone help me understand this problem

My code

Problem Link: Prefix Suffix Inequality Practice Coding Problem

2

@damon_lucifer
the questions states that u have to find array of size n such that their prefix and suffix hold the condition given in the question.
plzz refer my c++ code for better understanding

#include <iostream>
using namespace std;

int main() {
	// your code goes here
	int t;
	cin>>t;
	while(t--)
	{
	    int n;
	    cin>>n;
	    n--;
	    while(n--)
	    cout<<7<<" ";
	    cout<<3;
	    cout<<endl;
	}
	return 0;
}