Wells Fargo Interview Question for Analysts

Country: India
Interview Type: Written Test

Comment hidden because of low score. Click to expand.
of 0 vote

Given a binary tree, 
Find the path having maximal product.
It can be shown that for :
1. a generic binary tree, 
2. any sort of numerical values  ( +,- )
This is impossible w/o going via all possible paths,
from the root.
Thus, the problem is chalked out for us:
def node : {  v: 0 , c : [] } 

def solve( root ){
  def traversal( node, cur_path, all_paths ){
    my_path = cur_path + node.v 
    if ( empty(node.c) ){
      all_paths.add ( my_path )
    for( node.c ){ traversal($, cur_path, all_paths) }
  all_paths = list()
  traversal( root, [] , all_paths )
  all_products = list ( all_paths ) as { 
    product = fold ( $.o , 1 ) as { $.p *= $.o }
    [ $.o, product ]
  #(,max) = minmax( all_products ) where { sign($.l.1 - $.r.1) }
  max // rerturn 

- NoOne October 10, 2020 | Flag Reply

Add a Comment

Writing Code? Surround your code with {{{ and }}} to preserve whitespace.


is a comprehensive book on getting a job at a top tech company, while focuses on dev interviews and does this for PMs.

Learn More


CareerCup's interview videos give you a real-life look at technical interviews. In these unscripted videos, watch how other candidates handle tough questions and how the interviewer thinks about their performance.

Learn More

Resume Review

Most engineers make critical mistakes on their resumes -- we can fix your resume with our custom resume review service. And, we use fellow engineers as our resume reviewers, so you can be sure that we "get" what you're saying.

Learn More

Mock Interviews

Our Mock Interviews will be conducted "in character" just like a real interview, and can focus on whatever topics you want. All our interviewers have worked for Microsoft, Google or Amazon, you know you'll get a true-to-life experience.

Learn More