Software Engineer 2 Interview Questions

Software Engineer

Interviewed at AKUNA CAPITAL

4★

Jun 29, 2016

Unusual sort: sort an array A such that: A[0]<A[1]>A[2]<A[3]>A[4]<A[5].............

Software Engineer

Interviewed at Google

4.4★

Jul 4, 2015

Implement a power function similar to pow() function of c.

Software Engineer

Interviewed at Google

4.4★

Feb 4, 2010

You're given a binary tree and pointers to two nodes in the tree. Describe the fastest algorithm you can come up with to determine the closest common ancestor.

Software Engineer

Interviewed at Google

4.4★

Jun 19, 2014

Write code that sorts a stack

Software Engineer

Interviewed at Google

4.4★

Jul 8, 2014

Given a array of numbers, output the array like this: a1 &lt;= a2 &gt;= a3 &lt;= a4 &gt;= a5...

Senior PHP Developer

Interviewed at Wayfair

3.1★

May 15, 2018

Given an array of numbers [1,3,3,5,9,4,1,10,9,7,2,7], Write a php function that will print numbers that are not duplicated in array. [5,4,10,2]

Software Engineer

Interviewed at Google

4.4★

Jul 8, 2010

Find the number f set bits in an integer

Software Engineer

Interviewed at Google

4.4★

Mar 12, 2011

Given two large files with 64-bit integers produce file with integers which are present in both files and estimate O(?) complexity of your algorithm.

Software Engineer

Interviewed at Google

4.4★

Mar 12, 2011

Input is a 4x4 table with letters. One starts from any of the 16 elements and can move in one step to any of the 8 neighboring cells not visited before (up, down, left, right, up-left, etc, no hyperspace jumps between rows 1 & 4, columns 1 & 4). Every time step is made letter in that cell is added so a word is built as we walk. These generated words are looked up in external dictionary (function to look up in the dictionary is provided, I did not understand significance of this dictionary well) and the goal of the exercise is to output all words generated by all possible table walks and which are contained in the dictionary.

Software Engineer

Interviewed at Google

4.4★

Dec 24, 2010

Phone Interview: i) Find the number of inversions in an array (describe & code) ii) Find collinear points in a given set of 2D points (describe & code)