Company sheets › DE Shaw
DE Shaw interview preparation
Global investment and technology firm with a large Hyderabad office. Software developer and quantitative roles; the bar is high and the process is demanding on algorithms, maths and C++.
DE Shaw hiring process
- Online assessment — Hard algorithmic problems, often with probability, maths or puzzle MCQs under tight time.
- Technical interviews (2–4) — Advanced DSA, C++ and OS internals (memory, threads, caching), and probability / brain teasers.
- Final / fit round — Projects, how you think under pressure and why trading technology.
The process changes from year to year — check the official notice for the exact pattern.
Aptitude topics to practise
Interview topics
- DSA interview questions
- Operating Systems interview questions
- OOP interview questions
- Computer Networks interview questions
Tips
- Competitive-programming practice (Codeforces / contests) is the best preparation for the assessment.
- Know C++ well: STL complexity, memory layout, move semantics, virtual functions.
- Practise probability and expected-value puzzles and explain your reasoning step by step.
DE Shaw DSA problems (1)
- nCr Modulo a Large Prime — Medium
DSA problems asked at similar companies
- Power with Modulo — Medium
- Single Number — Easy
- Best Time to Buy and Sell Stock — Easy
- Range Sum Queries — Easy
- Two Sum — Medium
- Maximum Subarray Sum — Medium
- Majority Element — Medium
- Longest Consecutive Sequence — Medium
- Subarray Sum Equals K — Medium
- Merge Intervals — Medium
- Maximum Product Subarray — Medium
- 3Sum Count — Medium
- Spiral Matrix — Medium
- Rotate Matrix 90 Degrees — Medium
- Next Permutation — Medium
- Find the Duplicate Number — Medium
- Majority Element II — Medium
- Best Time to Buy and Sell Stock II — Medium
- Maximum Circular Subarray Sum — Medium
- Count Subarrays with XOR K — Medium
- Count Inversions — Hard
- Trapping Rain Water — Hard
- Reverse Pairs — Hard
- Longest Common Prefix — Easy
- Roman to Integer — Easy
- Isomorphic Strings — Easy
- Remove Outermost Parentheses — Easy
- Integer to Roman — Medium
- Longest Palindromic Substring — Medium
- String to Integer (atoi) — Medium
- Sort Characters by Frequency — Medium
- Find All Pattern Occurrences — Medium
- Shortest Palindrome by Adding in Front — Hard
- Squares of a Sorted Array — Easy
- Happy Number — Easy
- Count Pairs with Difference K — Medium
- Container With Most Water — Medium
- Group Anagrams Count — Medium
- 3Sum Closest — Medium
- Subarray Sums Divisible by K — Medium