Hi,
I had my second round of phone interview on 8th October at 3:00PM. Questions were
1. Given an array A, how to circularly rotate the array for m times.
2. Given an array, it has elements first in increasing order then in decreasing order. How do you find the maximum element.
3. Given an array of characters A and a set S of characters, how do you remove the characters in the array A that are in the set S.
4. Write a function f(x,y) where x is the hours and y is the minutes, find the angle between the hours hand and minutes hand at the time x:y.
Subscribe to:
Post Comments (Atom)
4 comments:
Hi Ashvin,
One solution to the array problem is keep moving the array index until i+1 < i. Then we have found the max..but this is O(n). Is there a better solution ?
no we can use binary search as we know array is sorted.(u can view it as 2 sorted arrays)
Hi There,
I am shocked, shocked, that there is such article exist!! But I really think you did a great job highlighting some of the key "Amazon Interview - second round" in the entire space.We were experimenting with AWS and somehow linked existing accounts. AWS Tutorial USA . If I click the button to say close account then I get a message stating:
I look forward to see your next updates.
Merci,
Preethi.
Hi There,
I am shocked, shocked, that there is such article exist!! But I really think you did a great job highlighting some of the key "Amazon Interview - second round" in the entire space.We were experimenting with AWS and somehow linked existing accounts. AWS Tutorial USA . If I click the button to say close account then I get a message stating:
I look forward to see your next updates.
Merci,
Preethi.
Post a Comment