Filter interviews by
Basic coding questions were asked
Top trending discussions
I applied via Referral and was interviewed before Sep 2021. There were 2 interview rounds.
Moderate difficult with business reasoning
I applied via Company Website and was interviewed in Dec 2023. There were 2 interview rounds.
I applied via Naukri.com and was interviewed in Mar 2024. There was 1 interview round.
Kubernetes is an open-source container orchestration platform for automating deployment, scaling, and management of containerized applications.
Kubernetes helps in automating the deployment, scaling, and management of containerized applications.
It provides features like self-healing, load balancing, and storage orchestration.
Kubernetes uses declarative configuration to define the desired state of the application.
It supp...
Horizontal Pod Autoscaler (HPA) is a Kubernetes feature that automatically scales the number of pods in a deployment based on CPU or custom metrics.
HPA helps ensure optimal resource utilization by automatically adjusting the number of pods in a deployment based on resource usage.
It can be configured to scale based on CPU utilization or custom metrics like requests per second.
For example, if a deployment is experiencing...
2 questions based on DSA
JVM stands for Java Virtual Machine, responsible for executing Java programs. Garbage collector is a part of JVM that manages memory by reclaiming unused objects.
JVM is an abstract computing machine that enables a computer to run Java programs.
Garbage collector in JVM automatically manages memory by deallocating objects that are no longer needed.
Examples of garbage collectors in JVM include Serial, Parallel, CMS, G1, a
Coding Assessment - 2 questions
Test duration -90 min , topic - general reasoning
Code to delete duplicate nodes in a sorted linked list
Traverse the linked list and compare adjacent nodes
If nodes are equal, delete one of them
Repeat until all duplicates are removed
Printing all root to leaf paths in a binary search tree
Traverse the tree recursively and keep track of the current path
When a leaf node is reached, add the current path to the list of paths
Print all the paths in the list
Use an array of strings to store the paths
Find two integers in an array whose sum is closest to zero.
Sort the array in ascending order.
Initialize two pointers at the beginning and end of the array.
Move the pointers towards each other until the sum is closest to zero.
Count set bits in a 32-bit integer in linear time
Use bit manipulation to count set bits
Divide the integer into 16-bit chunks and count set bits in each chunk
Use lookup tables to count set bits in each 8-bit chunk
Use parallel processing to count set bits in multiple integers simultaneously
To determine the width of a binary tree using breadth-wise traversal, we need to count the number of nodes at each level.
Perform a breadth-first traversal of the binary tree
Count the number of nodes at each level
Keep track of the maximum number of nodes seen at any level
Return the maximum number of nodes seen
Files are preferred over databases for certain types of data and applications.
Files are faster for small amounts of data.
Files are easier to manage and backup.
Files are more flexible for certain types of data, such as images or videos.
Databases are better for complex data relationships and queries.
Databases are more secure and scalable for large amounts of data.
The choice between files and databases depends on the spec
based on 1 interview
Interview experience
Software Engineer
10
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Engineer
8
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Product Manager
7
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Devops Engineer
7
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
7
salaries
| ₹0 L/yr - ₹0 L/yr |
Talend Data Integration Services
Informatica
TIBCO Software
SAS