Filter interviews by
I appeared for an interview in Jul 2024.
It was logical, good and easy. HR was supportive
posted on 23 Sep 2024
Maths , fastmaths ml
I applied via Naukri.com and was interviewed before Oct 2023. There were 3 interview rounds.
Ansible is a configuration management tool while Terraform is an infrastructure provisioning tool.
Ansible is used for automating configuration management tasks on servers.
Terraform is used for provisioning and managing infrastructure as code.
Ansible uses YAML for configuration management while Terraform uses HashiCorp Configuration Language (HCL).
Ansible is agentless, while Terraform requires an agent to be installed o...
Some new DevOps tools include Kubernetes, Terraform, and Jenkins X.
Kubernetes is a container orchestration tool used for automating deployment, scaling, and management of containerized applications.
Terraform is an infrastructure as code tool that allows for building, changing, and versioning infrastructure safely and efficiently.
Jenkins X is a CI/CD tool built on top of Jenkins that is specifically designed for cloud-n
I want to switch to DevOps because I am passionate about automation, collaboration, and continuous improvement in software development.
Passionate about automation and streamlining processes
Interested in collaborating with cross-functional teams
Excited about implementing continuous improvement practices
Seeking new challenges and opportunities for growth
I applied via Job Fair and was interviewed before Sep 2023. There were 2 interview rounds.
I have worked on performance optimization, code optimization, and SEO optimization.
Performance optimization: Minifying code, lazy loading resources, reducing server response time.
Code optimization: Refactoring code for better efficiency, reducing redundant code.
SEO optimization: Improving website speed, optimizing meta tags and content for search engines.
Trademo interview questions for popular designations
Python both MCQ and DSA question,SQL
Scraping assignment from a particular website
Top trending discussions
I applied via Campus Placement and was interviewed in Jul 2020. There were 4 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.
I applied via Company Website and was interviewed in May 2019. There were 5 interview rounds.
I applied via Company Website and was interviewed in May 2019. There were 4 interview rounds.
Implemented a new customer feedback system that increased customer satisfaction by 20%
Implemented a new customer feedback system to gather insights and improve customer experience
Analyzed feedback data to identify common issues and areas for improvement
Implemented changes based on feedback to address customer concerns and enhance overall satisfaction
Trained team members on how to effectively use the new system and inte...
based on 3 interviews
Interview experience
5-6 Yrs
Not Disclosed
3-6 Yrs
Not Disclosed
3-6 Yrs
Not Disclosed
Software Developer
9
salaries
| ₹6.5 L/yr - ₹13.8 L/yr |
Data Engineer
8
salaries
| ₹6.3 L/yr - ₹11.9 L/yr |
Software Engineer
5
salaries
| ₹7 L/yr - ₹10 L/yr |
Software Development Engineer
5
salaries
| ₹11.5 L/yr - ₹20 L/yr |
Data Research Analyst
5
salaries
| ₹3 L/yr - ₹4 L/yr |
Flipkart
Amazon
Snapdeal
Paytm