I was reached out by a recruiter for a startup, StackRox, that was recently acquired by Red Hat. He used to recruit for StackRox and continued to source for Red Hat. I was told the process would be quick since it's still a startup-like environment. Most of my rounds were scheduled pretty quickly. Questions were medium LeetCode difficulty. Graphs, tries, arrays, and linked lists were covered. No dynamic programming or system design was included.

Implement an LRU cache.

Channel allocator: Given an input of htop [process id, process name, action and type], allocate the process to a specific channel[s].

Write this function such that multiple rules can be handled and the function should be flexible enough to handle additional rules.

Data:

type pid action proc S 123 bind nginx N 456 accept apache2 D 789 exec sh

• Send all events with type "N" to channel 1.
• Send all events for proc "nginx" to channel 2.
• Send all events with action "accept" to channel 3.

However, there can be additional rules as well. How to make this scalable?

Pacific-Atlantic water flow problem [leetcode]

Given a list of manager relationships, return if A is a manager of B. If A -> B -> C, A is also a manager of C [indirectly].

Given a series of string → tag pairings, construct a "compressed" output by replacing the longest prefix with its respective tag. Effectively, we are replacing PREFIXES only with their tags.