Nvidia Software Engineer

Implement a solution to a binary tree problem on LeetCode using C++.

Solve a medium to hard level problem similar to those found on LeetCode.

Explain Elmore delay model and describe how to compute it using a netlist graph.

Determine the maximum amount of water that can be trapped between any two vertical lines in an array representing heights and the x-axis, by finding two lines that, together with the x-axis, form a container holding the greatest volume of water.

Identify the element in an array where all elements appear twice except for one unique element.

The questions included finding the middle element and deleting it from a doubly linked list, finding a subarray sum using the sliding window technique, and additional questions focused on C++ programming and operating systems concepts such as system calls and paging.

Find the middle node of a doubly linked list and delete it.

Solve a list enumeration problem and perform a tree traversal.

You are asked to solve medium-level LeetCode problems that are variations of hard problems.

The first problem involves graphs and greedy algorithms, while the second one focuses on partitioning and string manipulation.