Filter interviews by
I applied via LinkedIn and was interviewed before Jun 2022. There were 6 interview rounds.
This was a screening test. Question was related to arrays manipulation.
This coding round was related to mathematical calculation for a given coordinates geometry problem.
This coding test was related to a tree and graph related algorithm to find the optimal solution.
I applied via LinkedIn and was interviewed before Jun 2022. There were 5 interview rounds.
Screening round. Algorithm on Array manipulation. This was comparatively easy one.
Coding around on a mathematical calculation based on some coordinate geometry scenario.
Coding around based on tree algorithm and how to optimize it.
I applied via Naukri.com and was interviewed in Jan 2022. There were 3 interview rounds.
They just asked about my previous experience and questions from my resume
Hackerrank was used for test
Implement BFS algorithm to find the nearest neighbour
Create a queue to store nodes to be visited
Start with the initial node and add it to the queue
While the queue is not empty, dequeue a node, visit its neighbours, and add them to the queue
Repeat until the nearest neighbour is found
Priority queue can be implemented using a heap data structure.
Create a min heap or max heap based on the priority order needed.
Insert elements into the heap based on their priority level.
Remove elements from the heap based on their priority level.
Heapify the heap after each insertion or deletion operation.
Example: Implementing a min heap for a priority queue where lower values have higher priority.
I applied via Naukri.com and was interviewed before Mar 2023. There were 2 interview rounds.
String manipulation using loops and conditionals for software engineering
Use loops to iterate through each character in the string
Use conditional statements to check for specific conditions and manipulate the string accordingly
Examples: reversing a string, counting occurrences of a specific character, removing whitespace
I applied via Walk-in and was interviewed in Aug 2024. There was 1 interview round.
Daemon thread is a low priority thread that runs in the background and does not prevent the JVM from exiting.
Daemon threads are used for tasks that do not require user interaction or continuous execution.
They are automatically terminated when all non-daemon threads have finished.
Set a thread as daemon using setDaemon(true) method before starting it.
Example: Thread t = new Thread(); t.setDaemon(true); t.start();
Basic aptitude questions based on profit and loss
Coding test based on c language and python programming
Communication assignment based on English
Real-time operating systems are designed to provide guaranteed response times for critical tasks.
Real-time operating systems prioritize tasks based on their urgency and importance.
They are commonly used in industries such as aerospace, automotive, and industrial automation.
Examples include VxWorks, QNX, and FreeRTOS.
I applied via Campus Placement and was interviewed before Feb 2020. There were 4 interview rounds.
I applied via Campus Placement and was interviewed in Mar 2020. There was 1 interview round.
To get the second to last element from a SQL table, use the OFFSET-FETCH clause.
Use the ORDER BY clause to sort the table in descending order.
Use the OFFSET-FETCH clause to skip the last row and fetch the second to last row.
Example: SELECT column_name FROM table_name ORDER BY column_name DESC OFFSET 1 ROWS FETCH NEXT 1 ROWS ONLY;
I applied via Company Website and was interviewed before Mar 2021. There were 3 interview rounds.
Java assesment.
Some of the top questions asked at the Microsoft Research Software Engineer2 interview -
based on 2 interviews
Interview experience
Software Engineer
52
salaries
| ₹12.8 L/yr - ₹55 L/yr |
Software Developer
36
salaries
| ₹10 L/yr - ₹26.5 L/yr |
Senior Software Engineer
32
salaries
| ₹20.6 L/yr - ₹79 L/yr |
Sde1
14
salaries
| ₹27.2 L/yr - ₹60 L/yr |
Software Engineer2
10
salaries
| ₹16 L/yr - ₹60 L/yr |
TCS
Accenture
Wipro
Cognizant