Principal Engineer Interview Questions

4,347 principal engineer interview questions shared by candidates

A sequence is called Fibbonacci-ish if, 1. The sequence consists of at least two elements 2. f[0] and f[1] are arbitrary 3. f[n + 2] = f[n + 1] + f[n] for all n ≥ 0. Given an array of integers, you have to rearrange the elements to find the longest possible Fibbonacci-ish sub sequence and return its length.
avatar

Principal Software Engineer

Interviewed at Moonfrog Labs

4.1
Sep 12, 2016

A sequence is called Fibbonacci-ish if, 1. The sequence consists of at least two elements 2. f[0] and f[1] are arbitrary 3. f[n + 2] = f[n + 1] + f[n] for all n ≥ 0. Given an array of integers, you have to rearrange the elements to find the longest possible Fibbonacci-ish sub sequence and return its length.

Viewing 1771 - 1780 interview questions

Glassdoor has 4,347 interview questions and reports from Principal engineer interviews. Prepare for your interview. Get hired. Love your job.