LeetCode Question · Jan 2025 · Los Angeles

DE Shaw | Online Assessment | Collect maximum points from Tree | Jan 2025

SWE OA

1 upvote 544 views 3 replies

Question Details

Question1: Min-cost-to-remove-all-array-elements Question 2: A connected unweighted undirected graph with N nodes andN-1 edges (tree) was given where each node were labled from 0 to N-1, Also a value K were given...

Full Details

🔒

Unlock full leaked content

Full insider details, leaked discussions, and candidate experiences.

Get Premium →

Topics

Arrays Binary Tree Graph

More from D.E. Shaw

Reddit DE Shaw Interview 1p3a DE Shaw Lead Principal Software Engineer Interview Experience Reddit Anyone has given hackerrank test for DE Shaw for data engineering role ? GeeksforGeeks DE Shaw Interview Experience (Off-Campus) GeeksforGeeks DE Shaw Interview Experience (for Internship)

← All D.E. Shaw questions D.E. Shaw Software Engineer Questions → All Algorithms Questions →