LeetCode
Question
·
May 2022
Amazon | OA | SDE-1/2
11 upvotes
1,943 views
3 replies
Question Details
Given a tree of N nodes whose vertices are numbered from 1 to N. We need to remove two edges from tree to form three connected components. And we want...
Full Details
🔒
Unlock full leaked content
Full insider details, leaked discussions, and candidate experiences.
Get Premium →Topics
Backtracking
Binary Tree
Bit Manipulation
Graph
More from Amazon
Reddit
175 k remote offer or 300 k in Bay Area
Reddit
Done with 3 rounds of On-site Amazon SDE 1 interview , but no communication after that. What to do?
Reddit
Nned direction for future prepration.
Reddit
Have an Amazon. SDE1 interview in 4 days, need tips
Reddit
After many years in the industry, I still struggle with textbook definitions in interviews