Skip to contentSkip to footer

Senior Interview Questions

Salaries
Interviews

322,322 senior interview questions shared by candidates

Interview 1: 1. virtual functions, inheritance, etc..easy to answer c++ questions. Conversation was for about 20-25 minutes 2. Can't exactly recall, but it was about Binary Search Tree, pretty easy to find on the web. I think it was to do with levels in BST, I used recursion in the solution. Interviewer was happy with the solution. Overall call lasted for about 1 hour and 5 minutes including some questions I asked him. Interview 2: 1. What is mutex, semaphore? 2. What is a singleton pattern and can you write one that is thread-safe 3. Write a consumer producer problem. Producer produces 1000 objects and there are five consumers that consume 10 objects at a time in round robin fashion until all of them are consumed. This means that if consumer 1 consumes 10 objects, it has to wait for consumer 2, 3, 4, 5 to consume 10 objects each before it can consume other 10.
avatar

Senior Software Developer

Interviewed at Bloomberg

4★
Jun 11, 2015

Interview 1: 1. virtual functions, inheritance, etc..easy to answer c++ questions. Conversation was for about 20-25 minutes 2. Can't exactly recall, but it was about Binary Search Tree, pretty easy to find on the web. I think it was to do with levels in BST, I used recursion in the solution. Interviewer was happy with the solution. Overall call lasted for about 1 hour and 5 minutes including some questions I asked him. Interview 2: 1. What is mutex, semaphore? 2. What is a singleton pattern and can you write one that is thread-safe 3. Write a consumer producer problem. Producer produces 1000 objects and there are five consumers that consume 10 objects at a time in round robin fashion until all of them are consumed. This means that if consumer 1 consumes 10 objects, it has to wait for consumer 2, 3, 4, 5 to consume 10 objects each before it can consume other 10.

Write a program in Java to assess a given string whether it complies with following patterns. Return true if a given string complies with these patterns else false. N = N1 + N2 N>= N1 >= N2 where N is the Nth element in the string or element at Nth position; N1 is the (N-1) element in the string & N2 is the (N-2) element in the string. Example 1: 224610 Elements in this string are 2, 2, 4, 6, 10. First Set: 2+2=4 (N2=2; N1=2 & N= 4); Second Set: 2+4=6 (N2=2; N1=4 & N=6); Third Set: 4+6=10 (N2=4; N1=6 & N= 10) Example 2: 1112233558 Elements in this string are 1, 11, 12, 23, 35, 58 Example 3: 1101102203 Elements in this string are 1, 101, 102, 203
avatar

Senior Software Engineer

Interviewed at eBay

3.9★
Feb 20, 2015

Write a program in Java to assess a given string whether it complies with following patterns. Return true if a given string complies with these patterns else false. N = N1 + N2 N>= N1 >= N2 where N is the Nth element in the string or element at Nth position; N1 is the (N-1) element in the string & N2 is the (N-2) element in the string. Example 1: 224610 Elements in this string are 2, 2, 4, 6, 10. First Set: 2+2=4 (N2=2; N1=2 & N= 4); Second Set: 2+4=6 (N2=2; N1=4 & N=6); Third Set: 4+6=10 (N2=4; N1=6 & N= 10) Example 2: 1112233558 Elements in this string are 1, 11, 12, 23, 35, 58 Example 3: 1101102203 Elements in this string are 1, 101, 102, 203

Viewing 921 - 930 interview questions

Glassdoor has 322,322 interview questions and reports from Senior interviews. Prepare for your interview. Get hired. Love your job.