Jane Street Interview Question: Make it tail recursive

Skip to content Skip to footer

Community
Jobs
Companies
Salaries
For Employers

Notifications

Jane Street

Jane Street Software Engineer interview

Jane Street Interview Question

Software Engineer Interview

Make it tail recursive

Interview Answers

Anonymous

Nov 5, 2010

let depth n = let rec loop n k = match n with | Leaf -> k 0 | Node (_, left, right) -> loop left (fun v1 -> loop right (fun v2 -> k (1 + max v1 v2))) in loop n (fun x -> x)

Anonymous

Dec 24, 2017

max_depth = 0 def dfs(node, counter): if node is not None: counter += 1 if node->left is None and node -> right is None: max_depth = max(max_depth, counter) else: dfs(node->left, counter) dfs(node->right, counter)

Jane Street interviews

Jane Street

Jane Street Interview Question

Interview Answers

Want the inside scoop on your own company?

Bowls

Followed companies

Job searches