_anonymous
BAN USER
Forum Posts (2)
Comments (2)
Reputation 145
- 2 Answers Question about getting to Google Hiring committee
I came across a blog which claimed that you get to the hiring committee only if HR wants to make you an offer. Is that true? Does that mean the feedback you had was at least worth considering (>=3 in the 1-4 rating scheme) ?
- _anonymous October 04, 2012
Reading other blogs (including Gayle's), it seems like every candidate who had an onsite goes to the hiring committee, irrespective of how they did.
Can someone please clarify?
Thanks.| Flag | PURGE
Page:
1
Comment hidden because of low score. Click to expand.
Comment hidden because of low score. Click to expand.
14
of 16 vote
Assuming each byte is a character of the string (so basically 256 characters possible).
Create a suffix tree and find the node closest to the root which does not have 256 children.
Page:
1
CareerCup is the world's biggest and best source for software engineering interview preparation. See all our resources.
Use Narayan Pandita's algorithm on 0000...11111 where there are n-k zeroes and k ones. It is a bit vector representation of the set.
(C++ has std::next_permutation and std::next_combination for this, I believe).
We can also write a recursive version, which uses linear amount of space (and not Theta(n^k)).
Pseudo code:
Exercise: Modify the above recursive version to print all subsets of size less than or equal to k.
- _anonymous September 22, 2012