Filter interviews by
Apptitude test is so easy it consists of English, technical mcqs
count(*) counts all rows in a table, while count(column_name) counts non-null values in a specific column.
count(*) counts all rows in a table
count(column_name) counts non-null values in a specific column
count(*) is generally used to get the total number of rows in a table
count(column_name) is used to count non-null values in a specific column
I applied via Campus Placement and was interviewed in Apr 2021. There were 3 interview rounds.
Data structures are ways of organizing and storing data in a computer so that it can be accessed and used efficiently.
Data structures can be linear or non-linear
Examples of linear data structures include arrays, linked lists, and stacks
Examples of non-linear data structures include trees and graphs
Choosing the right data structure can greatly impact the efficiency of algorithms
I applied via Campus Placement and was interviewed in Sep 2020. There were 3 interview rounds.
Program to get minimum number of coins.
Create an array of coin denominations
Sort the array in descending order
Loop through the array and subtract the highest denomination possible
Repeat until the remaining amount is 0
Sorting an array of infinite length with only three elements (-1, 0, 1)
Use counting sort algorithm to count the frequency of each element
Create a new array with sorted elements based on their frequency
Time complexity is O(n) and space complexity is O(1)
Example: [-1, 1, 0, 1, -1, 0, 1, -1, 0, 1, ...]
Top trending discussions
Two coding questions, one is easy and the other is difficult. Who solved 2nd question was shortlisted for an interview.
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
1 coding question, and basic MCQ
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
posted on 10 Sep 2023
It was an easy test. It consisted of MCQs and two coding qns. Prepare SQL well. It also had 2 programming question. Both were medium difficukty
I appeared for an interview in Feb 2024.
Single responsibility principle states that a class should have only one reason to change.
Each class should have only one responsibility
Helps in making code more maintainable and easier to understand
Promotes separation of concerns
Example: A class that handles user authentication should not also handle file management
based on 1 interview
Interview experience
based on 4 reviews
Rating in categories
Software Development Engineer
54
salaries
| ₹4.8 L/yr - ₹10.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