They use HackerRank for technical interviews. The questions are confidential. They want you to be solid on data structures, algorithms, and big-O notation. First round was an automated test: 90 minutes and four questions. Second round was using an online shared document to work through a coding exercise one-on-one with one of their IT professionals.
Just a recruitspam. Asking back anything resulted simple ghosting
take home exam without initial screen
Programming and Systems related
2 coding test and 1 DevOps Task (Create puppet file).
Using the Fibonacci sequence, print out a lower case letter (from the English alphabet) the number of times of the Fibonacci number in the corresponding index. A number in the Fibonacci sequence is calculated by: n[x-2] + n[x-1] = n[x] The sequence starts with n[1] = 1 and n[2] = 1. The index begins at 1, not 0. Be careful of off by 1 errors. You do not have to worry about exceeding the English alphabet s max index of 26. Example: Input: 5 Letter = e Fibonacci number n[5] = 5 Output: eeee Input: A single integer. Output: A number of lower case letters as described above.
Tell me what devops means to you.
What are solder joint failure mechanisms?
Delete duplicates in a linked list,
Give me an example of a situation where you completely disagreed with your manager and how you resolved it.
Viewing 2221 - 2230 interview questions