Round 1 : Aug 2026:
No show interviewer (reshcheduled)
08/2026-Phone Screening
- introduction and about all taks in Current company.
- challenging and impactful tasks you have done, 1 indepth implementation STAR format.
- Write an Optimized Code for finding the Max Continuous Sequence with sum 0
Array = 12, -1, 1, -5, 1, 4, 2, -2, 4
//Answer: count = 7 , <1, 7>
(LOOP INTERVIEW started):
Round 1: (LLD) Sep 2026
Introduction, any impactful work.
LLD- multiple logs are coming from modules and we are flashing them to flash partition of size 96kb ."in-memory logging system"
Leadership Priniciple:
- Have Backbone; Disagree and Commit.
- Deliver Results in tight deadline.
Round 2: (HLD)
- Asked to design a smart thermostat, that will transmit data over the air as well. start from software components and then we will look into input components.
- LP's:
Ownership- time when you decided to tackle a problem outside the scope of your role.
Bias for action - Time when you took risk in a project.
Round 3: (DSA- problem solving)
- Introduction, Informed he will ask 2 DSA but I was able to resolved only 1.
- Firmware Telemetry Buffer:
You are working on the firmware of an IoT device that stores a sequence of sensor readings in a buffer:
readings = [1, 1, 4, 2, 3]
The device has a target value x. Due to a power or memory constraint, the firmware needs to remove readings from the buffer until the total removed
value is exactly x.
In one operation, the firmware can remove only the oldest reading (leftmost) or the newest reading (rightmost) from the buffer. Once a reading is removed,
it is no longer available for future operations.
Your task is to determine the minimum number of readings that need to be removed to make the total removed value exactly x.
If it is not possible to reach exactly x, return -1.
Example:
readings = [1, 1, 4, 2, 3]
x = 5
One optimal sequence is:
Remove 3 → remaining [1, 1, 4, 2], x = 2
Remove 2 → remaining [1, 1, 4], x = 0
So the answer is: 2
[3,2,20,1,1,3], x = 10
ans = 1
Constraints:
Each reading is an integer.
You can remove only the leftmost or rightmost reading.
Every removed reading permanently modifies the buffer.
Return the minimum number of operations required.
Return -1 if x cannot be reduced to exactly 0.
1 <= readings.length <= 105
1 <= readings[i] <= 104
1 <= x <= 109
Time complexity and Space complexity for above question?
- LPs ->Deep Dive and Customer obsession, how you use AI , and what are the uses in work, both were ex qualcomm so they asked if you use AI in bring ups as well?
Round 4:(bar raiser)
(Software engineering Leader)- very friendly and cooperative interviewer, he was from other team.
Due to network it was lagging, he said if you want to close your camera you can.
-
Gave LRU cache to implement in 0(1), after explanation gave another question and asked to solve any one of them as per my convienience.
-
Given a list of strings, group the ones that are anagrams of each other. e.g.
["eat","tea","tan","ate","nat","bat"] → [["eat","tea","ate"],["tan","nat"],["bat"]].
Order doesn't matter.
-> I chose ques. 2 ,asked 3 follow up to write code if we have stream of inputs with seperation, find edge cases of input asked for TC and SC.(30 minutes)
LP's:
(insist on high standard)-> (disagreement with manager / convincing your manager / time you failed and bounced back).
