Question 1

Binary Tree Cameras — DE Shaw Interview Question

Accepted Answer

"Binary Tree Cameras" is a hard difficulty problem asked at DE Shaw interviews. It covers the following topics: Dynamic Programming, Tree, Depth-First Search, Binary Tree. You can practice it on LeetCode: https://leetcode.com/problems/binary-tree-cameras

Question 2

Minimum Size Subarray in Infinite Array — DE Shaw Interview Question

Accepted Answer

"Minimum Size Subarray in Infinite Array" is a medium difficulty problem asked at DE Shaw interviews. It covers the following topics: Array, Hash Table, Sliding Window, Prefix Sum. You can practice it on LeetCode: https://leetcode.com/problems/minimum-size-subarray-in-infinite-array

Question 3

Maximum Subsequence Score — DE Shaw Interview Question

Accepted Answer

"Maximum Subsequence Score" is a medium difficulty problem asked at DE Shaw interviews. It covers the following topics: Array, Greedy, Sorting, Heap (Priority Queue). You can practice it on LeetCode: https://leetcode.com/problems/maximum-subsequence-score

Question 4

Removing Minimum Number of Magic Beans — DE Shaw Interview Question

Accepted Answer

"Removing Minimum Number of Magic Beans" is a medium difficulty problem asked at DE Shaw interviews. It covers the following topics: Array, Greedy, Sorting, Enumeration, Prefix Sum. You can practice it on LeetCode: https://leetcode.com/problems/removing-minimum-number-of-magic-beans

Question 5

Maximum Points Tourist Can Earn — DE Shaw Interview Question

Accepted Answer

"Maximum Points Tourist Can Earn" is a medium difficulty problem asked at DE Shaw interviews. It covers the following topics: Array, Dynamic Programming, Matrix. You can practice it on LeetCode: https://leetcode.com/problems/maximum-points-tourist-can-earn

Question 6

Letter Combinations of a Phone Number — DE Shaw Interview Question

Accepted Answer

"Letter Combinations of a Phone Number" is a medium difficulty problem asked at DE Shaw interviews. It covers the following topics: Hash Table, String, Backtracking. You can practice it on LeetCode: https://leetcode.com/problems/letter-combinations-of-a-phone-number

#	Question Title	Difficulty	Frequency	Topics
1	Binary Tree Cameras	HARD	100.0	Dynamic ProgrammingTreeDepth-First Search+1
2	Minimum Size Subarray in Infinite Array	MEDIUM	87.0	ArrayHash TableSliding Window+1
3	Maximum Subsequence Score	MEDIUM	81.7	ArrayGreedySorting+1
4	Removing Minimum Number of Magic Beans	MEDIUM	81.7	ArrayGreedySorting+2
5	Maximum Points Tourist Can Earn	MEDIUM	79.6	ArrayDynamic ProgrammingMatrix
6	Letter Combinations of a Phone Number	MEDIUM	79.6	Hash TableStringBacktracking
7	Relative Sort Array	EASY	79.6	ArrayHash TableSorting+1
8	Minimum Cost Walk in Weighted Graph	HARD	79.6	ArrayBit ManipulationUnion Find+1
9	Sum Game	MEDIUM	79.6	MathStringGreedy+1
10	Max Number of K-Sum Pairs	MEDIUM	79.6	ArrayHash TableTwo Pointers+1

Explore 450+ Companies

Companies

DE Shaw

Want to see more?

DE Shaw Interview Questions

Ai Assistant Kas

Explore 450+ Companies

Companies

AA CompaniesBrowse companies

BB CompaniesBrowse companies

CC CompaniesBrowse companies

DD CompaniesBrowse companies

EE CompaniesBrowse companies

FF CompaniesBrowse companies

GG CompaniesBrowse companies

HH CompaniesBrowse companies

II CompaniesBrowse companies

JJ CompaniesBrowse companies

KK CompaniesBrowse companies

LL CompaniesBrowse companies

MM CompaniesBrowse companies

NN CompaniesBrowse companies

OO CompaniesBrowse companies

PP CompaniesBrowse companies

QQ CompaniesBrowse companies

RR CompaniesBrowse companies

SS CompaniesBrowse companies

TT CompaniesBrowse companies

UU CompaniesBrowse companies

VV CompaniesBrowse companies

WW CompaniesBrowse companies

XX CompaniesBrowse companies

YY CompaniesBrowse companies

ZZ CompaniesBrowse companies

DE Shaw

Want to see more?

DE Shaw Interview Questions

Ai Assistant Kas