Filter interviews by
I applied via Job Portal and was interviewed before Apr 2023. There were 4 interview rounds.
Coding round on D2C - codehers
Move all 0s to the end of the array while maintaining the order of other elements.
Iterate through the array and keep track of the index to place non-zero elements.
After iterating, fill the remaining positions with 0s.
Top trending discussions
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
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();
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.
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 Naukri.com and was interviewed in Oct 2020. There was 1 interview round.
Second level cache is a caching mechanism used to improve performance by storing frequently accessed data in memory.
Second level cache is implemented at the application level and can be configured using frameworks like Hibernate.
To optimize SQL queries, one can use indexes, avoid using SELECT *, and use JOINs instead of subqueries.
SOLID principles are a set of design principles for writing maintainable and scalable cod...
To deploy an application in AWS, you need to create an EC2 instance, configure security groups, install necessary software, and upload your application code.
Create an EC2 instance in the desired region and select the appropriate instance type
Configure security groups to allow traffic to and from the instance
Install necessary software and dependencies on the instance
Upload your application code to the instance
Start the ...
I applied via Company Website and was interviewed before Aug 2020. There were 4 interview rounds.
I applied via Campus Placement and was interviewed in Dec 2020. There were 4 interview rounds.
I applied via Recruitment Consulltant and was interviewed before Jun 2021. There was 1 interview round.
BigInteger is used for mathematical operations involving very large integers in Java.
BigInteger is used when the range of values supported by primitive data types like int and long is not sufficient.
It is commonly used in cryptography and security applications.
It provides methods for arithmetic, bitwise, and logical operations on large integers.
Example: calculating factorial of a large number, generating large prime nu
Merge Sort Algo code in java
Divide the array into two halves
Recursively sort the two halves
Merge the sorted halves
Time complexity: O(n log n)
based on 1 interview
Interview experience
Senior Software Engineer
34
salaries
| ₹15 L/yr - ₹60 L/yr |
Software Engineer III
15
salaries
| ₹15 L/yr - ₹37 L/yr |
Software Engineer
12
salaries
| ₹19.3 L/yr - ₹64.1 L/yr |
Software Developer
8
salaries
| ₹13.7 L/yr - ₹27 L/yr |
Data Scientist
6
salaries
| ₹24 L/yr - ₹58 L/yr |
TCS
Accenture
Wipro
Cognizant