what is your logic for getting the pairs like
for (1,2,3,4)
we had (1^2)+(2^3) or (1^2)(1^3)… and so on…
My question statement was of 2 type of queries ,for 1st query I had to add element in list, for 2nd query I had to do xor of all numbers in list with an element, at the end it is asked to return final sorted list, I have no idea about your question !!
oh okay… Mine was different though…
Earlier, I got confused from your answer as the question was different…
Guys, It is just the registration today. As you have submitted your Resume through the link provided, Google will let you know if you are invited to write the test or not based on your Resume. Got this information from Google support for this challenge.
Thank you.
Continuing the discussion from Google Online Coding Challenge - Summer Intern:
Guys, It is just the registration today. As you have submitted your Resume through the link provided, Google will let you know if you are invited to write the test or not based on your Resume. Got this information from Google support for this challenge.
Thank you.
what was your score when submitted
I have done both partially
40/60
Then there might be a great chance
Good luck
I gave the test today and got a score of 57/60 . one of the subtask did not pass. I solved one question fully correct 30/30 and on the second one as my do is weak , I tried in the short time to compelete but managed 27/30 somehow. Does anyone know if its an average, above average or below average score?
yes
this can also be done without trie, with the help of maps .!!!
if you didn’t get it how to do ,feel free to ask me further.
they will take your test in another round due to increase in participants. they will mail you your username and password in upcoming
daysYes plz!!
Hi, One of My problems is size of the smallest subset with maximum bitwise or.
https://codeforces.com/blog/entry/76177.
I didn’t get any mail bro
57/60
How long does it take to know the results?

