DE Shaw Placement Papers 2026 | Quantitative Trading Interview Questions & Solutions

Meta Description: Ace DE Shaw campus placements 2026 with real aptitude questions, quant puzzles, coding problems, and interview strategies. Fresher CTC: ₹25–50 LPA. Complete guide with detailed solutions for software and analyst roles.

---

About DE Shaw

DE Shaw & Co. is a multinational investment management firm headquartered in New York City, founded in 1988 by David E. Shaw. The firm is globally recognized as a pioneer in quantitative and computational finance, managing tens of billions of dollars in assets through systematic, algorithm-driven investment strategies. DE Shaw is consistently ranked among the most innovative and intellectually demanding firms on Wall Street, famous for its rigorous hiring standards and the exceptional quality of talent it attracts.

In India, DE Shaw has its largest non-US office in Hyderabad, housing thousands of employees across technology, quantitative research, and operations. The India team is fully integrated into the firm's global strategy — engineers and researchers in Hyderabad work on the same systems and research problems as their counterparts in New York. This makes DE Shaw India an incredibly high-impact workplace, where fresher hires from top colleges contribute to live trading systems handling billions of dollars in capital.

DE Shaw recruits extensively from India's top campuses — IIT Bombay, IIT Delhi, IIT Madras, IIT Kharagpur, IIT Hyderabad, BITS Pilani, and NIT Trichy, among others. The firm hires for two primary tracks: Software Development Engineer (SDE) and Software Development Analyst (SDA) — the latter being a quantitative research/analysis-focused role. Fresher compensation is among the highest in India's campus placement ecosystem, ranging from ₹25 LPA to ₹50 LPA depending on the role and individual performance.

---

Eligibility Criteria

Parameter	Requirement
Degree	B.Tech / B.E. / M.Tech / Dual Degree / MCA
Branches	CS, IT, ECE, Mathematics, Statistics (SDE); Math/Stats preferred for SDA
Minimum CGPA	7.5 / 10 (SDE); 8.0 / 10 (SDA / Quant Research)
Active Backlogs	Zero tolerance
Historical Backlogs	None allowed
Year of Graduation	2026 batch
10th Marks	≥ 75%
12th Marks	≥ 75%
Special Note	Strong mathematical foundations extremely important

Important: DE Shaw has among the strictest eligibility criteria of any Indian campus recruiter. Candidates with any backlog history are typically not considered.

---

Selection Process

DE Shaw's selection process is one of the most intellectually challenging in campus placements. It typically spans multiple rounds over 1–2 days:

1. Online Aptitude Test — Tests mathematical aptitude, logical reasoning, and quantitative skills at a very high difficulty level. Duration: 90–120 minutes. This is the primary filter — often less than 15% of applicants proceed.

2. Written/Online Coding Test — Advanced coding problems (Medium to Hard LeetCode level), including algorithmic problems, numerical computing, and sometimes mathematical proofs. 2–3 problems in 60–90 minutes.

3. Technical Interview Round 1 (SDE track) — Deep DSA: dynamic programming, graph algorithms, advanced trees. Expect to write complete, compiling code on paper or a shared editor. System design at a junior level.

4. Technical Interview Round 1 (SDA/Quant track) — Probability theory, statistics, linear algebra, stochastic calculus basics, brain teasers, and mathematical proofs. Very demanding.

5. Technical Interview Round 2 — Combined: coding + mathematical problem solving. Interviewers are typically PhDs or senior engineers. Expect unconventional questions.

6. HR / Culture Interview — Assesses alignment with DE Shaw's intellectual culture, honesty, curiosity, and long-term vision. This round is generally straightforward if you've cleared the technical rounds.

---

Exam Pattern

Section	Topics	Questions	Time	Difficulty
Quantitative Aptitude	Advanced Probability, Combinatorics, Number Theory, Algebra	20	35 min	High
Logical/Analytical Reasoning	Logical deduction, Puzzles, Data Interpretation	15	25 min	High
Verbal Ability	RC, Critical Reasoning	10	20 min	Medium
Coding	DSA, Algorithm Design	2–3	45–60 min	Medium-Hard
Total		~48	~140 min	High overall

DE Shaw's aptitude test is significantly harder than industry average. Questions often resemble olympiad-style mathematics.

---

Practice Questions with Detailed Solutions

Quantitative / Quant Puzzles

---

Q1. You have a 3-gallon jug and a 5-gallon jug. How do you measure exactly 4 gallons?

