Hi Everyone, I had my 1st round of OA at DE shaw, which were 2 DSA questions: https://stackoverflow.com/questions/78605468/minimum-numbers-of-operation-required-to-make-an-array-bitonic Given a tree with n nodes, n-1 weighted edges, you can remove as...

LeetCode Question · Sep 2024 · Los Angeles

DE SHAW | Member Technical | Interview rounds | Rejected

SWE OA

1 upvote 97 views

Hi Everyone, I had my 1st round of OA at DE shaw, which were 2 DSA questions: Given a tree with n nodes, n-1 weighted edges, you can remove as...

🔒

Unlock full leaked content

Full insider details, leaked discussions, and candidate experiences.

Arrays Graph Sql Greedy Strings Binary Tree Concurrency