Alphabyte1:
Note the number of letter n in the string is 5 (timur) . You have to use sort if to display correctly


#include <bits\stdc++.h>
using namespace std;
int main(int argc, char const *argv[])
{
int t;
scanf("%d", &t);
while (t--)
{
int n;
string s;
scanf("%d", &n);
cin >> s;
string ans = "Timru";
sort(s.begin(), s.end());

cout << (s == ans ? "YES" : "NO" ) << "\n";
}
}

TastyFriedPussy:
Bro, thanks but i did not ask for solution i just wanted to know why my own solution wasn't working

Alphabyte1:


Add the code below
sort(s.begin(), s.end());

Sleekcode:
Why would a mad man be learning C++?

U for start with BASIC

TastyFriedPussy:
Oga shut up and go and sit down, efulefu.
I'm learning it because i want to be better than you at coding, simple
Shebi na wetin you wan hear?

TastyFriedPussy:
isn't that a sorting algorithm?

Alphabyte1:



The problem requires sorting the input to pass all test

Alphabyte1:



The problem requires sorting the input to pass all test

TastyFriedPussy:
And moreover, that preprocessor directive you used, i've not seen it before in my entire life .. What does it do and why can you read input and output with it without using iostream? is it like a special one or what?

Alphabyte1:
Note the number of letter n in the string is 5 (timur) . You have to use sort if to display correctly


#include <bits\stdc++.h>
using namespace std;
int main(int argc, char const *argv[])
{
int t;
scanf("%d", &t);
while (t--)
{
int n;
string s;
scanf("%d", &n);
cin >> s;
string ans = "Timru";
sort(s.begin(), s.end());

cout << (s == ans ? "YES" : "NO" ) << "\n";
}
}

qtguru:


I don't think this solves it.

TastyFriedPussy:
It absolutely blasted it

Alphabyte1:
Note the number of letter n in the string is 5 (timur) . You have to use sort if to display correctly


#include <bits\stdc++.h>
using namespace std;
int main(int argc, char const *argv[])
{
int t;
scanf("%d", &t);
while (t--)
{
int n;
string s;
scanf("%d", &n);
cin >> s;
string ans = "Timru";
sort(s.begin(), s.end());

cout << (s == ans ? "YES" : "NO" ) << "\n";
}
}

qtguru:
Send me the link to this algo, is this codeforces ?

qtguru:


sort(s.begin(), s.end()); // It seems it sorts alphabetically in the following order:

Case Letters first "T", then the letters in terms of a-z
i << m << r << u so this gets sorted well

If the name was Timra, this would fail, though it passes, I won't say it's accurate, we're just lucky to be given this letters. @TasyFriedPussy

Timra would be Taimr

Alphabyte1:



Timur, miurT, Trumi, mriTu all are 5 in length and they are valid spelling of the name from the challenge the output for the 4 words will be YES

tensazangetsu20:
Omho you don enter codeforces. This boy you arent playing at all o . Codeforces is leetcode and hackkerank ^ 4

qtguru:


Everybody has to learn Algo , everything na interview

TastyFriedPussy:


Lolzzz, ... Me wey just dey enter pointers topic, na him you dey tell sorting sorting what?
I just tried to solve it using the little knowledge I've gotten..

TastyFriedPussy:
i do not know why my solution to this problem keeps on failing the second. it passes the first test where t (number of test cases) is 5 but fails the second test where t is 1000. for all test cases of the second test, the output is supposed to be YES throughout, but my own output only comes out with 3 YES's which are the first three, but the remaining 997 comes out as NO's....

Please someone should help me figure out where I'm getting it wrong.

First picture is the problem, the second is my solution.

@qtguru

TastyFriedPussy:
And it will never be sweet for you in Jesus name... You are very big he-goats idiots in the making that will only end up Failing. Thunder scatter your life. You're gonna fail woefully in this field I assure you that, you won't earn shishi from it. rubbish

That was how my dad refused me to study my CS five years ago after secondary school. Instead he forced me to go study pharmacy, just because he wants to use me to brag to his friends who's children are also medical doctors and pharmacists. Now I'm a drop out because I couldn't continue the useless course and he's being blaming me even since. Rubbish...Rubbish

idiotP

tensazangetsu20:
Omho you don enter codeforces. This boy you arent playing at all o . Codeforces is leetcode and hackkerank ^ 4

stankelz:
Nah all of una fit afford that leetcode premium so?
How una dey do am Abeg?

I’m almost done with Grokking algo like tensa adviced , however I need a platform to practice but leetcode is not free. All I’ve been doing for some months now is codewars but I need to jump into leetcode. Is there something I’m missing, are there other platforms like leetcode where I can practice DSA ?

LittleBigDick:
Learn a well paid language like Java or C
C++ pays low