Filter interviews by
Clear (1)
I applied via Campus Placement and was interviewed in Aug 2023. There were 2 interview rounds.
The round 1 went very good with cool aptitude questions and one coding question
Polymorphism is the ability of an object to take on many forms. It allows objects of different classes to be treated as the same type.
Polymorphism is a fundamental concept in object-oriented programming.
It allows a single interface to be used for different types of objects.
Polymorphism is achieved through method overriding and method overloading.
Example: A shape class with different subclasses like circle, square, and ...
Top trending discussions
I applied via YouTube and was interviewed before Sep 2021. There were 4 interview rounds.
Reasoning, English grammar, logical
I applied via Referral and was interviewed before Aug 2023. There were 2 interview rounds.
Written test on DSA - 3 questions on hackerrank
F2F interview on DSA + automation
Generally Focus on networking part
DSA and basic python program if you have basic knowledge you can get into next Round easily
I applied via LinkedIn and was interviewed in Oct 2023. There were 2 interview rounds.
Python programming, Networking concepts
DATA STRUCTURES,JAVA,COMPUTER NETWORKS
LeetCode medium-level and domain-specific questions.
I applied via LinkedIn and was interviewed in Aug 2023. There were 2 interview rounds.
DSA Based questions were asked
I applied via Company Website and was interviewed before May 2023. There was 1 interview round.
On leetcode based prblm there are questions asked
Trees are hierarchical data structures with nodes connected by edges. Binary search is a search algorithm that finds the position of a target value within a sorted array.
Trees are made up of nodes connected by edges, with a root node at the top and leaf nodes at the bottom.
Binary search is a divide and conquer algorithm that compares the target value to the middle element of a sorted array.
Binary search is efficient fo...
Graphs are data structures that consist of nodes (vertices) connected by edges (links).
Graphs can be directed or undirected.
Nodes can have attributes or properties.
Edges can have weights or labels.
Examples of graphs include social networks, road networks, and organizational hierarchies.
Projects and dsa based round is this
based on 1 interview
Interview experience
Software Development Engineer II
99
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 Development Engineer 3
29
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Developer
28
salaries
| ₹0 L/yr - ₹0 L/yr |
Cisco
Microsoft Corporation
Intel
IBM