D. E. Shaw Interview Guide

Showing 3 of 126 questions

Ranking

A question's ranking corresponds to how commonly it's asked by D. E. Shaw. The higher the ranking, the more likely you'll encounter it in a D. E. Shaw interview.

Question

Frequency

Difficulty

Maximum Number of Subsequences After One Inserting

Given a string 't', and a target string 's', find the maximum number of times 's' appears as a subsequence of 't' after inserting exactly one character into 't'. The inserted character must be equal to a character in 's'.

ArraysStringsGreedy Algorithms

Very likely

If you have a D. E. Shaw interview, it's very likely that you will get this question

Medium

#1. Maximum Number of Subsequences After One Inserting

Medium

ArraysStringsGreedy Algorithms

This question is very likely to be asked in your D. E. Shaw interview

Binary Tree Cameras

You are given a binary tree. Place cameras on some nodes such that all nodes are either covered by a camera on itself, or on one of its parents or children. Minimize the number of cameras used.

TreesRecursionGreedy AlgorithmsDynamic Programming

Very likely

If you have a D. E. Shaw interview, it's very likely that you will get this question

Hard

#2. Binary Tree Cameras

Hard

You are given a binary tree. Place cameras on some nodes such that all nodes are either covered by a camera on itself, or on one of its parents or children. Minimize the number of cameras used.

TreesRecursionGreedy AlgorithmsDynamic Programming

This question is very likely to be asked in your D. E. Shaw interview

Minimum Number of Taps to Open to Water a Garden

Imagine you're watering a garden using strategically placed taps. Find the fewest taps you need to open to water the entire garden, given each tap's watering range.

ArraysGreedy AlgorithmsDynamic Programming

Very likely

If you have a D. E. Shaw interview, it's very likely that you will get this question

Hard

#3. Minimum Number of Taps to Open to Water a Garden

Hard

Imagine you're watering a garden using strategically placed taps. Find the fewest taps you need to open to water the entire garden, given each tap's watering range.

ArraysGreedy AlgorithmsDynamic Programming

This question is very likely to be asked in your D. E. Shaw interview

Explore Interview QuestionsTaro 75 Google Interview Questions Meta Interview Questions Amazon Interview Questions Apple Interview Questions Netflix Interview Questions

Explore Interview ExperiencesOpenAI Interview Experiences Anthropic Interview Experiences Perplexity Interview Experiences Windsurf Interview Experiences Mistral AI Interview Experiences

ProductBecome An Affiliate Great Discussions Perks Topics

CompanyBlog Privacy Policy Terms & Conditions Support