Trees Interview Questions [2026-2027]

Given a standard binary tree, print the maximum value in each possible path from the root of the tree to the leaf as a list Any approach or similar question?

Report Chain ## Problem Overview You are given an org chart as a `list[list[str]]`. Each inner list has the form: ```python [manager, report_1, report_2, ...] ``` For example: ```python [["A", "B",

Hi, I was recently(June'23) interviewed for the Software Developer position for Cadence Design Systems (Location: Noida). Have a year of experience. Following were intervi...

I am a student from NSIT, final year (ICE). Here is my Cadence Interview experience.Round 1:Question on virtual function, size calculation of class with virtual function.M...

LeetCode #257: Binary Tree Paths. Difficulty: Easy. Topics: String, Backtracking, Tree, Depth-First Search, Binary Tree. Asked at Capital One in the last 6 months.

Question Robinhood is famous for its referral program. It\u2019s exciting to see our users spreading the word across their friends and family. One thing that is interesting about the program is...

Position: Front end Engineer Phone interview. 1. Implement getByClassName() javascript // element.children => HTMLCollection // element.className => string /** * @function getByClassName * @param {Element} root \u2013 The root of the DOM tree * @param {string} className * @return...

I got the file permission question similar to https://leetcode.com/discuss/interview-question/417262/dropbox-phone-screen-permissions-in-a-file-system and the follow-up was to modify implementation so that only the parent has access, for example: A -> B \t ----> C if we have...

For onsite, I was asked an algorithms question similar to this: Users can refer each other to Robinhood. We want keep track of who is responsible for the most referrals and...

File access System I was asked the following question. If given the folder access tree and given query folder name, return TRUE|FALSE is user have access to it. for eg. below -...

They asked very detailed questions about my resume, including some behavioral questions, such as how I recovered from a failed project, a project I'm particularly proud of, and how I handled conflicts

Round 1:Coding RoundThe platform was geeekd.com, and it really has a very bad interface and an even worse text editor.There were 5 questions, with choice between either C+...

I had an telephonic interview with Arista Networks couple of days ago. To apply for Arista Networks (Internship) CGPA =8.5, luckily i had. Here are the details of the comp...

Lately, I had an on campus interview with Arista Networks. Here are the details of the company’s written and interview process.Round 1 (Written, On paper, 10 Questions, 45...

A # | B # | | C <-- access # | | D # | E <-- access # |___ F ---- G # folders = [(\'A\', None), (\'B\', \'A\'), (\'C\', \'B\'), (\'D\',...

Had a phone screen with an arrogant L3 engineer and was rejected after coming up with working BFS solution. # # A # |___ B # | |___ C <-- access # | |___...

Commvault visited our campus for SDE . First round was coding round .in this round they gave 5 question.Round 1:Print the binary search tree in zig zag way.Swap two node i...

LeetCode #1110: Delete Nodes And Return Forest. Difficulty: Medium. Topics: Array, Hash Table, Tree, Depth-First Search, Binary Tree. Asked at Pinterest in the last 6 months.

LeetCode #510: Inorder Successor in BST II. Difficulty: Medium. Topics: Tree, Binary Search Tree, Binary Tree. Asked at Arista Networks in the last 6 months.

Let's jump straight to the problem. The following content requires a score higher than 188. You can already view it. It's a variation of the "camera group" problem from the forum. We have a string "or

Problem Overview: Throne Inheritance We need to create a system to manage a family tree for a kingdom. This kingdom starts with a king, and the tree grows as children are born. Every person in this

Problem Statement You have a tree with `n` nodes. The nodes are numbered from `0` to `n - 1`. The tree structure is defined by a list of `edges`, where each item looks like `[parent, child]`. You ar

LeetCode #1257: Smallest Common Region. Difficulty: Medium. Topics: Array, Hash Table, String, Tree, Depth-First Search, Breadth-First Search. Asked at Airbnb in the last 6 months.

Status: New grad, MS / ME / MTech from IISC / IIT / BITS Pilani. Position: Engineer Location: Hyderabad, India. Date: 29 - 07 - 2020. > This is a On Campus recruitment process,...

1 hour coding round approx 45-50 minutes to solve two problems with 2 interviewers. Coderpad interview you have to write complete code, not just the method like leetcode. #### Q.1 \thttps://leetcode.com/discuss/interview-question/125110/LinkedIn-or-Phone-screen-or-Tournament-tree-problem \t**Expected Runtime...