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
Remove duplicates from a linked list
Traverse the linked list and keep track of seen values using a hash set
If a value is already in the hash set, remove the duplicate node
Update the next pointers accordingly
Validate if an IP address is in a valid format
Split the IP address into 4 parts using the dot as a delimiter
Check if each part is a number between 0 and 255
Ensure there are exactly 4 parts in the IP address
MCQ based on c++ and java
Solve 5 DSA questions
Sorting algorithms are used to arrange elements in a specific order.
Common sorting algorithms include bubble sort, selection sort, insertion sort, merge sort, quick sort, and heap sort.
Each sorting algorithm has its own time complexity and space complexity.
Sorting algorithms can be implemented in various programming languages such as C++, Java, Python, etc.
I applied via Campus Placement and was interviewed in Mar 2021. There were 4 interview rounds.
posted on 28 Jul 2021
I applied via Campus Placement and was interviewed before Jul 2020. There was 1 interview round.
Check if binary tree is balanced or not.
A balanced binary tree has the height of left and right subtrees differ by at most 1.
Recursively check the height of left and right subtrees and compare.
Use a helper function to calculate the height of a subtree.
Time complexity: O(nlogn) for a balanced tree, O(n^2) for a skewed tree.
Detect loops in a linked list.
Use two pointers, one moving at a faster pace than the other.
If there is a loop, the faster pointer will eventually catch up to the slower one.
To detect the start of the loop, reset one pointer to the head and move both pointers at the same pace.
posted on 15 Jul 2022
I applied via Referral and was interviewed before Jul 2021. There were 3 interview rounds.
If you are a fresher , then this is for you else almost no coding test for experienced candidates.
It represents the eligibility of person and thinking process ,view of thoughts
Skills ,fast typing , experienced ,new ideas
Deeply study case and make a point to make attractive
I applied via Referral and was interviewed before Aug 2021. There were 2 interview rounds.
General topics like mathe, English, social etc
They totally select you on the basis of aptitude only
I applied via Walk-in and was interviewed in Jul 2023. There were 2 interview rounds.
Asked basic questions on aptitude and reasoning
It cosist of some aptitude questions
based on 1 interview
Interview experience
Software Engineer
73
salaries
| ₹3.8 L/yr - ₹13.7 L/yr |
Softwaretest Engineer
59
salaries
| ₹2.4 L/yr - ₹7.2 L/yr |
Senior Software Engineer
40
salaries
| ₹7 L/yr - ₹15 L/yr |
Production Analyst
19
salaries
| ₹3 L/yr - ₹7 L/yr |
Software Developer
18
salaries
| ₹4 L/yr - ₹13.2 L/yr |
Maxgen Technologies
Value Point Systems
JoulestoWatts Business Solutions
F1 Info Solutions and Services