Uniphore | Staff Software Engineer | Interview Experince
Summary
Cleared multiple rounds including coding, system design, and managerial discussions. Was asked DSA questions including cycle detection in linked list and longest substring without repeating characters. Also designed systems like rate limiter.
Full Experience
Round 1 : Screening round, Resume + DSA
Questions based on resume, Current Role
Detect Cycle from LinkedList
Post screen next 3 rounds were F2F in office
Round 2 Coding & Algorithms
Brief intro and questions over resume.
One DSA Question - https://leetcode.com/problems/longest-substring-without-repeating-characters/description/
Round 3 Coding & Algorithm
After a very brief introduction jumped into the DSA for following.
Q1 Priority queue based question not bale to recall, but I have solved
Q2 https://leetcode.com/problems/median-of-two-sorted-arrays/description/
Discussed approach and started coding, failing for few test cases
Round 4 System Design
Questions around resume and directly jumed on system design.
Design rate limiter, I was prepared for this so explained well on this one
A lot of stress on failure handling.
Round 5 Resume | System Design
Questions around resume and deep dive on the recent project.
Asked to design similar kind of system as per my recent project.
Round 6 Managerial
After the intro, again resume deep dive. Understanding of existing project and what all my contributions in the existing role. Scenarios where I was able to handle pressure/mentor juniors/ managerial conflicts
Round 7 VP | Intro | Resume | DSA
Unexpectly asked binary search question with some twist which I have solved.
This was simplest round and completed within 30 min.
HR is really good, he followed pretty well on each step and provided response quickly.
Final verdict - Selected
Comp - https://leetcode.com/discuss/post/8173950/uniphore-staff-software-engineer-offer-b-e2bl/
Interview Questions (4)
Detect Cycle in Linked List
Determine if a linked list contains a cycle.
Longest Substring Without Repeating Characters
Given a string s, find the length of the longest substring without repeating characters.
Median of Two Sorted Arrays
Given two sorted arrays nums1 and nums2 of size m and n respectively, return the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)).
Binary Search with Twist
A binary search variant with a unique constraint or modification.