i
Appy Pie
Filter interviews by
Reverse a LinkedIn list
Create an empty array to store the reversed list
Iterate through the original list in reverse order and add each element to the new array
Return the reversed list array
Binary search in a Binary Search Tree (BST) involves comparing the target value with the current node's value and traversing left or right accordingly.
Start at the root node and compare the target value with the current node's value.
If the target value is less than the current node's value, move to the left child. If it's greater, move to the right child.
Repeat the process until the target value is found or the current...
Top trending discussions
I applied via Campus Placement and was interviewed in Aug 2023. There was 1 interview round.
It had 9 uqestions , one problem solving , one SQL , one API and 6 mcq
Easy assignment , if you hav eOOps knowledge you can do it
I applied via Campus Placement and was interviewed in Oct 2024. There was 1 interview round.
1 easy question based on string and core subjects amd project related questions
I applied via Job Portal and was interviewed before Apr 2023. There were 3 interview rounds.
Puzzle based questions and Math problems
Given a laptop and problem statement. Had to solve problems at eclipse.
I applied via Referral and was interviewed before Aug 2023. There were 2 interview rounds.
It consist of 3 questions on hackerrank
What is array, what is avl tree, what is b+ tree.
What is b+ tree, what is red black tree
What is avl tree, what is b+ tree
I applied via Campus Placement and was interviewed before Nov 2023. There were 2 interview rounds.
GOOGLE DOCUMEENTS, 45 MIN, NUMPY
I applied via Referral and was interviewed before May 2023. There were 3 interview rounds.
Machine coding round for an App engineer role.
Please have personal laptop setup properly
One common algorithm with graphs is Dijkstra's algorithm for finding the shortest path.
Dijkstra's algorithm is used to find the shortest path from a starting node to all other nodes in a weighted graph.
It works by maintaining a priority queue of nodes based on their distance from the starting node.
The algorithm iteratively selects the node with the smallest distance, updates the distances of its neighbors, and repeats ...
Build the conference room
based on 1 interview
Interview experience
Software Engineer
73
salaries
| ₹0 L/yr - ₹0 L/yr |
Softwaretest Engineer
42
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
40
salaries
| ₹0 L/yr - ₹0 L/yr |
Production Analyst
19
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Developer
18
salaries
| ₹0 L/yr - ₹0 L/yr |
Zoho
Freshworks
InMobi
Paytm