Filter interviews by
I applied via Indeed and was interviewed in Dec 2024. There were 3 interview rounds.
I am familiar with tools like Jenkins, Docker, Kubernetes, Git, and Ansible in DevOps.
Jenkins
Docker
Kubernetes
Git
Ansible
SDLC stands for Software Development Life Cycle, which is a process used by software development teams to design, develop, and test high-quality software.
SDLC is a structured process that consists of several phases such as planning, analysis, design, implementation, testing, and maintenance.
Each phase in the SDLC has its own set of activities and deliverables that contribute to the overall success of the software proje...
Traffic in AWS EC2 can be managed using various methods such as load balancers, auto scaling, and security groups.
Use Elastic Load Balancing to distribute incoming traffic across multiple instances for better fault tolerance and availability.
Implement Auto Scaling to automatically adjust the number of EC2 instances based on traffic demand to ensure optimal performance and cost efficiency.
Utilize security groups to cont...
AWS services commonly used in DevOps include EC2, S3, RDS, Lambda, and CloudFormation.
EC2 (Elastic Compute Cloud) for scalable virtual servers
S3 (Simple Storage Service) for object storage
RDS (Relational Database Service) for managed databases
Lambda for serverless computing
CloudFormation for infrastructure as code
Load balancers distribute incoming network traffic across multiple servers to ensure optimal resource utilization, while auto scaling automatically adjusts the number of servers based on traffic demand.
Load balancers help prevent overload on any single server by distributing traffic evenly.
Auto scaling allows for dynamic allocation of resources based on traffic patterns, ensuring efficient use of resources.
Load balance...
Use Kubernetes Ingress controllers and Horizontal Pod Autoscalers to efficiently handle traffic within a k8s cluster.
Utilize Kubernetes Ingress controllers to manage inbound traffic and route it to the appropriate services within the cluster.
Implement Horizontal Pod Autoscalers to automatically adjust the number of pods based on traffic load, ensuring cost effectiveness by scaling up or down as needed.
Consider using a ...
Optimizing docker images involves reducing image size, using multi-stage builds, and minimizing layers.
Use multi-stage builds to reduce the number of layers in the final image
Remove unnecessary files and dependencies to reduce image size
Use a smaller base image like Alpine instead of a full Linux distribution
Combine multiple RUN commands into a single command to reduce the number of layers
Use .dockerignore file to excl...
I applied via Naukri.com and was interviewed in Oct 2024. There were 2 interview rounds.
Find method returns the first element that satisfies a condition, while filter method returns all elements that satisfy a condition.
Find method returns the first element that satisfies the condition
Filter method returns all elements that satisfy the condition
Find method stops after finding the first match
Filter method goes through all elements in the array
Example: const numbers = [1, 2, 3, 4, 5]; numbers.find(num => nu...
DOM is the actual representation of the document in the browser, while Virtual DOM is a lightweight copy of the DOM used for efficient updates.
DOM is the real representation of the document in the browser, while Virtual DOM is a lightweight copy of the DOM kept in memory.
Changes to the Virtual DOM are compared with the actual DOM, and only the differences are updated in the real DOM for performance optimization.
Virtual...
Implement Google Authentication and Pagination
I applied via Referral and was interviewed before Jan 2021. There was 1 interview round.
I applied via Campus Placement and was interviewed before May 2021. There were 2 interview rounds.
Numerical ability and logical reasoning followed by some coding mcqs
Printing 1 to 100 without for loop
Use recursion to print numbers from 1 to 99
Print 100 outside the recursion
Use a base case to stop recursion at 100
I applied via Campus Placement and was interviewed before Jun 2021. There were 2 interview rounds.
Simple aptitude test
I applied via Recruitment Consultant and was interviewed before Jul 2020. There was 1 interview round.
I applied via Naukri.com
I applied via Newspaper Ad and was interviewed before Jun 2021. There were 3 interview rounds.
I appeared for an interview in Aug 2017.
Merge Sort is a divide and conquer algorithm that sorts an array by dividing it into two halves, sorting them separately, and then merging the sorted halves.
Divide the array into two halves
Recursively sort the two halves
Merge the sorted halves
Find pairs of integers in a BST whose sum is equal to a given number.
Traverse the BST and store the values in a hash set.
For each node, check if (X - node.value) exists in the hash set.
If yes, add the pair (node.value, X - node.value) to the result.
Continue traversal until all nodes are processed.
Merge overlapping time intervals into mutually exclusive intervals.
Sort the intervals based on their start time.
Iterate through the intervals and merge overlapping intervals.
Output the mutually exclusive intervals.
Example: [(1,3), (2,6), (8,10), (15,18)] -> [(1,6), (8,10), (15,18)]
Different types of hashing and alternative for Linear Chaining
Different types of hashing include division, multiplication, and universal hashing
Alternative for Linear Chaining is Open Addressing
Open Addressing includes Linear Probing, Quadratic Probing, and Double Hashing
An AVL tree is a self-balancing binary search tree where the heights of the left and right subtrees differ by at most one.
AVL tree is a binary search tree with additional balance factor for each node.
The balance factor is the difference between the heights of the left and right subtrees.
Insertion and deletion operations in AVL tree maintain the balance factor to ensure the tree remains balanced.
Rotations are performed ...
Find the minimum number of squares whose sum equals to a given number n.
Use dynamic programming to solve the problem efficiently.
Start with finding the square root of n and check if it is a perfect square.
If not, then try to find the minimum number of squares required for the remaining number.
Repeat the process until the remaining number becomes 0.
Return the minimum number of squares required for the given number n.
Insertion sort for a singly linked list.
Traverse the list and compare each node with the previous nodes
If the current node is smaller, swap it with the previous node
Repeat until the end of the list is reached
Time complexity is O(n^2)
I applied via Naukri.com and was interviewed in May 2019. There were 4 interview rounds.
based on 2 interviews
Interview experience
based on 3 reviews
Rating in categories
Associate Software Engineer
4
salaries
| ₹2.4 L/yr - ₹4.4 L/yr |
Java Developer
4
salaries
| ₹1.6 L/yr - ₹1.6 L/yr |
Software Engineer
3
salaries
| ₹1.9 L/yr - ₹5 L/yr |
Associate Software Developer
3
salaries
| ₹3 L/yr - ₹5.1 L/yr |
TCS
Accenture
Wipro
Cognizant