Filter interviews by
I applied via Company Website and was interviewed in Sep 2023. There were 3 interview rounds.
There were 2 coding questions and 20 aptitude questions. Coding questiins were based in trees and graphs
Use Floyd's Tortoise and Hare algorithm to detect cycle in a linked list.
Initialize two pointers, slow and fast, at the head of the linked list.
Move slow pointer by one step and fast pointer by two steps.
If they meet at any point, there is a cycle in the linked list.
If fast pointer reaches the end of the list, there is no cycle.
Packets travel in a switch network by being forwarded based on the destination MAC address.
Packets are received by the switch on an incoming port.
The switch looks up the destination MAC address in its MAC address table.
If the MAC address is found, the packet is forwarded out the corresponding port.
If the MAC address is not found, the packet is flooded out all ports except the incoming port.
Switches operate at Layer 2 o
Top trending discussions
DATA STRUCTURES,JAVA,COMPUTER NETWORKS
Dsa round on hackerrank
Very good but easy
easy question long question
posted on 8 Oct 2024
Difficult online round
Arrays are a collection of strings in programming used to store multiple values under a single variable name.
Arrays are declared using square brackets []
Each element in an array is accessed by its index, starting from 0
Example: var fruits = ['apple', 'banana', 'orange']
Trees in neet code refer to the implementation of tree data structures in coding challenges on the platform NeetCode.
Trees are a common data structure used in coding challenges to represent hierarchical relationships between data.
Common tree operations include traversal (inorder, preorder, postorder), insertion, deletion, and searching.
Examples of tree-related coding challenges on NeetCode include implementing a binary...
Trees in leetcode are a common topic for coding interviews, involving various tree traversal and manipulation techniques.
Understand different tree traversal methods like inorder, preorder, and postorder.
Learn about common tree algorithms like finding the height, diameter, and lowest common ancestor.
Practice solving tree-related problems on leetcode to improve your skills.
posted on 26 Jul 2024
posted on 1 Feb 2024
I applied via Naukri.com and was interviewed in Jan 2024. There were 2 interview rounds.
posted on 30 Oct 2024
Tuple and list are data structures in Python. Tuple is immutable and ordered, while list is mutable and ordered.
Tuple is immutable, meaning its elements cannot be changed after creation
List is mutable, meaning its elements can be changed after creation
Tuple is ordered, meaning it maintains the order of elements
List is ordered, meaning it maintains the order of elements
Example of tuple: (1, 2, 3)
Example of list: [1, 2,
based on 2 interviews
Interview experience
based on 4 reviews
Rating in categories
Software Engineer
211
salaries
| ₹15.6 L/yr - ₹60 L/yr |
Software Developer
27
salaries
| ₹14 L/yr - ₹45 L/yr |
Softwaretest Engineer
26
salaries
| ₹11.4 L/yr - ₹43.4 L/yr |
Technical Solutions Engineer
13
salaries
| ₹8 L/yr - ₹22 L/yr |
Senior Software Engineer
12
salaries
| ₹15.5 L/yr - ₹56.6 L/yr |
Cisco
Juniper Networks
Hewlett Packard Enterprise
Extreme Networks