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.
Anonymous
Solved the first with a stack, simple solution, I had seen a similar question before. Did not solve the graph algorithm question. No API details and a very difficult
Check out your Company Bowl for anonymous work chats.