Software Development Engineer III Interview Questions | Glassdoor

Software Development Engineer III Interview Questions


Software development engineer iii interview questions shared by candidates

Top Interview Questions

Sort: RelevancePopular Date

Telephone interview: Find largest integer from an array of integers. The integers in the array are arranged in strictly increasing (no 2 integers are same) or strictly increasing then decreasing; so like a curve and you have to find the peak. Discuss time complexity. Write code.

3 Answers

Binary search

First, binary search will not work since just looking at a single point will not tell you if it's on the decreasing or increasing side of the curve. What you need is modified binary search. Looking at position i check position i+1 if it's increasing then search right otherwise search left; Code: int peak(vector V, int i, int iStart, int iEnd){ assert( i >= 0 && i = 0 && iStart = 0 && iEnd < V.size()); assert( iStart <= i && i <= iEnd ); if (i == iEnd) return i; int iCurr = V[i]; int iNext = V[i+1]; int iStartNew = iStart; int iEndNew = iEndl if( iCurr < iNext ) iStartNew = i; else iEndNew = i; int iNew = (iEndNew-iStartNew)/2; if( iNew == i ) iNew++; return peak(V, iNew, iStartNew, iEndNew); }

The question is a variation of the commonly asked problem of finding the start/end index of a sorted array that has been rotated. Takes O(log n) time.

What kind of protocol is OSPF

4 Answers

Suppose you have a C++ base class and several classes that inherit from it. What might happen if you do not write a virtual destructor for the base class?

2 Answers

Design the recommendations list for amazon webpage.

1 Answer

How to sync user shopping cart over multiple data centers.

1 Answer

Find the last unique character in a character string

1 Answer

In Person with 4 people (~45min each): 1. Check if binary tree A is contained in binary tree B. Write code on paper. 2. Derive a formula for calculating the angle between the hour hand and minute hand in a clock. 3. Design a parking lot. Discuss what data structures to use.

1 Answer

Design a game of battleship Design a game of Boggle Design a traffic light system for one intersection Copy contents of one link list to another where the destination node size is different than the original node size but overall link list size is same. Don't worry about space allocation.

Write a program to generate a "Unique Ticket" for each request. The number of requests could be quite large - up to a million per second.