Solution:

Step 1: Fill the 5-gallon jug. Step 2: Pour from 5-gallon into 3-gallon jug until full (3G). Remaining: 2G in 5-gallon. Step 3: Empty the 3-gallon jug. Step 4: Pour the 2G from 5-gallon into 3-gallon. Step 5: Fill the 5-gallon jug again. Step 6: Pour from 5-gallon into 3-gallon (which has 2G, needs 1G more to fill). Remaining in 5-gallon: 4 gallons.

---

Q2. A biased coin shows heads with probability 0.6. You flip it 3 times. What is the probability of getting exactly 2 heads?

Solution:

P(exactly 2 heads in 3 flips) = C(3,2) × (0.6)² × (0.4)¹ = 3 × 0.36 × 0.4 = 3 × 0.144 = 0.432 (43.2%)

---

Q3. What is the expected number of coin flips to get 2 consecutive heads?

Solution (Markov Chain):

Let E = expected flips from start Let E₁ = expected flips when last flip was H

From start: E = 1 + (0.5)E₁ + (0.5)E From one head: E₁ = 1 + (0.5)(0) + (0.5)E (HH stops; HT goes back to start)

From equation 2: E₁ = 1 + 0.5E Substitute into equation 1: E = 1 + 0.5(1 + 0.5E) + 0.5E E = 1 + 0.5 + 0.25E + 0.5E E – 0.75E = 1.5 0.25E = 1.5 E = 6 flips

---

Q4. You roll two fair dice. Given that the sum is at least 8, what is the probability that the sum is exactly 10?

Solution:

Outcomes where sum ≥ 8: (2,6),(3,5),(3,6),(4,4),(4,5),(4,6),(5,3),(5,4),(5,5),(5,6),(6,2),(6,3),(6,4),(6,5),(6,6) = 15 outcomes

Outcomes where sum = 10: (4,6),(5,5),(6,4) = 3 outcomes

P(sum = 10 | sum ≥ 8) = 3/15 = 1/5 = 0.2

---

Q5. How many integers from 1 to 1000 are divisible by at least one of 3, 5, or 7?

Solution (Inclusion-Exclusion):

|A| = ⌊1000/3⌋ = 333 |B| = ⌊1000/5⌋ = 200 |C| = ⌊1000/7⌋ = 142 |A∩B| = ⌊1000/15⌋ = 66 |A∩C| = ⌊1000/21⌋ = 47 |B∩C| = ⌊1000/35⌋ = 28 |A∩B∩C| = ⌊1000/105⌋ = 9

Total = 333+200+142–66–47–28+9 = 543

---

Q6. A random walk: you start at 0, move +1 with prob 0.5 and -1 with prob 0.5. What is the probability of reaching +3 before -1?

