LeetCode
Question
·
Feb 2025
No Ancestor Subset Hackerrank DE Shaw
1 upvote
139 views
2 replies
Question Details
Solution: public static long findMaximumSum(int treeNodes, List<Integer> treeFrom, List<Integer> treeTo, List<Integer> weight) { Map<Integer, List<Integer>> graph = new HashMap<>(); for (int i = 1; i <= treeNodes; i++) { graph.put(i, new...
Full Details
🔒
Unlock all D.E. Shaw questions
Full insider details, leaked discussions, and candidate experiences.
or every company, $100/year →About This Question
This is a reported interview question from a d.e. shaw interview for a swe role during the oa round reported in 2025.
It covers the following topics: Hash Table, Graph, Arrays, Dynamic Programming .
Topics
More D.E. Shaw Interview Questions
1p3a
DE Shaw Lead Principal Software Engineer Interview Experience
GeeksforGeeks
DE Shaw Interview Experience
GeeksforGeeks
DE Shaw Interview Experience (Off-Campus)
GeeksforGeeks
DE Shaw Interview Experience (for Internship)
GeeksforGeeks
D E Shaw Interview Experience | Set 17 (Arcesium for 1 Yr & 8 Months Experienced)