Filter interviews by
I applied via Naukri.com and was interviewed in Jun 2021. There were 5 interview rounds.
Top trending discussions
posted on 13 Jun 2024
I applied via Company Website and was interviewed in May 2024. There was 1 interview round.
The task was a Codility type
I was interviewed in Jan 2025.
Online test was hackerrank was was og avg difficulty
Assignment was straightforward which could be done using trie. Did it in 1/6th throughout time for given queries then mentioned allowed still no reply. Keep on asking engineering manager and hr to which they replied not upto the mark.
I applied via Naukri.com and was interviewed in Apr 2021. There was 1 interview round.
posted on 17 Oct 2023
I applied via Campus Placement
90 min MCQ +coding test on hackerrank.
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 some point, there is a cycle in the linked list.
I was interviewed in Jan 2022.
Round duration - 90 minutes
Round difficulty - Medium
Determine if a given singly linked list of integers forms a cycle or not.
A cycle in a linked list occurs when a node's next
points back to a previous node in the ...
The task is to determine if a given singly linked list forms a cycle or not.
A cycle occurs when a node's next points back to a previous node in the list.
To solve this problem, we can use the Floyd's Cycle-Finding Algorithm.
The algorithm uses two pointers, one moving at a normal pace and the other moving twice as fast.
If there is a cycle, the fast pointer will eventually catch up to the slow pointer.
If the fast pointer ...
Round duration - 60 minutes
Round difficulty - Medium
Determine the minimum depth of an integer-based binary tree. The minimum depth is defined as the number of nodes present along the shortest path from the root node down to t...
The minimum depth of a binary tree is the number of nodes along the shortest path from the root node down to the nearest leaf node.
The minimum depth can be found by performing a breadth-first search (BFS) traversal of the binary tree
During the BFS traversal, keep track of the current level and increment the depth by 1 for each level
Stop the BFS traversal when a leaf node is encountered and return the depth as the minim
Given two arrays A
and B
with sizes N
and M
respectively, both sorted in non-decreasing order, determine their intersection.
The intersection of two arrays in...
The problem is to find the intersection of two sorted arrays.
Use two pointers to iterate through the arrays.
Compare the elements at the current pointers and move the pointers accordingly.
If the elements are equal, add it to the intersection array and move both pointers.
If the element in the first array is smaller, move the first pointer.
If the element in the second array is smaller, move the second pointer.
Repeat until...
A mutex is a binary semaphore used for mutual exclusion, while a semaphore is a generalized synchronization primitive.
Mutex is used to protect a critical section of code, allowing only one thread to access it at a time.
Semaphore is used to control access to a shared resource, allowing multiple threads to access it simultaneously.
Mutex has ownership, meaning the thread that locks it must unlock it.
Semaphore does not hav...
Round duration - 60 minutes
Round difficulty - Easy
Round duration - 25 minutes
Round difficulty - Easy
Tip 1 : Practice a lot of DSA questions on various online platforms.
Tip 2 : Regularly go back to some of the typical DSA questions.
Tip 3 : Give equal importance to OS, OOPS, and CN subjects.
Tip 1 : Be thorough with your resume to answer anything and everything from your resume.
Tip 2 : Do not put false information on your resume.
I applied via Recruitment Consulltant and was interviewed before Oct 2022. There were 5 interview rounds.
Technical interview on different types of routing paths
I applied via LinkedIn and was interviewed in Oct 2023. There was 1 interview round.
Software Engineer
212
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Developer
27
salaries
| ₹0 L/yr - ₹0 L/yr |
Softwaretest Engineer
26
salaries
| ₹0 L/yr - ₹0 L/yr |
Technical Solutions Engineer
13
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
12
salaries
| ₹0 L/yr - ₹0 L/yr |
Cisco
Juniper Networks
Hewlett Packard Enterprise
Extreme Networks