Filter interviews by
I applied via Campus Placement and was interviewed in Sep 2022. There were 5 interview rounds.
English Communication Test.It will be on the articles and small English blanks .
We need to be fast in maths to crack this round...we will have 100 mins of time
In this round we will have small (basic)java mcqs which is easy to crack if you are good in basic
Top trending discussions
Two easy questions two wasy questions two easy questions two easy questions
I applied via Campus Placement and was interviewed in Oct 2024. There were 2 interview rounds.
Find the largest rectangle containing only 1s in a binary matrix.
Use dynamic programming to track heights of consecutive 1s.
For each row, treat it as a histogram and calculate the maximal rectangle.
Utilize a stack to efficiently compute the largest rectangle in a histogram.
Example: For a matrix [[0,1,1],[1,1,0],[1,1,1]], the largest rectangle has area 4.
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 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
Two coding questions, one is easy and the other is difficult. Who solved 2nd question was shortlisted for an interview.
I applied via Naukri.com and was interviewed before Oct 2021. There were 2 interview rounds.
I applied via Naukri.com and was interviewed in Oct 2020. There was 1 interview round.
I applied via Campus Placement and was interviewed in Sep 2022. There were 3 interview rounds.
Logical reasoning and Essay writing as well as some comprehension based.
Estimate revenue of Haldirams of C.P outlet
posted on 4 May 2023
I applied via Job Portal and was interviewed before May 2022. There were 3 interview rounds.
Python technical questions
Basic HR questions like background , why should i hire you
based on 1 interview experience
Difficulty level
Duration
Software Development Engineer
57
salaries
| ₹4 L/yr - ₹9 L/yr |
Data Engineer
50
salaries
| ₹5 L/yr - ₹13 L/yr |
Software Developer
36
salaries
| ₹4.8 L/yr - ₹12 L/yr |
Software Engineer
31
salaries
| ₹4 L/yr - ₹11.9 L/yr |
Hadoop Administrator
19
salaries
| ₹5.6 L/yr - ₹16 L/yr |
Markelytics Solutions
Jasper Colin
GfK MODE
Dunnhumby