Filter interviews by
I appeared for an interview before Feb 2023.
Top trending discussions
posted on 5 Aug 2021
I applied via Naukri.com and was interviewed in Feb 2021. There were 3 interview rounds.
posted on 23 Nov 2023
I applied via Naukri.com and was interviewed before Nov 2022. There were 2 interview rounds.
First Round was pretty basic and coding questions was medium in Python and React.
Then coding assignment from client and then Manager Round followed by HR Round
posted on 4 Mar 2025
I appeared for an interview in Feb 2025.
Virtual round for fundamental coding.
Physical round for coding assignment given on a paper.
Twisted cables reduce electromagnetic interference and CAN voltage levels can be observed using an oscilloscope.
Twisted cables consist of pairs of wires twisted together to cancel out electromagnetic interference.
The twisting helps maintain a consistent impedance, reducing signal degradation over distance.
To see CAN voltage levels, connect the oscilloscope probes to the CAN High and CAN Low lines.
Set the oscilloscope t...
posted on 30 Oct 2023
Designing a microservice architecture for a food delivery app like Swiggy to enhance scalability and maintainability.
User Service: Handles user registration, authentication, and profile management.
Restaurant Service: Manages restaurant listings, menus, and availability.
Order Service: Processes orders, tracks status, and manages payments.
Delivery Service: Coordinates delivery personnel and tracks delivery status.
Notific...
posted on 8 May 2021
posted on 13 Jul 2022
I applied via Naukri.com and was interviewed in Jun 2022. There were 4 interview rounds.
I applied via Referral and was interviewed in Nov 2023. There were 6 interview rounds.
Duration: 1Hour 30 Minutes, 2 Coding Questions of Total 175 Marks. 1st Question has 75 marks and 2nd Question has 100 marks.
Using Bitwise OR operation to find the smallest missing number in an array.
Iterate through the array and perform Bitwise OR operation with each element to set corresponding bit in a bitmask
Iterate through the bitmask to find the first unset bit, which represents the smallest missing number
Example: Array [0, 1, 3, 4, 6] would have a bitmask of 10101, smallest missing number is 2
Extract data from a dynamic array and perform mathematical operations on it.
Identify the dynamic array structure, e.g., ['12', '15', '20'].
Convert string elements to integers for mathematical operations.
Perform operations like sum, average, or product on the extracted data.
Example: For array ['2', '3', '5'], sum = 2 + 3 + 5 = 10.
Use built-in functions like map() for conversion and reduce() for aggregation.
I appeared for an interview in Oct 2024, where I was asked the following questions.
Maximize item collection using a sliding window approach on a 1D axis.
Identify the range of positions on the x-axis where items are located.
Use two pointers to represent the current window of positions being considered.
Expand the right pointer to include more items until the window exceeds the desired range.
Contract the left pointer to reduce the window size while maintaining the maximum sum of items.
Keep track of the ...
based on 1 interview experience
Difficulty level
Duration
based on 2 reviews
Rating in categories
Senior Software Engineer
47
salaries
| ₹10.4 L/yr - ₹19 L/yr |
Design Engineer
33
salaries
| ₹4.7 L/yr - ₹13 L/yr |
Staff Engineer
19
salaries
| ₹32 L/yr - ₹40 L/yr |
Design Engineer II
18
salaries
| ₹10.9 L/yr - ₹22.7 L/yr |
Technical Lead
17
salaries
| ₹24.3 L/yr - ₹45 L/yr |
Mirafra Technologies
Carrier Midea
MediaTek India Technology
Element14