D. E. Shaw Software Engineer Interview Questions & Rounds
D. E. Shaw software engineer interview guide: the OA, DSA and systems rounds, and preparation advice drawn from real candidate experiences in India.
On this page
Last reviewed November 20, 2026 · 31 min read · For candidates targeting Software Engineer, SDE, Fresher and Technology Developer Intern roles in India and the US
Researched and written by the Codinzhub Editorial Team from eleven independent sources: ten internal candidate records and one public first-hand account. Four files with different spellings of the company name were merged, and several near-identical IIITB internship write-ups were collapsed into one cluster. Every question below is a verbatim report or a faithful paraphrase; nothing was invented to fill a round.
The 30-second version: D. E. Shaw software interviews screen hard on DSA and fundamentals. The repeated assessment shape is two or three coding questions, sometimes with individual timers of 25, 35 and 35 minutes and no switching, plus technical MCQs. Technical rounds then go deeper: Manacher modifications and 3D knapsack for full-time candidates, tries and bitmask DP for interns, and OOP, DBMS, OS and networking deep dives across levels. Interviewers push for one more layer after each answer. A resume project must be defensible like a viva. Outcomes range from offers to rejections after a single round, and one candidate declined the offer.
Important things to know before you start
The assessment rewards speed under segmentation. One campus OA used individual timers of 25, 35 and 35 minutes, camera and mic proctoring, and no switching between questions. The candidate noted that the problems were not individually hard; the pressure came from the format.
Follow-ups are the real test. In one round, detecting a graph cycle was followed by a request to print the actual cycle. A string-rotation problem had follow-ups for k up to 1e18 and multiple offsets. No solved problem stayed solved.
Resume depth is non-negotiable. One candidate was asked how a project was validated and what was being optimised for. Another was asked about a CNN and deep learning project at length. Treat every resume line as a potential viva question.
Fundamentals are examined deeply, not by definition. Accounts report deep dives into operating systems, networking, ACID enforcement in MongoDB, TLS handshake, scheduling algorithms, virtual functions, smart pointers and normalisation.
Not every software loop looks the same. A System Developer candidate was asked Linux knowledge questions and then faced entirely Python file-parsing coding tasks, despite preparing Java DSA. Confirm the role family with your recruiter.
What this guide covers
This guide covers the D. E. Shaw Software Engineer role family in India and the US: SDE, SWE, Fresher, MTS, Systems Intern, SDE Intern and Technology Developer Intern. Levels are separated in the tables. Data Scientist is a different role family and is excluded. The System Developer account is retained as a tier B software variant.
Scope: Eleven sources with evidence from 2024 to 2026. Internships are included in this guide because the evidence pool is shared across levels; if a separate intern guide is needed later, re-run the pipeline with these records.
Selected vs. rejected: do this, not that
These habits come from offers, rejections and candidate reflections across the dataset.
| Do this | Not that | Why it matters |
|---|---|---|
| Practise with individual question timers. | Practise only full-length tests with free switching. | One OA locked question order and timers. |
| Expect a follow-up after every solution. | Stop once a sample case passes. | Cycle detection became cycle printing; k=1e9 became k=1e18. |
| Defend every project and technology on your resume. | List MongoDB, UVM or a framework without depth. | Candidates were asked why a specific DB was chosen and how ACID works in it. |
| Revise OS, networks, DBMS and OOP as interview topics. | Spend all time on DSA. | Several rounds were dominated by fundamentals. |
| Ask the recruiter what the role actually involves. | Assume the job title predicts the loop. | One System Developer discovered the coding round was Python file parsing. |
Round-by-round breakdown
Stage 1: Application
The routes are campus drives, the careers page and LinkedIn recruiter outreach. One final-year candidate was contacted by a recruiter on LinkedIn and later declined the offer. A Fresher candidate applied through the careers page and received an invitation to an off-campus test. Most internship accounts came from campus placement.
Stage 2: Shortlisting
Resume shortlisting is the first filter in campus processes. One Technology Developer Intern account reports 10 of 16 students shortlisted after the first technical interview. One Software Internship account describes an HR call before the coding test. No account describes a formal recruiter questionnaire.
Stage 3: Online assessment
How it works. Assessments ranged from 90 to 120 minutes. A Fresher account describes 90 minutes with two coding questions worth 20 and 40 marks and 20 MCQs with negative marking. A full-time SWE account describes 120 minutes with two hard coding questions and 20 CS MCQs. The IIITB internship cluster used a three-question OA with individual timers and no switching.
At a glance: 2 to 3 coding questions plus 10 to 20 MCQs; 90 to 120 minutes; HackerRank in several accounts; individual timers in one. Topics: DP, graphs, strings, prefix sums, binary search, OS, DBMS, networks, OOP and aptitude.
| Question summary | Skill or pattern | Reported follow-up | Level / scope | Practice link |
|---|---|---|---|---|
| Pick exactly two services within a budget to maximise utility. | Binary search or prefix maximum | Not reported | Intern cluster | No verified practice match |
| Maximum path sum in a DAG. | Topological sort + DP | Not reported | Intern cluster | No verified practice match |
| Convert an array into a permutation with minimum changes and lexicographically smallest result. | Greedy | Not reported | Intern cluster | No verified practice match |
| A modification of Manacher's algorithm. | Strings / DP | Not reported | SWE full-time | No verified practice match |
| Double knapsack solved with 3D DP. | Dynamic programming | Not reported | SWE full-time | No verified practice match |
| 20 MCQs on OS, DBMS, networks, OOP and logical reasoning. | CS fundamentals | Not reported | SWE full-time | No verified practice match |
| Find the kth permutation of a string. | Strings / combinatorics | Not reported | Fresher, 2025 | No verified practice match |
| Three coding questions on binary search, DP and prefix sums. | Mixed DSA | Not reported | Technology Developer Intern | No verified practice match |
| 10 technical and 10 aptitude MCQs with negative marking. | CS fundamentals and aptitude | Not reported | Fresher, 2025 | No verified practice match |
D. E. Shaw OA questions shared on Codinzhub:
| Question | Drive | Topic |
|---|---|---|
| Minimum Frames to Add for Equal-Sized Chunks | Not stated | Binary search, greedy |
| Delete Longest Subarray | NIT Bhopal | Sliding window |
| Minimum Number of Substrings | Not stated | DP, strings |
| Minimum Time to Complete Tasks in a Tree | MNIT Jaipur | Tree DP |
Full D. E. Shaw interview experiences on Codinzhub: MTS intern, IIT Kharagpur (2026), Intern, OA and interview, IIT Guwahati.
More Codinzhub questions: Browse D. E. Shaw questions.
Stage 4: Technical rounds
Round 1: DSA and coding
How it works. This is the defining stage. Intern rounds included a trie-plus-DP word-break problem, a bitmask DP grid puzzle, cycle detection with cycle reconstruction, and a string-rotation counting problem with large k. Full-time rounds included Manacher and double knapsack in the OA, then Chess object-oriented design, N-Queens, Fenwick XOR ranges and weighted prefix search. Experienced candidates faced range-score maximisation, lexicographically smallest string after deletions and inversion counting.
At a glance: 45 to 120 minutes; 2 to 6 named prompts per account; shared editor, paper, whiteboard and online tests. Topics: tries, DP, graphs, strings, trees, backtracking, bit manipulation and design.
| Question summary | Skill or pattern | Reported follow-up | Level / scope | Practice link |
|---|---|---|---|---|
| Break a string into dictionary substrings with minimum cost and count the minimum-cost ways. | Trie + DP | Not reported | SDE Intern, 2026 | No verified practice match |
| Collect all coins on a grid in minimum steps and display the path. | Bitmask DP | Not reported | SDE Intern, 2026 | No verified practice match |
| Detect a directed-graph cycle, then print the actual cycle. | DFS recursion stack | Print the cycle | SDE Intern | No verified practice match |
| Count ways to reach target t from s in exactly k suffix rotations mod 1e9+7. | Rotation maths | k up to 1e18; multiple offsets | SDE Intern | No verified practice match |
| Longest increasing subsequence in O(n^2) and O(n log n). | DP + binary search | Both required | Systems Intern | Longest Increasing Subsequence |
| Implement Chess following object-oriented design principles. | OOD | Not reported | SWE full-time | No verified practice match |
| N-Queens. | Backtracking | Not reported | SWE full-time | N-Queens |
| Fenwick tree: XOR of elements in a range. | Fenwick / BIT | Not reported | SWE full-time | No verified practice match |
| Weighted prefix search. | Prefix sums | Not reported | SWE full-time | No verified practice match |
| Maximise score of numbers in ranges. | Arrays / greedy | Not reported | MTS / SDE | No verified practice match |
| Lexicographically smallest string after at most k deletions. | Monotonic stack | Not reported | MTS / SDE | No verified practice match |
| Count inversions where arr[i] >= 2*arr[j]. | Binary search / merge sort | Not reported | MTS / SDE | No verified practice match |
| Ways to express a number as a sum of consecutive natural numbers. | Maths | Not reported | Fresher | No verified practice match |
| Buy and sell stock over N days to maximise profit. | DP | Not reported | Fresher | Best Time to Buy and Sell Stock |
| Maximum subsequences after one insertion. | Strings / counting | Not reported | Software Internship | No verified practice match |
| Binary Tree Cameras. | Tree DP | Not reported | Software Internship | Binary Tree Cameras |
| Minimum taps to water a garden. | Greedy intervals | Not reported | Software Internship | Minimum Taps to Open to Water a Garden |
| Design a class for canvas draw, delete and move operations. | Class design | Not reported | Technology Developer Intern | No verified practice match |
| Count structurally unique BSTs. | Tree DP | Not reported | Intern cluster | Unique Binary Search Trees |
| Maximum sum BST inside a binary tree; pseudocode only. | Tree DP | Not reported | Intern cluster | Maximum Sum BST in Binary Tree |
| Minimum time to finish all jobs with constraints. | Greedy / sorting | Not reported | Intern cluster | No verified practice match |
| Fuel-constrained travel: O(n*k) then O(k) memory. | DP | Reduce memory to O(k) | Intern cluster | No verified practice match |
| Fibonacci tree path from u to v under preorder indexing. | Tree recursion | Not reported | Intern cluster | No verified practice match |
| Reach a city with tank capacity c, then find the minimum c. | Graph DFS + binary search | Dijkstra alternative and proof | Intern cluster | No verified practice match |
Round 2: Systems and fundamentals
How it works. These rounds are where D. E. Shaw differs from a standard product-company loop. Candidates were asked for deep OS and networking explanations, MongoDB and ACID enforcement, TLS handshake, OOP internals, scheduling algorithms, and database schema design with normalisation and scaling. One System Developer onsite mixed conversation, 30-minute system design and a coding-only round of Python file parsing.
At a glance: duration mostly not reported; 4 to 10 named prompts per account; conversation, whiteboard and code-prediction surfaces. Topics: OS, networks, DBMS, OOP, concurrency, system design and code debugging.
| Question summary | Skill or pattern | Reported follow-up | Level / scope | Practice link |
|---|---|---|---|---|
| Count nodes in a complete binary tree. | Trees | Not reported | SDE, 2026 | No verified practice match |
| Explain database normalisation. | DBMS | Not reported | SDE, 2026 | No verified practice match |
| SQL versus NoSQL and when to use each. | DBMS | Not reported | SDE, 2026 | No verified practice match |
| Two greedy problems around CodeChef 1500 difficulty, one on graphs. | Greedy | Not reported | SDE, 2026 | No verified practice match |
| Design a finance system using classes and OOP. | System design | Not reported | SDE, 2026 | No verified practice match |
| Deep dive into operating systems. | OS | Not reported | SWE full-time | No verified practice match |
| Deep dive into computer networks. | Networking | Not reported | SWE full-time | No verified practice match |
| Water jug puzzle. | Logic puzzle | Not reported | SWE full-time | No verified practice match |
| Polymorphism and virtual functions. | OOP | Not reported | Fresher | No verified practice match |
| SQL query for A-B table difference. | SQL | Not reported | MTS / SDE | No verified practice match |
| Why MongoDB; what ACID is; how ACID is enforced in MongoDB. | DBMS | Not reported | Systems Intern | No verified practice match |
| TLS handshake; symmetric and asymmetric encryption. | Networking / security | Not reported | Systems Intern | No verified practice match |
| Processes, threads, thread pools and shared memory. | OS / concurrency | Not reported | Systems Intern | No verified practice match |
| Design a live top-100 users dashboard as scores change. | Class design | Not reported | Intern cluster | No verified practice match |
| Maximum rectangle area from n points. | Geometry | Not reported | Intern cluster | No verified practice match |
| Minimum superstring containing n large strings. | Strings / DP | Write complete code | Intern cluster | No verified practice match |
| Count substrings of one string not present in any other string. | Tries | Not reported | Intern cluster | No verified practice match |
| Cricket tournament schema for all balls bowled; normalisation and scaling. | Database design | Not reported | Intern cluster | No verified practice match |
| Smart pointers, overriding, multiprocessing versus multithreading. | OOP / concurrency | Not reported | Intern cluster | No verified practice match |
| Abstract class versus interface; stack versus heap. | OOP | Not reported | Intern cluster | No verified practice match |
| Which scheduling algorithm do modern operating systems use? | OS | Not reported | Intern cluster | No verified practice match |
| Debug code and predict output of overloaded and overridden calls. | OOP | Not reported | Intern cluster | No verified practice match |
Round 3: Behavioural and managerial
How it works. Behavioural conversations are fewer in the dataset but direct. A hiring-manager round on an MTS loop was described as the hardest part of the process. A full-time SWE candidate was asked why they would choose D. E. Shaw over another offer, and later discussed work-life balance and office policy. Interns were asked about projects and their technical choices.
At a glance: duration not reported; 4 to 7 prompts; conversational.
| Question summary | Skill or pattern | Reported follow-up | Level / scope | Practice link |
|---|---|---|---|---|
| Why D. E. Shaw when you have other offers? | Motivation | Not reported | SWE full-time | No verified practice match |
| How did you validate your project and what were you optimising for? | Ownership | Not reported | SDE Intern | No verified practice match |
| Questions about a CNN and deep learning project. | Project depth | Not reported | Technology Developer Intern | No verified practice match |
| Introduction and project discussion. | Self-presentation | Not reported | Intern cluster | No verified practice match |
| Work-life balance and office policy discussion. | Fit | Not reported | SWE full-time | No verified practice match |
| Behavioural questions in the final conversation. | Behavioural | Not reported | System Developer | No verified practice match |
| Recruiter refused to disclose what the onsite rounds covered. | Process observation | Not reported | System Developer | No verified practice match |
Stage 5: Decision
An MTS/SDE candidate received an offer after a process that ran from September 2024 to January 2025. A full-time SWE candidate received an offer but declined it for a Microsoft PPO, citing work-life balance and office policy. Several internship candidates were rejected after the first technical round; one cluster mixed no offers and summer internships. No account describes a formal hiring committee or team-match stage.
Candidate experiences reviewed
| Background | Role and reported outcome | What was asked |
|---|---|---|
| MNNIT Allahabad - 2026 | SDE - rejected | Complete binary tree nodes, normalisation, SQL vs NoSQL, greedy problems, finance design |
| Final-year student | SWE - offer declined | Manacher modification, 3D knapsack, CS MCQs, Chess OOD, N-Queens, Fenwick XOR, OS and networks |
| B.Tech CSE - 2024/25 | MTS / SDE - offer | Range scores, k-deletion string, inversion counting, SQL A-B difference, resume walkthrough |
| Fresher - 2025 | Fresher - not reported | Array coding, kth permutation, MCQs, consecutive sums, stock trading, OOP |
| IIIT Allahabad - 2026 | SDE Intern - rejected | Trie/DP word break, bitmask grid DP, projects, DBMS |
| Jadavpur University - 2026 | Systems Intern - rejected | MongoDB ACID, TLS handshake, LIS, threads |
| IIITB cluster | Technology Intern - mixed | Three timed OA tasks; fuel graph, BST DP, dashboard, schemas, OOP, OS, DBMS |
The Codinzhub Next-Round Playbook
To get past the assessment
- Practise question-by-question timers. Use 25, 35 and 35-minute blocks with no switching.
- Revise DAG DP, greedy permutations and binary search over cost. These are the three repeated OA patterns.
- Expect hard full-time tasks such as Manacher modifications and 3D knapsack, plus 20 CS MCQs.
To get past DSA rounds
- Prepare follow-up layers for every classic problem: cycle existence then reconstruction, rotation count then huge k, reachability then minimum capacity.
- Revise tries, bitmask DP and tree DP. These appeared in intern and full-time loops.
- Practise OOD implementations such as Chess and canvas operations, not just algorithm coding.
- Prepare O(k) memory optimisations for DP problems.
To get past systems and fundamentals
- Revise OS and networking for deep questioning, not multiple choice: scheduling, threads, shared memory, TLS, encryption.
- Know DBMS properly: normalisation, ACID in MongoDB, SQL versus NoSQL, schema design and scaling.
- Prepare a five-minute defence of every project on your resume, including validation and optimisation goals.
To get past behavioural rounds
Prepare a clear answer to "why D. E. Shaw", a project-validation story, a fit answer about work style and office expectations, and two questions about the team. Expect the hiring manager to probe your answers.
How the loop differs by level
| Level | Typical experience | Emphasis | Difficulty |
|---|---|---|---|
| SDE Intern / Technology Intern | Three-question timed OA, one to three technical rounds | DSA, OOP, DBMS, project depth | Medium to hard |
| Fresher / SWE new grad | 90 to 120-minute HackerRank test, two or three technical rounds, HR | Hard DSA, OOD, OS and networks | Hard |
| MTS / SDE experienced | OA, three onsite rounds, hiring-manager round | Range queries, inversions, SQL, resume depth | Hard |
| System Developer | Knowledge interview, onsite with conversation, design and coding | Linux internals, Python file parsing | Domain-specific |
Most-asked topics
| Topic | What it means | Evidence-backed priority | Reported examples |
|---|---|---|---|
| Dynamic programming | State design, DAG DP, bitmask DP and memory optimisation. | Very high - 6 of 11 accounts | DAG max path, coin collection, fuel DP, 3D knapsack |
| Strings | Parsing, rotation counting,Manacher, deletions. | High - 5 of 11 accounts | Manacher, kth permutation, suffix rotations, k deletions |
| Graphs | Cycles, reachability, fuel constraints. | High - 4 of 11 accounts | Directed cycle, city reachability, DAG paths |
| Trees | BSTs, cameras, Fibonacci trees, complete tree counts. | High - 5 of 11 accounts | Binary Tree Cameras, unique BSTs, max sum BST |
| OOP and C++ | Polymorphism, virtual functions, smart pointers, OOD. | Very high - 6 of 11 accounts | Chess OOD, canvas class, stack vs heap |
| DBMS and SQL | ACID, normalisation, SQL versus NoSQL, schema design. | High - 5 of 11 accounts | MongoDB ACID, A-B difference, cricket schema |
| OS and networking | Threads, scheduling, TLS, encryption. | High - 5 of 11 accounts | Thread pools, scheduling algorithm, TLS handshake |
| Behavioural | Motivation, project validation, fit. | Medium - 4 of 11 accounts | Why D. E. Shaw, validation, office policy |
The question patterns that keep coming back
1. One more layer
- Recognise it: a standard problem followed by "now output the cycle" or "now make k up to 1e18".
- Invariant: solve the easy version, then state what extra structure the follow-up needs.
- Action: for cycle detection, write the version that returns the cycle start; for rotations, derive a closed form.
2. Search over a cost or capacity
- Recognise it: fuel capacity c, minimum tank capacity, budget-constrained utility.
- Invariant: define a feasibility predicate and binary search the answer.
- Action: write the feasibility check first, then wrap it in binary search.
3. DP with memory constraints
- Recognise it: "improve O(n*k) to O(k)".
- Invariant: identify which previous rows the transition actually needs and keep only those.
- Action: rewrite a 2D DP using two rolling arrays.
4. Resume defence
- Recognise it: "why did you choose this database", "how did you validate it".
- Invariant: every technology on the resume needs a reason, an alternative considered and a result.
- Action: prepare a one-page sheet of project decisions and trade-offs.
5. Fundamentals under pressure
- Recognise it: deep OS, networking or DBMS discussion.
- Invariant: explain mechanisms, not definitions: how ACID is enforced, how TLS handshakes, how threads share memory.
- Action: prepare five-minute mechanism explanations for each core subject.
Preparing for the HR and managerial round
The managerial round can be the hardest stage. Expect a resume walkthrough, a motivation question framed against your other offers, and a discussion of work style and office expectations. Six STAR stories are useful preparation: challenge, validation, failure, adaptability, achievement and collaboration. This is editorial advice, not a reported question list.
Practice problems that match these experiences
Note on practice analogues: These pages share the named technique. Unless marked "Exact reported problem", they are analogues, not leaked questions.
| # | Practice problem | Pattern | Seen in these experiences as | Link |
|---|---|---|---|---|
| 1 | Binary Tree Cameras | Tree DP | Software Internship coding round | LeetCode #968 |
| 2 | Minimum Number of Taps to Open to Water a Garden | Greedy intervals | Software Internship coding round | LeetCode #1326 |
| 3 | Unique Binary Search Trees | Tree DP | Intern cluster technical round | LeetCode #96 |
| 4 | Maximum Sum BST in Binary Tree | Tree DP | Intern cluster pseudocode task | LeetCode #1373 |
| 5 | Longest Increasing Subsequence | DP + binary search | Systems Intern, both complexities | LeetCode #300 |
| 6 | N-Queens | Backtracking | SWE full-time technical round | LeetCode #51 |
How to handle a question you have never seen
- Restate the problem and clarify constraints, especially the upper bound on k or n.
- State a brute-force baseline and why it fails at the stated limits.
- Name the structural cue: DAG means topological order, capacity means binary search, rotation means modular arithmetic.
- Write clean code with edge-case guards, then dry-run on a small example.
- Expect and welcome follow-ups. Say what would change if a bound grew or an extra constraint appeared.
- For fundamentals, explain mechanisms and give one concrete example from your own work.
Why candidates were rejected
No recruiter feedback is reported. Several candidates were rejected after the first technical round, and one described a System Developer coding round that was entirely Python file parsing when they had prepared Java DSA. These are observations about the process, not proven reasons for individual rejections.
If you remember only five things
- Expect hard DSA with layered follow-ups, not one-shot problems.
- Practise with individual question timers and no switching.
- Master DAG DP, bitmask DP, graphs and tree DP across levels.
- Revise OOP, DBMS, OS and networking as deep-dive topics.
- Prepare a defensible resume and a clear "why D. E. Shaw" answer.
Frequently asked questions (FAQ)
Is this an intern guide or a full-time guide?
Both, with levels separated in the tables. Eleven sources cover interns, freshers, SWE, SDE and MTS. Data Scientist is excluded.
Is there always an online assessment?
Most accounts describe one, but its format varies from 90 to 120 minutes and from two to three coding questions. One MTS account does not describe its OA at all.
Does D. E. Shaw ask system design?
Yes, but often as a practical class-design or schema-design discussion: a finance system with classes, a top-100 users dashboard, or a cricket database schema.
Are the LeetCode links exact questions?
Several are exact reported problems: Binary Tree Cameras, Minimum Taps to Water a Garden, Unique BSTs, Maximum Sum BST, N-Queens and Longest Increasing Subsequence. Others are analogues.
Why are some questions labelled "Intern cluster"?
Several IIITB internship write-ups describe the same OA and overlapping technical rounds. They were merged into one cluster so duplicates are not counted as independent evidence.
Was any offer declined?
Yes. One full-time SWE candidate declined the offer for a Microsoft PPO, citing work-life balance and office policy.
About this guide and methodology
This guide was compiled by the Codinzhub Editorial Team from eleven independent sources: ten internal candidate records and one public archived account. Four files with different company spellings were merged, and near-identical IIITB internship write-ups were collapsed into a cluster. No external research URLs, internal record identifiers or private ledgers appear here. Practice links are verified analogue or exact-problem pages.
Disclaimer: Hiring processes vary by team, level and year. This guide reflects reported historical experiences and is not an official statement from D. E. Shaw. Confirm the current format with your recruiter.
Other company and role guides
- Goldman Sachs software engineer interview guide
- Bloomberg software engineer interview guide
- Intuit Software Development Engineer 1 guide
- Juspay software engineer interview guide
- Google software engineer interview guide
Search the question bank
The questions from each round above, with practice links for similar problems. Log in to search every question we collected for this role, including questions shared on Codinzhub.
Showing 20 of 136 questions
Minimum Frames to Add for Equal-Sized Chunks
A D. E. Shaw online assessment question shared on Codinzhub (Not stated).
Delete Longest Subarray
A D. E. Shaw online assessment question shared on Codinzhub (NIT Bhopal).
Minimum Number of Substrings
A D. E. Shaw online assessment question shared on Codinzhub (Not stated).
Minimum Time to Complete Tasks in a Tree
A D. E. Shaw online assessment question shared on Codinzhub (MNIT Jaipur).
Pick exactly two services within a budget to maximise utility.
Level: Not reported.
Maximum path sum in a DAG.
Level: Not reported.
Convert an array into a permutation with minimum changes and lexicographically smallest result.
Level: Not reported.
A modification of Manacher's algorithm.
Level: Not reported.
Double knapsack solved with 3D DP.
Level: Not reported.
20 MCQs on OS, DBMS, networks, OOP and logical reasoning.
Level: Not reported.
Find the kth permutation of a string.
Level: Not reported.
Three coding questions on binary search, DP and prefix sums.
Level: Not reported.
10 technical and 10 aptitude MCQs with negative marking.
Level: Not reported.
Break a string into dictionary substrings with minimum cost and count the minimum-cost ways.
Level: Not reported.
Collect all coins on a grid in minimum steps and display the path.
Level: Not reported.
Detect a directed-graph cycle, then print the actual cycle.
Level: Print the cycle.
Count ways to reach target t from s in exactly k suffix rotations mod 1e9+7.
Level: k up to 1e18; multiple offsets.
Longest increasing subsequence in O(n^2) and O(n log n).
Level: Both required.
Implement Chess following object-oriented design principles.
Level: Not reported.
N-Queens.
Level: Not reported.
Keep preparing on Codinzhub
- D. E. Shaw interview questions and experiences — OA questions and interview experiences candidates shared for D. E. Shaw.
- Browse D. E. Shaw online assessment questions — filter the Codinzhub question bank by company.
- Amazon Software Engineer interview guide — the Amazon process, rounds and question patterns.
- Google Software Engineer interview guide — the Google process, rounds and question patterns.
- Adobe Software Engineer interview guide — the Adobe process, rounds and question patterns.
- All company interview guides — every guide on the Codinzhub blog.
Keep track of what you’ve learned.