Operations Engineering Manager Interview Questions

11,377 operations engineering manager interview questions shared by candidates

Given a list of words and a list of letters return the words of maximum length which can be formed with those letters. Example Input: words: ["abc", "acbb", "caab", "xyz"] letters: ['a' 'c', 'a', 'x', 'b', 'b', 'c'] Output: ["acbb", "caab"]
avatar

Software Engineering Internship

Interviewed at Google

4.4
Nov 19, 2014

Given a list of words and a list of letters return the words of maximum length which can be formed with those letters. Example Input: words: ["abc", "acbb", "caab", "xyz"] letters: ['a' 'c', 'a', 'x', 'b', 'b', 'c'] Output: ["acbb", "caab"]

You are building a house. You hire multiple contractors to finish your house. Each person has a list of tasks they have to finish and each depends on other task(s) being finished. Example: Fusebox has to be installed before wiring can you convert their tasks into a single ordered list? Elevator -> Move in Fusebox -> Wiring Fusebox, Wiring -> Lamps Wiring -> Elevator Expected output: Fusebox, Wiring, Lamps, Elevator, Move In class Task { string TaskName Set<string> DependsOnTaskName } Personal Note. I thing the code Set<string> is tricky I thing the interviewer is expecting that you propose a code refactor, change it to a Set<Task>
avatar

Software Engineering

Interviewed at Google

4.4
May 13, 2015

You are building a house. You hire multiple contractors to finish your house. Each person has a list of tasks they have to finish and each depends on other task(s) being finished. Example: Fusebox has to be installed before wiring can you convert their tasks into a single ordered list? Elevator -> Move in Fusebox -> Wiring Fusebox, Wiring -> Lamps Wiring -> Elevator Expected output: Fusebox, Wiring, Lamps, Elevator, Move In class Task { string TaskName Set<string> DependsOnTaskName } Personal Note. I thing the code Set<string> is tricky I thing the interviewer is expecting that you propose a code refactor, change it to a Set<Task>

Write a small program that checks for matching brackets. For example, the program would return true if it were given "( ( { ( { [ ] } ) } ) )" where all brackets pair correctly as they would in a program, and return false for something like "( ( [ ] )" or "( [ ) ]".
avatar

Software Engineering Intern

Interviewed at Wayfair

3.1
Sep 28, 2016

Write a small program that checks for matching brackets. For example, the program would return true if it were given "( ( { ( { [ ] } ) } ) )" where all brackets pair correctly as they would in a program, and return false for something like "( ( [ ] )" or "( [ ) ]".

You are given a phone keypad (1-2-3;4-5-6;7-8-9;x-0-x) and a Knight from a game of chess, write a program that given two inputs, (int k, int n) outputs the total number of possible combinations of phone numbers length k that can be generated by moving the Knight starting at the number n.
avatar

Software Engineering Internship

Interviewed at Google

4.4
Feb 15, 2017

You are given a phone keypad (1-2-3;4-5-6;7-8-9;x-0-x) and a Knight from a game of chess, write a program that given two inputs, (int k, int n) outputs the total number of possible combinations of phone numbers length k that can be generated by moving the Knight starting at the number n.

Given a list of dominoes (represented as tuples), what is the longest row of dominoes that you can place down such that adjacent sides of neighboring dominoes have the same label? An example list of dominoes is [(0,3), (3,1), (2,1), (4,0)] and a valid row would be [(0,3), (3,1), (1,2)],
avatar

Engineering Residency

Interviewed at Google

4.4
Jan 15, 2020

Given a list of dominoes (represented as tuples), what is the longest row of dominoes that you can place down such that adjacent sides of neighboring dominoes have the same label? An example list of dominoes is [(0,3), (3,1), (2,1), (4,0)] and a valid row would be [(0,3), (3,1), (1,2)],

Viewing 91 - 100 interview questions

Glassdoor has 11,377 interview questions and reports from Operations engineering manager interviews. Prepare for your interview. Get hired. Love your job.