Filter interviews by
It was pretty easy with mcq on logical,reasoninh
Normalization in DBMS is the process of organizing data in a database to reduce redundancy and improve data integrity.
Normalization involves breaking down a large table into smaller tables and defining relationships between them.
It helps in reducing data redundancy by storing data in a structured manner.
Normalization ensures data integrity by minimizing data anomalies.
There are different normal forms like 1NF, 2NF, 3NF...
Variation of 0/1 knapsack problem involves maximizing value within a weight limit.
Consider dynamic programming approach for optimal solution
Keep track of maximum value that can be achieved at each weight limit
Use a 2D array to store intermediate results
I applied via Approached by Company and was interviewed before May 2023. There were 4 interview rounds.
Basic questions
Top trending discussions
I applied via Recruitment Consultant and was interviewed in Mar 2021. There were 4 interview rounds.
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 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 Campus Placement and was interviewed in Jun 2023. There were 5 interview rounds.
Basic Aptitude questions regarding arithmetics and puzzles.
Coding test was on some platform that I don't remember. The question were quite easy but I was short on time. You were given 20 minutes to solve 2 questions ( 1 easy, 1 medium ) .
The first question was very basic and based on Priority Queue, the second question was based on the graph. This was a medium-hard difficulty. I was able to solve one.
To delete a node from a linked list, update the previous node's next pointer to skip over the node to be deleted.
Traverse the linked list to find the node to be deleted
Update the previous node's next pointer to skip over the node to be deleted
Free the memory allocated to the node to be deleted
Print a matrix horizontally
Iterate through each row of the matrix
Concatenate the elements of each row into a single string
Add the concatenated strings to an array of strings
I applied via Campus Placement and was interviewed before Sep 2023. There were 3 interview rounds.
Computer Engineering related fields
based on 3 interviews
Interview experience
Software Engineer
28
salaries
| ₹4.2 L/yr - ₹16 L/yr |
Senior Software Engineer
11
salaries
| ₹7.9 L/yr - ₹24.8 L/yr |
Devops Engineer
9
salaries
| ₹9.3 L/yr - ₹13 L/yr |
Professional Service Engineer
7
salaries
| ₹5.2 L/yr - ₹12 L/yr |
Senior Devops Engineer
5
salaries
| ₹12 L/yr - ₹21.5 L/yr |
Genesys
AVAYA
RingCentral
8x8