Software Engineer 2 Interview Questions

Software Engineer

Interviewed at Google

4.4★

Mar 20, 2015

given a string write a function to return the index of the first elememt which is non-alphabat ordered

Software Engineer

Interviewed at Google

4.4★

Jan 5, 2016

Given a dictionary as a hashtable and a word. Find the minimum # of deletions needed on the word in order to make it a valid word in the dictionary.

Software Engineer

Interviewed at Uber

3.7★

Jul 12, 2019

Given array of stick lengths, return number of turns it takes to have no sticks left. Each turn you remove sticks of smallest length and cut that length from the rest of the sticks.

Software Engineer

Interviewed at Google

4.4★

Oct 25, 2011

If you have a ransom letter and magazines, can you construct the ransom letter from the words in the magazine.

Software Engineer

Interviewed at Google

4.4★

Feb 23, 2013

Use singly linked list to implement the cache (LRU) algorithm. How would you do?

Software Engineer Intern

Interviewed at Google

4.4★

Mar 11, 2013

Find the length of the longest chain of consecutive integers in an unsorted set in linear time.

Software Developer & Integrator III

Interviewed at USAA

3.3★

Aug 4, 2011

Jim has 42 cents and has 8 coins, and Jack has 56 cents and has 6 coins. Which has more nickels than the other?

Financial Software Developer

Interviewed at Bloomberg

4★

Nov 16, 2010

Puzzle1 - Given 8 coins, and the fact that one of the coins is heavier than the other, how many times(min) do you need to use a beam balance to figure out which is the anomalous coin? After I answered this, he made it little tougher. Given 9 coins and one anomalous coin(maybe heavier or lighter), figure out which coin it is and whether heavier or lighter. What is the min no of comparisons? This is where i took a while to answer.

Software Engineer

Interviewed at Pinterest

3.6★

Nov 19, 2012

given an arrya of numbers see if you can get to index with 0 in it from an index by jumping through the array using the values in the array. So if you have [1,2,1,0,3] you can get to 0, from 0 by jumping 0, you can get to 0 from 3, by jumping 3 index down to 2 and then jumping 2 index up to 0...

Software Engineer

Interviewed at Atlassian

3.1★

May 2, 2018

Find the median of unsorted array in O(nlog n ) time. You need to know that particular mathematical algorithm, anything slower your answer is rejected.