Filter interviews by
Implementing a rate limiter using a sliding window algorithm to control request rates efficiently.
A sliding window allows tracking requests over a specified time frame.
It divides time into fixed intervals (e.g., 1 minute) and counts requests in the current interval.
When a request comes in, check if the count exceeds the limit; if yes, deny the request.
Example: Allow 100 requests per minute; if 101st request comes ...
Reverse a linked list
Iterate through the linked list and reverse the pointers
Use three pointers to keep track of current, previous, and next nodes
Update the pointers accordingly to reverse the list
Unit testing is a software testing method where individual units or components of a software are tested in isolation.
Identify the unit to be tested
Write test cases to cover different scenarios
Use testing frameworks like JUnit or NUnit
Mock external dependencies for isolated testing
Create a Kanban board in React during live coding interview
Use React components to represent different sections of the Kanban board (e.g. To Do, In Progress, Done)
Implement drag and drop functionality for moving tasks between sections
Utilize state management (e.g. useState) to track the tasks and their statuses
Style the board using CSS or a UI library like Material-UI
3G call flow involves multiple steps including network registration, call setup, and data transfer.
User equipment (UE) registers with the network by sending a Location Update Request.
Network authenticates the UE and assigns it a temporary identity.
UE initiates a call by sending a Setup Request to the network, which then establishes a connection with the called party.
Data transfer occurs between the two parties ove...
23 to 3G handover is a process where a mobile device switches from a 2G network to a 3G network for better data speeds and coverage.
Handover process involves the mobile device connecting to a new network while maintaining the ongoing call or data session.
The switch from 2G to 3G network is triggered based on factors like signal strength, network congestion, and data speed requirements.
During handover, the mobile d...
Mutex is a locking mechanism to ensure exclusive access to a shared resource, while semaphore is a signaling mechanism to control access to a shared resource.
Mutex allows only one thread to access the shared resource at a time, while semaphore can allow multiple threads to access the shared resource simultaneously.
Mutex is binary, meaning it has only two states - locked and unlocked, while semaphore can have multi...
Reverse a linked list using recursion
Create a recursive function that takes the head of the linked list as input
Base case: if the head is null or the next node is null, return the head
Recursively call the function with the next node as input
Set the next node's next pointer to the current node
Set the current node's next pointer to null
Return the new head of the reversed linked list
To find max number in linked list using stack.
Create an empty stack.
Traverse the linked list and push each element onto the stack.
Pop elements from the stack and compare with max value.
Return the max value.
Reverse a linked list using recursion
Create a recursive function that takes the head of the linked list as input
Base case: if the head is null or the next node is null, return the head
Recursively call the function with the next node as input
Set the next node's next pointer to the current node
Set the current node's next pointer to null
Return the new head of the reversed linked list
One take home assignment
I appeared for an interview in May 2025, where I was asked the following questions.
The 3Sum problem involves finding unique triplets in an array that sum to zero.
Sort the array to facilitate easier triplet finding.
Use a loop to fix one element and apply two-pointer technique for the rest.
Skip duplicates to ensure unique triplets are counted.
Example: For input [-1, 0, 1, 2, -1, -4], the output is [[-1, -1, 2], [-1, 0, 1]].
Merge k sorted arrays into a single sorted array efficiently.
Use a min-heap to efficiently get the smallest element from the k arrays.
Initialize the heap with the first element of each array.
Extract the minimum element from the heap, and add the next element from the same array to the heap.
Repeat until all elements from all arrays are processed.
Time complexity is O(N log k), where N is the total number of elements.
Implementing a rate limiter using a sliding window algorithm to control request rates efficiently.
A sliding window allows tracking requests over a specified time frame.
It divides time into fixed intervals (e.g., 1 minute) and counts requests in the current interval.
When a request comes in, check if the count exceeds the limit; if yes, deny the request.
Example: Allow 100 requests per minute; if 101st request comes in, b...
Create a Kanban board in React during live coding interview
Use React components to represent different sections of the Kanban board (e.g. To Do, In Progress, Done)
Implement drag and drop functionality for moving tasks between sections
Utilize state management (e.g. useState) to track the tasks and their statuses
Style the board using CSS or a UI library like Material-UI
Unit testing is a software testing method where individual units or components of a software are tested in isolation.
Identify the unit to be tested
Write test cases to cover different scenarios
Use testing frameworks like JUnit or NUnit
Mock external dependencies for isolated testing
2 coding questions in c/c++, 1 hr 30 mins - no. of deletions/additions needed to make 1 string equal to another. 2. print frequency of each number in array
I applied via Referral and was interviewed before Sep 2023. There were 3 interview rounds.
Two problems, one easy and another medium level.
Reverse a linked list
Iterate through the linked list and reverse the pointers
Use three pointers to keep track of current, previous, and next nodes
Update the pointers accordingly to reverse the list
I applied via Referral and was interviewed before Apr 2023. There were 3 interview rounds.
3G call flow involves multiple steps including network registration, call setup, and data transfer.
User equipment (UE) registers with the network by sending a Location Update Request.
Network authenticates the UE and assigns it a temporary identity.
UE initiates a call by sending a Setup Request to the network, which then establishes a connection with the called party.
Data transfer occurs between the two parties over the...
23 to 3G handover is a process where a mobile device switches from a 2G network to a 3G network for better data speeds and coverage.
Handover process involves the mobile device connecting to a new network while maintaining the ongoing call or data session.
The switch from 2G to 3G network is triggered based on factors like signal strength, network congestion, and data speed requirements.
During handover, the mobile device...
I applied via Referral and was interviewed before Jun 2023. There were 2 interview rounds.
One hour Leet code medium question
Reverse a linked list using recursion
Create a recursive function that takes the head of the linked list as input
Base case: if the head is null or the next node is null, return the head
Recursively call the function with the next node as input
Set the next node's next pointer to the current node
Set the current node's next pointer to null
Return the new head of the reversed linked list
To find max number in linked list using stack.
Create an empty stack.
Traverse the linked list and push each element onto the stack.
Pop elements from the stack and compare with max value.
Return the max value.
I applied via Referral and was interviewed before Oct 2022. There were 5 interview rounds.
Checked general aptitude
Multiple coding rounds each tougher than the last
I applied via Naukri.com and was interviewed before Apr 2022. There were 3 interview rounds.
Aptitude relates questions... It was modratley difficult
Reverse a linked list using recursion
Create a recursive function that takes the head of the linked list as input
Base case: if the head is null or the next node is null, return the head
Recursively call the function with the next node as input
Set the next node's next pointer to the current node
Set the current node's next pointer to null
Return the new head of the reversed linked list
Mutex is a locking mechanism to ensure exclusive access to a shared resource, while semaphore is a signaling mechanism to control access to a shared resource.
Mutex allows only one thread to access the shared resource at a time, while semaphore can allow multiple threads to access the shared resource simultaneously.
Mutex is binary, meaning it has only two states - locked and unlocked, while semaphore can have multiple s...
Top trending discussions
based on 10 interview experiences
Difficulty level
Duration
based on 58 reviews
Rating in categories
Bangalore / Bengaluru
8-13 Yrs
₹ 9-40 LPA
Bangalore / Bengaluru
9-14 Yrs
₹ 10.5-42 LPA
Software Engineer
2.8k
salaries
| ₹16.8 L/yr - ₹39.5 L/yr |
Technical Consulting Engineer
690
salaries
| ₹9.8 L/yr - ₹30.3 L/yr |
Senior Software Engineer
655
salaries
| ₹24.6 L/yr - ₹45 L/yr |
Network Engineer
397
salaries
| ₹5.6 L/yr - ₹14 L/yr |
Technical Lead
351
salaries
| ₹31.1 L/yr - ₹55.4 L/yr |
Microsoft Corporation
Sterlite Technologies
Nokia Networks