#include
#include
using namespace std;
int main() {
int t,c;cin>>t>>c;int a[c];
while(t>0){t–;
for(int i=0;i<c;i++){
cin>>a[i];
}
int s=c-1;
for(int j=s;j>=0;j--)cout<<a[j];
}
return 0;
}
#include
#include
using namespace std;
int main() {
int t,c;cin>>t>>c;int a[c];
while(t>0){t–;
for(int i=0;i<c;i++){
cin>>a[i];
}
int s=c-1;
for(int j=s;j>=0;j--)cout<<a[j];
}
return 0;
}
hi @yashtripathi6969_0cd127807d833066 do you know about sorting using comparators, this question can be done using comparators.
refer this code -->
I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.
On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.