Filter interviews by
I applied via Campus Placement and was interviewed in Sep 2023. There were 3 interview rounds.
Duration was around 105 minutes
aptitude, python and java were sections in this round
Languages based in SQL include T-SQL, PL/SQL, and SQL/PSM.
T-SQL (Transact-SQL) is Microsoft's proprietary extension to SQL used in SQL Server.
PL/SQL (Procedural Language/SQL) is Oracle's procedural language extension to SQL.
SQL/PSM (SQL/Persistent Stored Modules) is a standard for defining stored procedures and functions in SQL.
Object-oriented programming concepts that focus on classes and objects
Encapsulation: bundling data and methods that operate on the data within a single unit
Inheritance: ability of a class to inherit properties and behavior from another class
Polymorphism: ability to present the same interface for different data types
Abstraction: hiding the complex implementation details and showing only the necessary features
Two coding questions, one is easy and the other is difficult. Who solved 2nd question was shortlisted for an interview.
Two easy questions two wasy questions two easy questions two easy questions
I applied via Referral and was interviewed in Aug 2021. There was 1 interview round.
Find k min elements in given array.
Sort the array and return the first k elements.
Use a min heap of size k to find the k min elements.
Use quickselect algorithm to find the kth smallest element and return first k elements smaller than it.
Check if a given tree is a Binary Search Tree (BST) or not.
Traverse the tree in-order and check if the elements are in ascending order.
Check if the maximum value in the left subtree is less than the root and the minimum value in the right subtree is greater than the root.
Use recursion to check if all subtrees are BSTs.
Time complexity: O(n), Space complexity: O(h) where h is the height of the tree.
Given a BST and a sum, find a pair of nodes whose values add up to the given sum.
Traverse the BST in-order and store the nodes in a list
Use two pointers approach to find the pair with the given sum
If the sum is less than the current pair, move the right pointer to the left
If the sum is greater than the current pair, move the left pointer to the right
If the sum is equal to the current pair, return the pair
Time complexit
1 coding question, and basic MCQ
I applied via Campus Placement and was interviewed in Oct 2024. There were 2 interview rounds.
Loop in linked list is a situation where a node points to a previous node in the list, creating an infinite loop.
Check for loops using Floyd's cycle detection algorithm
Use two pointers, one moving twice as fast as the other, to detect a loop
If the fast pointer catches up to the slow pointer, there is a loop
I applied via Walk-in and was interviewed before Mar 2022. There were 2 interview rounds.
I applied via Company Website and was interviewed in Jan 2024. There was 1 interview round.
I applied via LinkedIn and was interviewed before Jun 2023. There were 2 interview rounds.
Basic Multiple choice questions
Check for a loop in a linked list by using two pointers moving at different speeds.
Use two pointers, one moving at a normal speed and another moving at double the speed.
If there is a loop, the two pointers will eventually meet at some point.
Alternatively, use a hash set to store visited nodes and check for duplicates.
Leet Code Medium, string, list, tuple
based on 1 interview
Interview experience
based on 3 reviews
Rating in categories
Software Development Engineer
56
salaries
| ₹4.8 L/yr - ₹9.5 L/yr |
Data Engineer
51
salaries
| ₹5 L/yr - ₹13 L/yr |
Software Developer
35
salaries
| ₹4.8 L/yr - ₹12 L/yr |
Software Engineer
34
salaries
| ₹4 L/yr - ₹11.7 L/yr |
Hadoop Administrator
25
salaries
| ₹5.2 L/yr - ₹16 L/yr |
Markelytics Solutions
Savista Global Solutions
Jasper Colin
GfK MODE