What are the four conditions for deadlock.
Software Development Engineer Intern Interview Questions
2,287 software development engineer intern interview questions shared by candidates
two coding ques and questions from resume
The question was, given a binary tree, and a node, you burn that node at time t = 0. At time t = 1, all the neighbours of the node are burnt too as the fire spreads in all directions (ie burning child and parent of that node). Each burning node will burn all its neighbors in next second. Task: Find total time to burn the tree. I solved it using a hashmap. The connection to children exists via nodes, all you need is a connection to the parent, for which I used a hashmap. PS:- I learnt this from Striver. He has video on this exact same question.
tell us about your latest project
A question based on local storage
Implement the following: - Kadane's Algorithm (Round 2) - Sort the array half ascending, half descending (Round 3)
Related to full stack and linked lists
Program to find the next closest palindrome.
What are lifecycle hooks and how are they achieved?
Data Structures and Algorithm: Pascal's Triangle
Viewing 1581 - 1590 interview questions