Filter interviews by
Top trending discussions
I applied via Referral and was interviewed in Dec 2020. There were 7 interview rounds.
End to end automation cycle involves automating the entire software development process from planning to deployment.
The cycle starts with requirements gathering and planning
Next, the code is developed and tested using automation tools
Continuous integration and delivery are used to deploy the code to production
Monitoring and feedback are used to improve the process
Examples of automation tools include Jenkins, Selenium,
Find median of 2 sorted arrays in O(log N) time complexity and O(1) space complexity
Use binary search to find the partition point in both arrays
Calculate the median based on the partition point and array sizes
Adjust the partition points based on the median value
Repeat until the partition points are at the median
Handle edge cases such as empty arrays and uneven array sizes
Anagram of strings in O(1) space complexity
Use a fixed size array of integers to store the frequency of characters in the first string
Iterate through the second string and decrement the frequency of each character in the array
If all the frequencies are zero, then the strings are anagrams
Return true or false accordingly
Level order traversal of a tree using Queue
Create a queue and add the root node to it
While the queue is not empty, remove the front node and print its value
Add the left and right child nodes of the removed node to the queue
Repeat until the queue is empty
Reverse level order traversal of a tree using Queue
Create a queue and push the root node into it
While the queue is not empty, pop the front node and push its children into the queue
Add the popped node to a stack
Once the queue is empty, pop elements from the stack and print them
BFS and DFS are graph traversal algorithms. BFS explores nodes level by level while DFS explores nodes depth by depth.
BFS uses a queue while DFS uses a stack or recursion.
BFS is optimal for finding shortest path while DFS is optimal for finding a path between two nodes.
BFS requires more memory as it stores all the nodes at each level while DFS requires less memory.
BFS can be used to find connected components while DFS
Find product of each element of an array except that element in O(N) time complexity without using / operation
Use prefix and suffix products
Multiply prefix and suffix products for each element to get the final product
Handle edge cases where array has 0 or 1 element separately
Recursively delete a linked list
Create a recursive function that takes the head of the linked list as input
Base case: if the head is null, return
Recursively call the function with the next node as input
Delete the current node
Recursively delete a linked list from the end.
Start from the head and recursively traverse to the end of the list.
Delete the last node and set the second last node's next pointer to null.
Repeat until the entire list is deleted.
Use a recursive function to implement the deletion process.
Recursively delete a tree by deleting all its child nodes and then the parent node.
Start from the leaf nodes and delete them first.
Then move up to the parent nodes and delete them.
Repeat until the root node is deleted.
Use post-order traversal to ensure child nodes are deleted before parent nodes.
Recursively delete elements from the end of an array.
Create a recursive function that removes the last element of the array.
Call the function recursively until the desired number of elements are removed.
Handle edge cases such as empty arrays and removing more elements than the array contains.
Floyd Warshall finds shortest path between all pairs of vertices while Djikstra finds shortest path from a single source.
Floyd Warshall is used for dense graphs while Djikstra is used for sparse graphs.
Floyd Warshall has a time complexity of O(n^3) while Djikstra has a time complexity of O((n+m)logn).
Floyd Warshall can handle negative edge weights while Djikstra cannot.
Floyd Warshall can detect negative cycles while Dj
There is no known algorithm to find shortest path in 2-D space in O(log N) time.
The best known algorithm for finding shortest path in 2-D space is Dijkstra's algorithm which has a time complexity of O(N^2).
Other algorithms like A* and Bellman-Ford have better time complexity but still not O(log N).
If the points are on a grid, Lee algorithm can be used which has a time complexity of O(N).
Design a system for putting newspapers using classes and functions
Create a Newspaper class with attributes like title, date, and content
Create a Publisher class with methods to publish and distribute newspapers
Create a Subscriber class with methods to subscribe and receive newspapers
Use inheritance to create different types of newspapers like daily, weekly, etc.
Implement a database to store newspaper information and ha
I believe practical experience is more valuable than higher studies.
I have gained valuable experience through internships and projects.
I prefer hands-on learning and problem-solving over theoretical knowledge.
I am constantly learning and improving my skills through online courses and workshops.
posted on 4 Nov 2021
I applied via Recruitment Consultant and was interviewed before Nov 2020. There were 3 interview rounds.
posted on 3 Nov 2022
I applied via Campus Placement and was interviewed before Nov 2021. There were 3 interview rounds.
There are 30 basic aptitude question in 30 minutes
3 coding question 2 were easy and 1 was of medium level
I applied via Campus Placement and was interviewed before Sep 2021. There were 4 interview rounds.
Math and verbal round .
General topics to speak
Implement a function to find duplicates in an array of strings using Hashmap.
Create a Hashmap to store the frequency of each string in the array
Iterate through the array and check if the frequency of any string is greater than 1
If yes, add it to the list of duplicates
Return the list of duplicates
I applied via Referral and was interviewed in Apr 2021. There were 3 interview rounds.
I applied via Recruitment Consultant and was interviewed in May 2019. There were 4 interview rounds.
I was interviewed before Sep 2020.
Round duration - 90 minutes
Round difficulty - Medium
It was Technical + Aptitude MCQ round.The technical section consisted if MCQ related to DSA,OS,DBMS.The aptitude section consisted of questions related to basic mathematics.
Prateek is a kindergarten teacher with a mission to distribute candies to students based on their performance. Each student must get at least one candy, and if two s...
The task is to distribute candies to students based on their performance while minimizing the total candies distributed.
Create an array to store the minimum candies required for each student.
Iterate through the students' ratings array to determine the minimum candies needed based on the given criteria.
Consider the ratings of adjacent students to decide the number of candies to distribute.
Calculate the total candies req...
Round duration - 30 minutes
Round difficulty - Medium
It was a technical interview testing the basic skills of OS and DBMS of candidates along with few project discussions from your CV.
List of 15 Linux commands with their functions
ls - list directory contents
pwd - print working directory
cd - change directory
mkdir - make a new directory
rm - remove files or directories
cp - copy files and directories
mv - move or rename files and directories
grep - search for patterns in files
chmod - change file permissions
ps - display information about running processes
top - display and update sorted information about pr...
DDL is used to define the structure of database objects, while DML is used to manipulate data within those objects.
DDL includes commands like CREATE, ALTER, DROP to define database objects like tables, indexes, etc.
DML includes commands like INSERT, UPDATE, DELETE to manipulate data within tables.
Example of DDL: CREATE TABLE employees (id INT, name VARCHAR(50));
Example of DML: INSERT INTO employees VALUES (1, 'John Doe
Tip 1 : Be clear about the concepts of Linux and shell scripting.
Tip 2 : Learn about the basics of Data structures and Algorithm.
Tip 3 : Be prepared to explain your projects mentioned in your CV.
Tip 1 : Use professional Keywords in your resume.
Tip 2 : Don't mention anything you are not confident in.
based on 1 interview
Interview experience
based on 6 reviews
Rating in categories
Senior Software Engineer
91
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Engineer
90
salaries
| ₹0 L/yr - ₹0 L/yr |
Staff Engineer
88
salaries
| ₹0 L/yr - ₹0 L/yr |
L2 Engineer
60
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
43
salaries
| ₹0 L/yr - ₹0 L/yr |
Oracle Cerner
Veradigm
Athenahealth Technology
McKesson