Filter interviews by
I appeared for an interview in Oct 2024.
Jenkins shared library allows you to define reusable code that can be shared across multiple Jenkins pipelines.
Shared libraries are stored in a Git repository and can be referenced in Jenkins pipelines using the @Library annotation.
Shared libraries can contain functions, variables, and classes that can be used in Jenkins pipelines.
Shared libraries help in maintaining consistency and reusability across Jenkins pipelines...
CI/CD flow involves continuous integration and continuous deployment processes to automate software delivery.
Continuous Integration (CI) involves automatically building and testing code changes frequently.
Continuous Deployment (CD) automates the deployment of code changes to production.
CI/CD tools like Jenkins, GitLab CI/CD, and CircleCI help streamline the process.
Version control systems like Git are essential for tra...
Groovy script is a dynamic scripting language for the Java platform.
Groovy is similar to Java but with more concise syntax and dynamic typing.
It can be used for scripting, testing, and building applications.
Example: println 'Hello, World!'
Jenkins master manages the configuration and distribution of work to Jenkins slaves.
Jenkins master is the main server that manages the configuration and distribution of work to Jenkins slaves.
Jenkins slaves are worker nodes that execute the build jobs sent by the master.
Master can communicate with multiple slaves to distribute workload efficiently.
Slaves can be set up on different machines to parallelize the build proc...
I applied via Company Website and was interviewed in Dec 2023. There was 1 interview round.
I applied via Referral and was interviewed in May 2024. There was 1 interview round.
The coding round has 3 questions and the time was limited.
Write a program in React which contain two tables, first table contains list of cricket players with info like name, matches played, total runs, select button. upon select of the player add the selected player to below table with the same info and unselect button, upon unselect keep it back in the above table.
Chewy interview questions for popular designations
I applied via Recruitment Consultant and was interviewed before Jul 2020. There was 1 interview round.
I applied via Naukri.com
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 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 4 interviews
Interview experience
Amazon
Flipkart
Amazon Development Centre India
Udaan