Two leetcode questions, one medium and one hard. Medium was a nested parentheses question, the hard was a graph algorithm, similar to: https://leetcode.com/problems/count-visited-nodes-in-a-directed-graph/description/. Graph algorithm had an custom object with no documentation, so I had to guess for the API calls, this ate much of the time.
General questions like why I wanted to work there, etc.
Coding questions based on arrays
LC medium, hard questions
A few behavioral questions and one coding question related to graph.
Q1. Reorder a linked list(IBit hard) Q2. Zigzag traversal of a binary tree (Ibit medium)
Coderpad interview, coin change problem
What kinds of industry experience have you had prior to this interview
If I had any questions about the company, or the job itself.
Array manipulation questions
Viewing 1981 - 1990 interview questions