Filter interviews by
Arrays, medium level from leetcode
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.
I applied via Company Website and was interviewed in Jul 2021. There was 1 interview round.
Complex SQL scenarios and their results
Using subqueries to filter data
Joining multiple tables with complex conditions
Using window functions to calculate running totals
Pivoting data to transform rows into columns
Using recursive queries to traverse hierarchical data
I applied via Walk-in and was interviewed before Mar 2021. There were 3 interview rounds.
Aptitude test
Current affairs
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.
posted on 10 May 2020
I applied via Recruitment Consultant and was interviewed in Apr 2020. There were 4 interview rounds.
I applied via Naukri.com and was interviewed before Apr 2021. There were 2 interview rounds.
based on 1 interview
Interview experience
Customer Success Specialist
120
salaries
| ₹3.5 L/yr - ₹8.2 L/yr |
Production Analyst
54
salaries
| ₹3.2 L/yr - ₹7.4 L/yr |
Business Analyst
27
salaries
| ₹3.4 L/yr - ₹12 L/yr |
Product Manager
25
salaries
| ₹16 L/yr - ₹43 L/yr |
Medical Data Analyst
24
salaries
| ₹3 L/yr - ₹6.8 L/yr |
Maxgen Technologies
Value Point Systems
JoulestoWatts Business Solutions
F1 Info Solutions and Services