I was given a coding assessment with up to 4 hours to complete it. I was emailed about an interview over a week later.

During the interview, I spoke with the interviewer about my past projects for about 3-5 minutes. Then, I attempted two coding questions.

You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order, and each of their nodes contains a single digit.

Add the two numbers and return it as a linked list.

You may assume the two numbers do not contain any leading zeros, except for the number 0 itself.

Given a binary tree, imagine yourself standing on the right side of it. Return the values of the nodes you can see, ordered from top to bottom.