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"]
Engineering Technology Interview Questions
22,709 engineering technology interview questions shared by candidates
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>
what is your sleeping hours?
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.
explain binary search, running time, when is it advantageous
find the smallest node in BST that falls into a given range find intersections of two arrays
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.
write an algorithm to determine if an integer given is prime, write an efficient and inefficient implementation of the algorithm.
Describe the project on your resume
Viewing 141 - 150 interview questions