De Shaw - Onsite
- Posted
- 30 Oct 2026
Summary
I went through De Shaw's onsite interview process, which included DSA, multithreading, and LLD rounds, but was rejected the next day.
How it went
Online OA - don't exactly have the questions after 2 months of OA i got call for screening round
Screening round(Online) - Remove minimum number of Magic beans problem https://leetcode.com/problems/removing-minimum-number-of-magic-beans/description/ Snake and Ladder LLD
Onsite Interviews : Round 1 got cancelled Round 2 - DSA que - https://leetcode.com/problems/minimum-number-of-taps-to-open-to-water-a-garden/description/ Java Multithreading concepts - virtual functions,Thrashing, Paging, Deadlock conditions, whether i used multithreading in my project Round 3 - Java multithreading - Implement two threads where one prints odd numbers and other even numbers upto a given limit and they need to be printed in ascending order..1 2 3 4.. Parking Lot LLD Round 4 - General discussions with recruiter on why I'm i shifting, why de shaw, any plans of studies for future
They informed Round 1 will be scheduled but got rejected the next day Verdict - Reject
Questions asked (3)
- 01
Removing Minimum Number of Magic Beans
Data Structures & Algorithms · Medium
Open the problemGiven an array
beanswherebeans[i]denotes the number of magic beans in the i‑th pile, you may discard any number of beans from any piles. After discarding, all non‑empty piles must contain the same number of beans. Return the minimum total number of beans that need to be discarded. - 02
Minimum Number of Taps to Open to Water a Garden
Data Structures & Algorithms · Medium
Open the problemYou are given an integer
nrepresenting a garden of lengthn. There aren + 1taps on the garden, where the i‑th tap can water the interval[i - ranges[i], i + ranges[i]]. Return the minimum number of taps you need to open to water the whole garden, or-1if it is impossible. - 03
Print odd and even numbers using two threads in order
Data Structures & Algorithms
Implement two Java threads: one thread prints odd numbers and the other prints even numbers up to a given limit
N. The output must appear in ascending order (1 2 3 4 … N). Synchronize the threads so that they alternate correctly.