Filter interviews by
Clear (1)
Q1 - Delete all entries of a given number from a linked list.
Q2 - Find inorder traversal of a BST (with and without recursion).
Rate your
company
🤫 100% anonymous
How was your last interview experience?
Top trending discussions
I was interviewed before Mar 2021.
Round duration - 60 minutes
Round difficulty - Medium
2 coding question both and 15 MCQ
Only C , Java , Python are allowed
Given a square chessboard of size 'N x N', determine the minimum number of moves a Knight requires to reach a specified target position from its initial position...
Calculate the minimum number of moves a Knight requires to reach a specified target position on a chessboard.
Use breadth-first search (BFS) algorithm to find the shortest path for the Knight.
Consider all possible moves of the Knight on the chessboard.
Keep track of visited positions to avoid revisiting them.
Return the minimum number of moves required to reach the target position.
You are provided with an N * M
sized binary matrix 'MAT' where 'N' denotes the number of rows and 'M' denotes the number of columns. Your t...
Find the maximum area of a submatrix with all 1's in a binary matrix.
Iterate over the matrix and calculate the maximum area of submatrices with all 1's.
Use dynamic programming to efficiently solve the problem.
Consider the current cell and its top, left, and top-left diagonal neighbors to calculate the area.
Round duration - 45 minutes
Round difficulty - Easy
Around 6 am morning
2 interviewers
Given a Singly Linked List of integers, your task is to reverse the Linked List by altering the links between the nodes.
The first line of input is an intege...
Reverse a singly linked list by altering the links between nodes.
Iterate through the linked list and reverse the links between nodes
Use three pointers to keep track of the previous, current, and next nodes
Update the links between nodes to reverse the list
Return the head of the reversed linked list
Synchronization in operating systems ensures proper coordination and communication between multiple processes or threads.
Synchronization is necessary to prevent race conditions and ensure data consistency.
Common synchronization mechanisms include mutexes, semaphores, and monitors.
Mutexes allow only one thread to access a resource at a time, preventing concurrent access.
Semaphores control access to a shared resource by ...
The OSI model is a conceptual framework that standardizes the functions of a telecommunication or computing system into seven layers.
Physical Layer: Transmits raw data bits over a physical medium (e.g. Ethernet cable)
Data Link Layer: Provides error detection and correction (e.g. MAC addresses in Ethernet)
Network Layer: Routes data packets between networks (e.g. IP addresses in Internet)
Transport Layer: Ensures reliable...
A NAT router is a device that allows multiple devices on a local network to share a single public IP address for internet access.
NAT stands for Network Address Translation, which allows private IP addresses to be translated to a public IP address for communication over the internet.
NAT routers provide an added layer of security by hiding the internal IP addresses of devices on the network from external sources.
NAT rout...
To compete with Google in search engine, focus on niche markets, improve user experience, and leverage AI technology.
Focus on niche markets where Google may not have as strong of a presence
Improve user experience by providing more relevant search results and faster load times
Leverage AI technology to personalize search results and enhance user experience
Invest in marketing and partnerships to increase visibility and us...
The total amount of water on Earth is approximately 1.386 billion cubic kilometers.
The majority of Earth's water is in the form of saltwater in the oceans, accounting for about 97.5% of the total water volume.
Only about 2.5% of Earth's water is freshwater, with the majority of that being stored in glaciers and ice caps.
The total amount of water on Earth is constantly cycling through the atmosphere, oceans, rivers, and
Round duration - 30 minutes
Round difficulty - Easy
Manager Round
I faced challenges in data collection, analysis, and time management during my master's thesis.
Difficulty in finding relevant research papers and data sources
Struggling with complex statistical analysis techniques
Managing time effectively to meet deadlines
Dealing with unexpected setbacks and technical issues
Balancing thesis work with other academic and personal commitments
Round duration - 10 Minutes
Round difficulty - Easy
Salary breakdown and Location preference
Tip 1 : Computer Network should be strong
Tip 2 : Exposure to system programming also helps
Tip 3 : At least 150 problems and C++ was not allowed so prepare accordingly
Tip 1 : Project should be really good
Tip 2 : Write Computer Network and Operating System Courses in resume as course taken
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 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.
based on 1 interview
Interview experience
Anonymously discuss salaries, work culture, and many more
Get Ambitionbox App
Software Engineer
216
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