Interview Question

Software Development Engineer Intern Interview

Given a triangle of integers, find the path of the largest

  sum without skipping.

Interview Answer

1 Answer


I used a binary tree with a recursive algorithm to return the largest sum. He seemed happy but I am sure this was less than ideal. I think the proper way would be to use an array of integers and use the index.

Interview Candidate on Mar 9, 2014

Add Answers or Comments

To comment on this Question, Sign In with Facebook or Sign Up