Skip to contentSkip to footer

Product Developer Interview Questions

Salaries
Interviews

1,065 product developer interview questions shared by candidates

Online Round: 1) Longest Palindromic Substring 2) One Ad Hoc Problem dont remember third one. Face to Face: Design a DB to store details of FIFA matches. Rearranging a number to form the next big number? and lots of DS questions i don't remember now.
avatar

Product Developer

Interviewed at Freshworks

3.4★
Apr 26, 2015

Online Round: 1) Longest Palindromic Substring 2) One Ad Hoc Problem dont remember third one. Face to Face: Design a DB to store details of FIFA matches. Rearranging a number to form the next big number? and lots of DS questions i don't remember now.

Online: (1) Find the number of unique pairs in an array , whose sum is equal to 'k' (2) For the first attempt you must jump one step, second two steps,... nth attempt n steps. Given you cannot reach 'k'th step and you are allowed 'n' attempts, determine the number of steps you will jump in total (3) Given an eqn. a=(p^q) + (r^s) and a is in the range from x to y find all combinations of p,q,r and s.. ( I did'nt attempt this) Technical I : (1) Trees - Binary tree and Binary search tree - creation and insertion. (2) Applications of binary search tree (3) Suggest a method to solve Online qn. (1) without hashing, using a better and efficient storage DS. Technical II : (1) Design a plugin which keeps track of maximum number of words as you type in a document. He just wanted an efficient storage DS and asked an algorithm to solve this. (2) Check if a given linked list is a palindrome. (3) Given a number convert it to Roman number. (4) Given a tic tac toe output board ( may be partial state of game ) determine the result . (x wins, 0 wins or draw)
avatar

Product Developer

Interviewed at Freshworks

3.4★
Sep 10, 2016

Online: (1) Find the number of unique pairs in an array , whose sum is equal to 'k' (2) For the first attempt you must jump one step, second two steps,... nth attempt n steps. Given you cannot reach 'k'th step and you are allowed 'n' attempts, determine the number of steps you will jump in total (3) Given an eqn. a=(p^q) + (r^s) and a is in the range from x to y find all combinations of p,q,r and s.. ( I did'nt attempt this) Technical I : (1) Trees - Binary tree and Binary search tree - creation and insertion. (2) Applications of binary search tree (3) Suggest a method to solve Online qn. (1) without hashing, using a better and efficient storage DS. Technical II : (1) Design a plugin which keeps track of maximum number of words as you type in a document. He just wanted an efficient storage DS and asked an algorithm to solve this. (2) Check if a given linked list is a palindrome. (3) Given a number convert it to Roman number. (4) Given a tic tac toe output board ( may be partial state of game ) determine the result . (x wins, 0 wins or draw)

Viewing 201 - 210 interview questions

Glassdoor has 1,065 interview questions and reports from Product developer interviews. Prepare for your interview. Get hired. Love your job.