unordered_map
BAN USER
Questions (1)
Comments (6)
Followers (2)
Reputation 50
Page:
1
Comment hidden because of low score. Click to expand.
Comment hidden because of low score. Click to expand.
0
of 0 vote
Sorting requires
nlog(n)
. Can we get to linear runtime?
- unordered_map October 13, 2015Comment hidden because of low score. Click to expand.
0
of 0 vote
What if you can replant the flowers? How would you solve it then? (hint: what about equally distributing the flowers in the bed to alternate from one another)
- unordered_map October 12, 2015Comment hidden because of low score. Click to expand.
0
of 0 vote
Was this in-person or a phone interview?
- unordered_map October 12, 2015Comment hidden because of low score. Click to expand.
0
of 0 vote
Was the phone interview 30 minutes on this one question? Seems long.
- unordered_map October 12, 2015Comment hidden because of low score. Click to expand.
0
of 0 vote
This seems too easy to be a Google SE Intern question... I'm suspicious.
- unordered_map October 25, 2014Page:
1
RepYaritzaLewis, abc at 8x8
I am working as a receptionist in a Softage company. I work with the HR department to facilitate recruitment drives ...
RepDavlinaSmith, abc at ADP
I am a current residential landlord with 5 years’ experience looking to expand into commercial property management.Former florist by ...
CareerCup is the world's biggest and best source for software engineering interview preparation. See all our resources.
Can't use recursion as that's O(n) stack space and our space constraints are in-place or O(1).
- unordered_map October 13, 2015