Software Engineer Software Developer Interview Questions

665,180 software engineer software developer interview questions shared by candidates

Given a string write a function which prints all the subsets of the string. Now make the function to return only unique solutions. For example if they give you "abc" you print out a ab abc ac b bc c Now for the unique solution constraint, if they give you "aba" the output should be: a ab aba b
avatar

Software Engineer Intern

Interviewed at Meta

3.5
Dec 13, 2013

Given a string write a function which prints all the subsets of the string. Now make the function to return only unique solutions. For example if they give you "abc" you print out a ab abc ac b bc c Now for the unique solution constraint, if they give you "aba" the output should be: a ab aba b

Question is verbose, uses search engine, string matching etc., but at the end boils down to this: There is two dimensional array where each sub array (row) is sorted, i.e. [[1 1000 2000] [20 10001 5000] [55 10002 222222]] Find a minimum range contain a number from each row. For above array it should be (1000-1002) range.
avatar

Software Engineer

Interviewed at Meta

3.5
Mar 8, 2014

Question is verbose, uses search engine, string matching etc., but at the end boils down to this: There is two dimensional array where each sub array (row) is sorted, i.e. [[1 1000 2000] [20 10001 5000] [55 10002 222222]] Find a minimum range contain a number from each row. For above array it should be (1000-1002) range.

Given an array of strings with commit ids, and a predicate isBuggy that returns if a single commit is buggy, write a program that finds the first buggy commit. - When a commit is buggy, we assume that all its children are buggy. - When a commit is not buggy, we assume that all its ancestors are not buggy. After solving it, I had to describe its time complexity and spatial complexity and how would I choose the test cases.
avatar

Software Engineer

Interviewed at Yelp

3.2
May 14, 2015

Given an array of strings with commit ids, and a predicate isBuggy that returns if a single commit is buggy, write a program that finds the first buggy commit. - When a commit is buggy, we assume that all its children are buggy. - When a commit is not buggy, we assume that all its ancestors are not buggy. After solving it, I had to describe its time complexity and spatial complexity and how would I choose the test cases.

Viewing 451 - 460 interview questions

See Interview Questions for Similar Jobs

Glassdoor has 665,180 interview questions and reports from Software engineer software developer interviews. Prepare for your interview. Get hired. Love your job.