Developer Interview Questions

270,873 developer interview questions shared by candidates

Phone interview question # 1: Given an array (for example, [ 1, 0, 2, 0, 0, 3, 4 ]), implement methods that 1. returns the number of non-zero elements (4) 2. moves the non-zero elements to the beginning of the array (the rest of the elements don't matter) -> both [ 1, 2, 3, 4, 0, 0, 0] and [ 4, 1, 3, 2, X, Y, Z ] are valid
avatar

IOS Developer

Interviewed at Meta

3.6
Jan 14, 2016

Phone interview question # 1: Given an array (for example, [ 1, 0, 2, 0, 0, 3, 4 ]), implement methods that 1. returns the number of non-zero elements (4) 2. moves the non-zero elements to the beginning of the array (the rest of the elements don't matter) -> both [ 1, 2, 3, 4, 0, 0, 0] and [ 4, 1, 3, 2, X, Y, Z ] are valid

Coding test: 1. Given a string, find out if there's repeat characters in it. 2. SQL. Given a Customer table and a Payment table (with Customer ID as primary and foreign key), write a query to output a list of customers who have not paid their bills in the last 3 months.
avatar

Lead Java Developer

Interviewed at EPAM Systems

4
May 22, 2017

Coding test: 1. Given a string, find out if there's repeat characters in it. 2. SQL. Given a Customer table and a Payment table (with Customer ID as primary and foreign key), write a query to output a list of customers who have not paid their bills in the last 3 months.

Trees are placed in a straight line at index positions starting from 1. We are to place monkeys on the trees such that each pair of monkeys are at maximum distance. If we're given the no. of trees and the no. of monkeys, write a function returning the maximum distance between two adjacently placed monkeys.
avatar

Software Developer

Interviewed at Aristocrat

3.3
May 5, 2016

Trees are placed in a straight line at index positions starting from 1. We are to place monkeys on the trees such that each pair of monkeys are at maximum distance. If we're given the no. of trees and the no. of monkeys, write a function returning the maximum distance between two adjacently placed monkeys.

1.Given a string, write a function that return if it is Palindrome. This wasn't asked directly but from interviewer example i was need to understand that this function must ignore all spaces and special symbols. 2. Given an array, write a function that return true if any 3 elements of this array can sum to 0. My first solution was the simplest and far from best which result in O(n^3). Then interviewer asked me to improve to improve it to O(n^2). This give me a hint that i can use Hash to reduce complexity.
avatar

Android Developer

Interviewed at Meta

3.6
Jan 19, 2015

1.Given a string, write a function that return if it is Palindrome. This wasn't asked directly but from interviewer example i was need to understand that this function must ignore all spaces and special symbols. 2. Given an array, write a function that return true if any 3 elements of this array can sum to 0. My first solution was the simplest and far from best which result in O(n^3). Then interviewer asked me to improve to improve it to O(n^2). This give me a hint that i can use Hash to reduce complexity.

Viewing 11 - 20 interview questions

Glassdoor has 270,873 interview questions and reports from Developer interviews. Prepare for your interview. Get hired. Love your job.