Print the series 1,3,7,13,21,43,57,73,91,111,157,183,211...
Developer Interview Questions
268,842 developer interview questions shared by candidates
How to measure 9 minutes using only a 4 minute and 7 minute hourglass
Q1. Draw star pattern like. n=1. * n=2. ** * n=3. *** ** * n=4 **** *** ** * n=5. ***** **** *** ** *
Aptitude questions were from the topics like Discounts, Profit or loss, Boats and streams, Work ,Pipes,Finding X and Y, Numbers, Ratio and Proportion. And all the programming questions were only from C language.
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.
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.
Quiz
Given an array, without using extra space, move all zeros to the end and no-zeros to the beginning. The function should return the number of non-zeros.
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 41 - 50 interview questions