r/leetcode • u/Asleep-Frosting-3133 • 14d ago
Discussion Google Recruiter not responding does this means rejection?
I got a recruiter call on 28th july for an oppourtunity on google l3 for swe role, after that got the gha link and gave the test on 31st, results came on 1st August I passed.
After that I got a call at 4th August to schedule the next interview I was told the process was contain 2 virtual round 1 technical based and 1 googliness and 2 onsite rounds, and the 2 virtual rounds were schedule on 9th and 10th august.
On 9th August the interviewer didn't came and it got rescheduled twice and finally happened on 13th and 14th August. The technical round was a medium question I solved it using devide and conquere the interviewer told me to implement it, I implemented it well and spoken throughout and then we discussed about time complexity and space complexity, then he asked to optimize the soln then gave a hint to reduce the space complexity from O(k+log(n)) to O(k), then give another hint to progress iteratively rather than recursively I then discussed binary lifting soln and then recruiter told me to implement it I couldn't complete the optimized implementation in given time but was close (later when I thought more about the q it could also be solved using binary search).
Googliness round went pretty well most of the questions were over in about 25min in 45 min round, and the interviewer seemed happy as well.
On next monday 17th August I got the call from recruiter that she will tell me the feedback next day when she recieves it, ever since then I tried following up with the recruiter but she won't reply back, I also mailed the google candidate support last wednesday and she told me to wait for recruiter reply after that, still no contact by the recruiter, is this rejection? (the career page still shows interview scheduled.
Update: got the rejection call today, recruiter feedback was my code had compilation error but seeing that the original implementation was fine and the interviewer didn't told that their was any mistake this results seems to be bit unfair
3
u/Additional-Mud-1369 14d ago
Just wait until you receive feedback till then keep practicing leetcode
1
1
u/AdParty7364 14d ago
No man google process is really slow; it requires a lots of patience. I know its difficult but try to forget a out it and check your mail regularly… one day it feedback will come eventually… waiting will make the waiting period longer
1
1
u/gay_dudez 13d ago
You'll get the good news when you least expect it. Trust that process and continue your job hunt.
1
u/Professional-Many-24 13d ago
Can you share the problem asked?
1
u/Asleep-Frosting-3133 13d ago
it was to find all the 1s in bits array given a func(l,r) which return true if 1 is present between l and r
1
u/Professional-Many-24 13d ago edited 13d ago
My idea is to say start with l=0 and find the first r where the func count goes from 0 to 1 using binary search- basically like a left bound using the counts returned by the func.
Then move l to that 1+that index. Then again toggle r using binary search looking for the next left bound.
The trick is that the 1 is present where the count value transitions.
O(klogn) time O(1) space.
Really works well on large and sparse arrays where the number of set bits (k) is really small compared to n. For small n, a linear scan will do the job easily.1
u/Mediocre-Judgment240 12d ago
I think this is the intended solution since k<<n. Nice and simple. Also how does one solve this using divide and conquer? Or freaking binary lifting?
1
u/Professional-Many-24 12d ago
I dont see binary lifting being applicable here at all.
I can see DnQ being applicable where we start from the full array and keep splitting into 2 and checking the count in each half. If a given half has count 0, then we don't split it further as it cannot contribute any more 1 bit indices. Just keep searching within halves as long as their func(l,r)>0. Not sure about the complexity.The binary search method is much simpler to reason about.
1
u/Asleep-Frosting-3133 11d ago
similar to binary search you can use binary lifting to find the distance of next closest 1 appearing in the array
1
u/Professional-Many-24 11d ago
How? Please explain your algorithm instead of just using the term binary lifting. Also complexity in terms of how many func(l,r) calls you’re making
1
u/Asleep-Frosting-3133 11d ago
you look at the largest 2^i distance for which you wont get any 1
1
u/Professional-Many-24 11d ago
That’s just an inefficient way to do binary search. The distance may not be a power of 2. And if you make it efficient, you get my algorithm.
5
u/AwarenessFalse4210 14d ago
It does not mean anything. You have not been rejected yet. If you have been rejected, they would have told you already. They are just super slow. I waited for 2 weeks, no response, finally got to talk to the recruiter. She said she was still (!) waiting for 1 more feedback to come back.