Solution (Gambler's Ruin):

Starting position: 0, target: +3 (win), boundary: -1 (lose) In gambler's ruin with p = q = 0.5, starting at position k from lower boundary (k = 0 – (–1) = 1), total distance n = 3 – (–1) = 4.

P(reach upper boundary) = k/n = 1/4 = 0.25

---

Q7. Number of trailing zeros in 100!

Solution:

Trailing zeros come from factors of 10 = 2 × 5. Count factors of 5 (limiting):

⌊100/5⌋ + ⌊100/25⌋ = 20 + 4 = 24 trailing zeros

---

Q8. If f(x) = x³ – 6x² + 11x – 6, find all roots.

Solution:

Try x = 1: 1 – 6 + 11 – 6 = 0 ✓ Factor: (x–1)(x²–5x+6) = (x–1)(x–2)(x–3)

Roots: x = 1, 2, 3

---

Coding Questions

---

Q9. Longest Increasing Subsequence (LIS)

def lengthOfLIS(nums):
    import bisect
    tails = []
    for num in nums:
        pos = bisect.bisect_left(tails, num)
        if pos == len(tails):
            tails.append(num)
        else:
            tails[pos] = num
    return len(tails)

# Example: [10,9,2,5,3,7,101,18] → 4 ([2,3,7,101])
# Time: O(n log n) | Space: O(n)
# Note: The "tails" array isn't the actual LIS, but its length is correct.

---

Q10. Given N, find the Nth Fibonacci number in O(log N) time.

def matMul(A, B):
    return [
        [A[0][0]*B[0][0] + A[0][1]*B[1][0], A[0][0]*B[0][1] + A[0][1]*B[1][1]],
        [A[1][0]*B[0][0] + A[1][1]*B[1][0], A[1][0]*B[0][1] + A[1][1]*B[1][1]]
    ]

def matPow(M, n):
    if n == 1:
        return M
    if n % 2 == 0:
        half = matPow(M, n // 2)
        return matMul(half, half)
    else:
        return matMul(M, matPow(M, n - 1))

def fibonacci(n):
    if n <= 0: return 0
    if n == 1: return 1
    M = [[1,1],[1,0]]
    result = matPow(M, n-1)
    return result[0][0]

# Time: O(log n) | Space: O(log n) for recursion stack

---

Q11. Count the number of ways to reach the Nth stair (can take 1, 2, or 3 steps at a time).

def countWays(n):
    if n < 0: return 0
    if n == 0: return 1
    dp = [0] * (n + 1)
    dp[0] = 1
    for i in range(1, n + 1):
        dp[i] = dp[i-1]
        if i >= 2: dp[i] += dp[i-2]
        if i >= 3: dp[i] += dp[i-3]
    return dp[n]

# Example: n=4 → 7 ways
# Time: O(n) | Space: O(n) [can be O(1) with rolling variables]

---

Q12. Find all subsets of a set (Power Set).

def powerSet(nums):
    result = [[]]
    for num in nums:
        result += [subset + [num] for subset in result]
    return result

# Example: [1,2,3] → [[],[1],[2],[1,2],[3],[1,3],[2,3],[1,2,3]]
# Total subsets = 2^n | Time: O(n × 2^n) | Space: O(n × 2^n)

---

Q13. Design a data structure that supports insert, delete, and getRandom in O(1).

import random

class RandomizedSet:
    def __init__(self):
        self.val_to_idx = {}
        self.vals = []
    
    def insert(self, val):
        if val in self.val_to_idx:
            return False
        self.vals.append(val)
        self.val_to_idx[val] = len(self.vals) - 1
        return True
    
    def remove(self, val):
        if val not in self.val_to_idx:
            return False
        idx = self.val_to_idx[val]
        last = self.vals[-1]
        self.vals[idx] = last
        self.val_to_idx[last] = idx
        self.vals.pop()
        del self.val_to_idx[val]
        return True
    
    def getRandom(self):
        return random.choice(self.vals)

# All three operations: O(1) average time

---

Q14. Mathematical Puzzle — Classic DE Shaw Brain Teaser

Problem: You have 12 balls, all identical in weight except one which is either heavier or lighter. Using a balance scale in exactly 3 weighings, identify the odd ball and whether it's heavier or lighter.

Solution Outline:

Weighing 1: Divide into groups of 4: A (1-4), B (5-8), C (9-12) Weigh A vs B:

Case 1 — A = B: Odd ball is in C.

• Weighing 2: Weigh 3 balls from C against 3 from A (known good).
• If equal → ball 12 is odd; Weighing 3: weigh ball 12 against a good ball → determine heavy/light.
• If unequal → identify which group is heavier, do targeted comparison in Weighing 3.

Case 2 — A ≠ B: Note which side is heavier. Rotate balls between groups strategically in Weighing 2 to narrow down, then confirm in Weighing 3.

This is a classic information theory problem: 3 weighings give 3³ = 27 outcomes, enough to distinguish 24 cases (12 balls × 2 possibilities – ambiguities).

---

Q15. Integral approximation / Numerical reasoning

Problem: Estimate ∫₀¹ x² dx using the trapezoidal rule with n=4 intervals.

Solution:

h = (1–0)/4 = 0.25 x values: 0, 0.25, 0.5, 0.75, 1.0 f(x) = x²: 0, 0.0625, 0.25, 0.5625, 1.0

Trapezoidal = h/2 × [f(0) + 2f(0.25) + 2f(0.5) + 2f(0.75) + f(1)] = 0.125 × [0 + 0.125 + 0.5 + 1.125 + 1.0] = 0.125 × 2.75 = 0.34375

Exact value = 1/3 ≈ 0.3333. Trapezoidal error ≈ 0.0104. ✓

---

HR Interview Questions & Sample Answers

Q1. DE Shaw is known for being very selective. Why do you think you belong here?

Sample Answer: "I genuinely enjoy problems that exist at the intersection of mathematics and computation. My coursework in probability, algorithms, and numerical methods, combined with personal projects in algorithmic trading simulations, has given me a taste of the kind of thinking DE Shaw values. I'm not intimidated by hard problems — I'm energized by them. I recognize this is an exceptional firm, and I'm excited to grow alongside people who share that intellectual curiosity."

---

Q2. Describe the most technically challenging project you've worked on.

Sample Answer: "I built a portfolio optimization tool using Modern Portfolio Theory that dynamically rebalanced based on real-time market data. The challenge was handling numerical instability in the covariance matrix estimation when asset returns were highly correlated. I implemented a shrinkage estimator (Ledoit-Wolf) to regularize the matrix, which resolved the issue. The project gave me hands-on experience with the kind of numerical challenges that quantitative finance faces daily."

---

Q3. How do you approach a problem you've never seen before?

Sample Answer: "First, I try to understand the constraints and what a valid solution looks like. Then I look for simpler analogues — can I reduce this to a known problem? If not, I try small examples to find patterns. I'm comfortable sitting with uncertainty and exploring dead ends methodically. I also know when to ask for a hint or reframe the problem — intellectual humility is important in research environments."

---

Q4. What's a book or paper you've read recently that influenced your thinking?

Sample Answer: "I recently read 'Options, Futures, and Other Derivatives' by John Hull for financial context alongside Paul Graham's essays on startup thinking. But the piece that influenced me most technically was Andrej Karpathy's 'The Unreasonable Effectiveness of Recurrent Neural Networks' — it demonstrated how elegant architectures applied thoughtfully can produce remarkable results with relatively simple principles. It reinforced my belief that understanding fundamentals deeply beats chasing trends."

---

Q5. How do you handle being wrong?

Sample Answer: "I think being wrong quickly and cheaply is one of the most valuable skills in technical work. I actively try to falsify my own hypotheses before presenting them. When I'm wrong — and I often am in competitive coding and math — I trace back to the assumption that failed. I keep a personal 'error log' for competitive programming to avoid repeating the same class of mistakes."

---

Preparation Tips

• Olympic-level mathematics: DE Shaw's aptitude section is closest to math olympiad problems. Practice from books like "Fifty Challenging Problems in Probability" by Mosteller and "Heard on the Street" by Crack.
• Master DP and graph algorithms: Expect Hard-level LeetCode problems in coding rounds. Know Bellman-Ford, Dijkstra, Floyd-Warshall, and advanced DP (bitmask, interval DP).
• Probability and statistics are foundational: For SDA roles especially, know Bayes' theorem, Markov chains, random walks, law of large numbers, and CLT deeply.
• Practice brain teasers: DE Shaw loves classic puzzles — pirates and gold coins, balance scale problems, hat color puzzles. Resources: "Mathematical Puzzles and Diversions" by Martin Gardner.
• Revise linear algebra and calculus: Matrix operations, eigenvalues, gradient descent foundations — these appear in both coding and quant rounds.
• Know your resume inside-out: Every project, every formula you wrote, every design decision is fair game. Be ready to go 5 levels deep on any claim.
• Read DE Shaw's published research: Their public papers and talks give insight into the firm's approach and show intellectual curiosity.

---

Frequently Asked Questions

Q: What is DE Shaw's fresher salary in India for 2026? A: SDE roles: ₹25–35 LPA. SDA / Quant Research Analyst roles: ₹35–50 LPA. Packages include base salary, performance bonus, and comprehensive benefits. Premier campus hires may receive higher offers.

Q: Is it possible to crack DE Shaw from a non-IIT college? A: Yes, but it's harder. DE Shaw does recruit from select NITs and BITS Pilani. A CGPA of 9.0+ and demonstrable competitive programming or research credentials significantly help.

Q: Which roles does DE Shaw hire freshers for in India? A: Primarily Software Development Engineer (SDE), Software Development Analyst (SDA), and occasionally Research Analyst roles in Hyderabad.

Q: How difficult is DE Shaw's online aptitude test compared to other firms? A: Significantly harder. DE Shaw's aptitude section is closer to JEE Advanced level mathematics and olympiad-style reasoning. Most students find it the toughest screening round they've faced.

Q: Does DE Shaw offer internships that convert to full-time offers? A: Yes. DE Shaw's summer internship program is highly structured, and strong performers receive pre-placement offers (PPOs). Interning at DE Shaw is one of the best ways to secure a full-time role.

---

Last updated: March 2026 | Source: Campus placement data, student testimonials, DE Shaw careers portal.