I had three 40-minute interviews in one day at their Toronto location.

The first interviewer provided a lot of information about the company, their teams, and the work. They also allowed me to ask questions.

They asked some questions regarding my position preferences and about my resume, then jumped into technical questions.

The next two interviewers jumped right into technical questions.

I had two software (data structures and algorithms) interviews and one hardware/digital logic interview.

We have a binary tree. How do we find the longest path (path with the most number of nodes) starting from the head?

Part 2: How do we find the longest path that starts from a child and ends at another child and doesn't necessarily pass the head?

We have a graph of nodes (devices) and edges that determine the delay between connected nodes. Find the critical delay path using C or C++. Only give the delay number; you don't have to return the whole path.

Implement a 2-bit Gray Code counter and draw the schematic. How do we determine the critical clock frequency, and why don't we consider hold time in this calculation? Given these numbers, find the critical clock frequency. How can we clock the circuit at a faster rate if we add delays to this Gray Code counter that you implemented?

Draw a circuit that takes an input signal, delays it by one clock cycle, and extends it to two clock cycles.