Research Engineer Interview Questions
2K
Research Engineer interview questions shared by candidates
Let a rope of unit length is cut into n pieces. What is the expected length of the smallest piece?
5 Answers
Reverse a linked list
4 Answers↳
reverse DoublyLinkedList(node) { while(node) { printf(node->info); if(node->previous==Null) { printf(node->info); break; } } } Less
↳
reverse DoublyLinkedList(node) { while(node) { printf(node->info); if(node->previous==Null) { printf(node->info); break; } node =node->previous; } } Less
↳
reverse DoublyLinkedList(node) { while(node) { printf(node->info); node =node->previous; if(node->previous==Null) { printf(node->info); break; } } } Less
How many windows APIs do you remember?
3 Answers
Technical stuff mostly
2 Answers↳
Described whatever I knew
↳
Through questions like this, interviewers are mostly trying to test your skillset (and its relevance to the role) as robustly as possible, so be prepared for multiple offshoots and followups. It could be a useful exercise to do mocks with friends or colleagues in Huawei to get a real sense of what the interview is actually like. Alternatively Prepfully has a ton of Huawei Research Engineer experts who provide mock interviews for a pretty reasonable amount. prepfully.com/practice-interviews Less
engg basics like thermodynamics etc
1 Answers↳
Through questions like this, interviewers are mostly trying to test your skillset (and its relevance to the role) as robustly as possible, so be prepared for multiple offshoots and followups. It could be a useful exercise to do mocks with friends or colleagues in Hitachi to get a real sense of what the interview is actually like. Alternatively Prepfully has a ton of Hitachi Research Engineer experts who provide mock interviews for a pretty reasonable amount. prepfully.com/practice-interviews Less
What's the most adventure you've been through in your life?
1 Answers↳
unexpected to me and made me rewinding my memories
Design for a google doc style spreadsheet, with a focus on how to handle multiple concurrent edits and formulas on the spreadsheet.
2 Answers↳
Described a transactional model for updates.
↳
It's a very common interview question, this article How To Design Google Docs (bit.ly/1RxoUV7) has a detailed discussion about this topic. bit.ly/1RxoUV7 Less
Why would you like to leave your current job?
2 Answers↳
First reason is low salary,the second one is their not given importance to talented people if their not consider the freshers or newly joint team member and also they provide the increment to seniority level only Less
↳
I'm diploma in EEE department, I'm working in production field, I'm searching to maintance work I'm learning and work for maintenance Less
Print all possible permutations of string inputs
2 Answers↳
Hello, may i know about the detail of your interview time? date? morning or afternoon? because actually i also join at this interview (Bandung, Indonesia) Less
↳
import java.util.Arrays; import java.util.Scanner; class PermuteString { static int k=0; public static String[] doPermutation(char[] str,int i,int n,String[] s) { if(i==n) { for(int m=0;m Less
Build a program to process data from an emitter. The data arrives ordered and for every received record your program may take from 0.1 to 5 seconds to process. The processed data has to be given to a stream, ordered and in real time. For the sake of the example the processing time is random sleeping between 0.1 to 5 seconds.
2 Answers↳
Build a queues based system with multiple record processors that work in parallel, but make sure that this processing happens in parallel, not just concurrently as in the real world the CPU will be working, not just sleeping. Less
↳
As an addition to the answer above: Parallelising the elements processing without extra logic around it would cause the processed elements to be published downstream in a non-deterministic order. If we want to maintain order and parallelism, a solution could be to have a (circular) atomic auto incrementing integer `i`, after processing an element `e` assign the latest `i` to it by putting them into a map from `i` to `e`. Keep track of the latest `i` which has been published downstream, let's call it `latest`. At this point, whenever `i` is incremented, check if `i` is the successor of `latest`, if that's the case it means you can publish that element downstream and you can also publish all the elements in the map that are successors (while clearing them from the map). If you use this approach in some cases (eg. when processing of one element produces lots of data), you should make sure the queue in bounded, not to risk out of memory while processing too many elements in parallel. Less