Yes, in both round 1 and round 2.
Some of my friends did 2.5 questions and still didn’t qualify.
Yes, I did it.
Basically, you have to create a function F(X) which returns the count of all the numbers
x ≤ X that satisfy the given conditions and print f( R ) - f(L - 1).
It required a lot of combinatorics and edge case handling.
1 Like
Is there any update for top 3000?
Can anyone provide the problem statements?
When will the result come out for top 3000? Any idea?
I just today got a mail from infosys recruitment team that i have cleared round 2 and it asked for my details, does anyone have any idea if they are contacting me for ppo(top 3000) or onsite hackathon.
Where are they going to send mail?? To participants or to TPO??
I got it in personal email
How many have you solved in round 2 ?
one complete and one with few test cases
Please post the screenshot of the mail.
When u got the mail ?
But one of my friend got information from their TPO, but still didn’t get any official mail from infosys
got the email just today only
Post you mail Screenshot .
Please say, where will be the round 2 top 3000 list will be published or is informed via email
Can you please update the condition, did your friend has received any mail now.
Please share the screenshot of your mail or paste the contents of the mail.
No official mail yet, none of his friends also
To all those asking for screenshots,
I have got the mail that says i cleared round 2 of hackwithinfy and asks about my personal details.
and chill up guys i got it just today only u may also get the mail in a day or two