Filter interviews by
Clear (1)
I applied via Campus Placement and was interviewed before Dec 2021. There were 3 interview rounds.
Questions on Aptitude+ CS subjects+ Coding problems
Prime indexing is the use of a unique identifier as the primary index for a database table, while secondary indexing uses other attributes.
Prime indexing is faster than secondary indexing as it directly accesses the data.
Primary index is usually the first column in a table, while secondary index can be any other column.
Primary index ensures uniqueness of data, while secondary index improves query performance.
Example of...
Top trending discussions
I applied via Freshesworld and was interviewed in Nov 2020. There were 6 interview rounds.
I applied via Company Website and was interviewed before Apr 2021. There were 3 interview rounds.
Coding on java ,spring , hibernate
I applied via Company Website and was interviewed before Oct 2020. There were 3 interview rounds.
I applied via Job Portal and was interviewed before Mar 2021. There was 1 interview round.
I applied via Campus Placement and was interviewed before Mar 2021. There were 4 interview rounds.
I applied via Campus Placement and was interviewed before Jul 2021. There were 2 interview rounds.
A simple aptitude test to define your skills set.
I applied via Campus Placement and was interviewed before Aug 2021. There were 2 interview rounds.
Quants, LA and English aptitude.
I was interviewed before Dec 2020.
Round duration - 90 Minutes
Round difficulty - Medium
Given two arbitrary binary trees, your task is to determine whether these two trees are mirrors of each other.
Two trees are considered mirror of each other if...
Check if two binary trees are mirrors of each other based on specific criteria.
Compare the roots of both trees.
Check if the left subtree of the first tree is the mirror of the right subtree of the second tree.
Verify if the right subtree of the first tree is the mirror of the left subtree of the second tree.
Round duration - 30 minutes
Round difficulty - Medium
Develop a Stack Data Structure to store integer values using two Queues internally.
Your stack implementation should provide these public functions:
Implement a stack using two queues to store integer values with specified functions.
Use two queues to simulate stack operations efficiently.
Maintain the top element in one of the queues for easy access.
Handle push, pop, top, size, and isEmpty functions as specified.
Ensure proper error handling for empty stack scenarios.
Optimize the implementation to achieve desired time complexity.
Example: Push 42, pop top element (42)
Tip 1 : Company specific Youtube tutorials
Tip 2 : Remember tricks
Tip 3 : Practice
Tip 1 : Resume needs to be Short and concise
Tip 2 : Prefer a single page resume without any company logos. Mention your projects and highlight achievements. No need to add irrelevant information to cover up the space unnecessarily
based on 1 interview
Interview experience
Software Development Engineer II
94
salaries
| ₹0 L/yr - ₹0 L/yr |
Devops Engineer
45
salaries
| ₹0 L/yr - ₹0 L/yr |
Development Engineer 3
40
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Developer
36
salaries
| ₹0 L/yr - ₹0 L/yr |
Development Engineer
27
salaries
| ₹0 L/yr - ₹0 L/yr |
Cisco
Microsoft Corporation
Intel
IBM