Forest Interview Questions

4,242 forest interview questions shared by candidates

The first round: Phone interview + online coding: ?You are given an array of n integers, each of which may be positive, negative or zero. Give an algorithm to identify the start and end index, i and j, of the interval whose elements form the maximal sum of all possible intervals. Assume j >=i e.g. {1 3 -8 2 -1 10 -2 1} -> i=3 , j=5 – sum = 11 Example non-maximal sum intervals: i=0, j=5 – sum = 7 i=2, j=4 – sum = -7
May 29, 2012

The first round: Phone interview + online coding: ?You are given an array of n integers, each of which may be positive, negative or zero. Give an algorithm to identify the start and end index, i and j, of the interval whose elements form the maximal sum of all possible intervals. Assume j >=i e.g. {1 3 -8 2 -1 10 -2 1} -> i=3 , j=5 – sum = 11 Example non-maximal sum intervals: i=0, j=5 – sum = 7 i=2, j=4 – sum = -7

Viewing 4111 - 4120 interview questions

Glassdoor has 4,242 interview questions and reports from Forest interviews. Prepare for your interview. Get hired. Love your job.