Hey everyone, hope you're doing well!
I currently work as an SDE-2 at Amazon and recently had the opportunity to interview with Allen Digital for an SDE-3 backend role. The recruiter reached out to me on LinkedIn
Round 1(Machine Coding) -
Problem Statement:
You have to design and implement a logger library that applications can use to log messages.
Client/application make use of your logger library to log messages to a sink
Platform Capabilities:
Message
Sending messages
Bonus Capabilities:
Verdict: Hire
Round 2(DSA) -
Question 1:
Given a list of locations, where each location is represented by a list of regions from specific to general (e.g., ["Bengaluru", "Bellandur", "Marathahalli"]), find the smallest area (region) that contains both Area1 and Area2.
Example:
Input:
Locations = [["Bengaluru", "Bellandur", "Marathahalli", "Kormangala"], ["Karnataka", "Bengaluru", "Mysuru"], ["Maharashtra", "Mumbai", "Pune"], ["India", "Karnataka", "Maharashtra"], ["Italy", "Rome", "Venice"], ["World", "India", "Italy"]]
Area1 = "Bengaluru"
Area2 = "Pune"
Output:
Smallest area containing Area1 and Area2: "India"
LCA problem :)
Question 2:
Allen has a few classes, each with a certain number of students and a given pass ratio(number_of_students_passed / total_number_of_students_in_class). New students need to be admitted in a way that it maximises the pass ratio for Allen
Suggested an approach using priority_queue
Verdict: Hire
Round 3(HLD+LLD) -
Design AllenFit(very similar to cult.fit)
Verdict: No Hire
Overall Verdict: No Hire
Microsoft Interview Experience
Flipkart Interview Experience
Linkedin Interview Experience
Groupon Interview Experience
super.money Interview Experience