4 ms·
I would also be a lot richer if I was able to create BS of this magnitude but I can't. Here's the practice test they gave me: https://www.hackerrank.com/test/6
by willtemperley 2y ago
I would also be a lot richer if I was able to create BS of this magnitude but I can't. Here's the practice test they gave me:
https://www.hackerrank.com/test/63ek10mhil5/60d306ab105867d80fca544041154273 https://www.hackerrank.com/test/63ek10mhil5/60d306ab105867d8...
- was_in_amazon 2y agoSo what? The log parsing thing is a reasonable question, not some obscure bitshift find-a-binary-paindrome hack.
- willtemperley 2y agoThe so-what was just to confirm that Amazon do leetcode interviews, contrary to your statement.
- was_in_amazon 2y agoIf you call any coding test "leetcode like interviews" then YES
- willtemperley 2y agoYou're slowly getting it
- johnnyanmac 2y agoI'd consider - a coding test in a short time frame (30-90 minutes) - implementing some singular function that expects a singular answer - expecting time/space complexity optimizations, often those not naively thought about in said short time frame - in synthesized test environments (as opposed to something representing a real world environment) to fall under "leetcode like interviews". Log parsing can fall into either camp depending on the prompt. Once it's asking you something esoteric like to locate a timestamp in Log(N) time it starts to fall into Leetcode territory.
- was_in_amazon 2y agoThen I was right. And it seems there are a lot of sour grapes in this thread...