Skip to contentSkip to footer

Engineering Research Interview Questions

Salaries
Interviews

11,250 engineering research interview questions shared by candidates

Signed a non-disclosure agreement so can't give exact questions. Though they're pretty standard interview questions based on Data Structures, String manipulations etc. My best advice would be think about what you would like to ask the interviewer. I totally forgot to prepare questions and I felt like they were waiting for me to ask them something.
avatar

Software Engineering Intern

Interviewed at Google

4.4★
Jul 19, 2012

Signed a non-disclosure agreement so can't give exact questions. Though they're pretty standard interview questions based on Data Structures, String manipulations etc. My best advice would be think about what you would like to ask the interviewer. I totally forgot to prepare questions and I felt like they were waiting for me to ask them something.

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,250 interview questions and reports from Engineering research interviews. Prepare for your interview. Get hired. Love your job.