Filter interviews by
Experienced Lead DevOps Engineer with expertise in cloud infrastructure, automation, CI/CD pipelines, and team management.
Over 8 years of experience in DevOps roles
Proficient in AWS, Azure, and Google Cloud Platform
Strong background in scripting languages like Python, Bash, and PowerShell
Implemented CI/CD pipelines using tools like Jenkins, GitLab CI/CD, and CircleCI
Managed and mentored teams to improve efficiency and
A Single Page Application (SPA) is a web application that loads a single HTML page and dynamically updates the page as the user interacts with it.
SPA applications use AJAX and HTML5 to create fluid and responsive user experiences.
They often rely on frameworks like Angular, React, or Vue.js to manage the application's state and handle routing.
Examples of SPAs include Gmail, Facebook, and Twitter.
DOM stands for Document Object Model. It is a programming interface for web documents that allows scripts to dynamically access and update the content, structure, and style of a webpage.
DOM is a tree-like structure that represents the elements of an HTML document.
It allows developers to manipulate the content and structure of a webpage using JavaScript.
DOM provides methods and properties for interacting with HTML eleme
I applied via Referral and was interviewed in Apr 2022. There were 2 interview rounds.
Angular js
Top trending discussions
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)
based on 2 interviews
Interview experience
based on 10 reviews
Rating in categories
Senior Software Developer
5
salaries
| ₹5.9 L/yr - ₹8.5 L/yr |
Java Developer
4
salaries
| ₹3.5 L/yr - ₹6.6 L/yr |
Quality Analyst
4
salaries
| ₹2.2 L/yr - ₹3 L/yr |
HR Recruiter
4
salaries
| ₹1.2 L/yr - ₹2.8 L/yr |
Software Developer
3
salaries
| ₹3 L/yr - ₹6.6 L/yr |
TCS
Accenture
Infosys
Wipro