Status: 2 YOE
Position: SDE1 at Amazon
Location: Seattle, WA
Onsite 5 rounds (the lunch does not count)

Leadership Principles + SDI
Design parking lot system  Leadership Principles + Coding
Reverse string using recursion
Number of island but 8 directional instead of N, E, S, W  Leadership Principles + Coding
Return the index of duplicate letter.
Given the inefficient function, optimize it (you may use more space) but make sure the optimized function works EXACTLY the same as the old one
int inefficientOne(string s) {
for (int i = 0; i < s.size(); ++i)
for (int j = i + 1; j < s.size(); ++j)
if (s[i] == s[j]) return i;
return 1;
}
The gotcha here is that you should be careful with the edge cases like â€śbaabâ€ť
The inefficient one returns 0 but if you didnâ€™t catch this and youâ€™re not careful with the hashmap it would return 1.
 Leadership Principles + Coding
 Evaluate Division (https://leetcode.com/problems/evaluatedivision/)
 It needs to handle A/B = 0.0 so itâ€™s slightly different from the leetcode
 Leadership Principles + Coding
Evaluate â€śA + B + C / 10 + (E + G)â€ť given map (A > 1, B > 2, C > 3, E > 4, G > 5)
 Solve using stack
 Solve using recursion
 Solve using tree
This is a calculator problem https://leetcode.com/problems/basiccalculatoriii/