I applied online. The process took 2 months. I interviewed at Red Hat in Sep 2019
Interview
Great interview process that was a lot more conversational than based on leetcode. They asked me a couple technical questions but they were just basic programming questions. HR was also very nice throughout the whole process.
Only downside was they interviewed me first and then didn't respond for like a month while they interviewed other candidates, then decided to call me out of the blue with an offer. It would've been nice for some kind of status update.
Interview questions [1]
Question 1
Tell me about this on your resume, etc. Basic coding questions as well (nothing harder than fibonacci)
Teve uma entrevista, na qual perguntaram sobre mim, a minha formação e experiência. Depois enviaram um teste para testar o conhecimento na linguagem de programação específica da vaga, além de perguntas de Linux. Tudo em inglês, obviamente.
I applied through a recruiter. I interviewed at Red Hat (Londres, Inglaterra) in Apr 2020
Interview
I was reached out by recruiter for a startup [StackRox] that got recently acquired by Redhat. He used to recruit for StackRox and continued to source for Redhat. I was told the process would be quick since it's still a startupy environment. Most of my rounds were scheduled pretty quickly. Questions were medium [leetcode] difficulty. Graphs, tries, arrays, linkedlists were covered [no dynamic-programming; no system design].
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 function should be flexible enough to 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?
# Given a series of string → tag pairings, construct a "compressed" output by replacing the
# longest prefix with it's respective tag. Effectively, we are replacing PREFIXES only with their tags.