Synthesized from 6 candidate submissions for ALL.
Select a role track above to view specific candidate interview patterns.
The candidate participated in a multi-round interview process for an SDE-1 role at DE Shaw. The process included an online assessment, technical rounds, analytics/probability rounds, DSA rounds, and a final technical round. The candidate received praise for their problem-solving approach but was ultimately rejected. An ops role was offered but declined by the candidate.
Hackerrank test with 8 MCQs (CS fundamentals, OS, DBMS, CN), 8 aptitude questions (probability, P&C), and 3 coding questions (Leetcode medium difficulty with time constraints).
8 MCQs covering CS fundamentals, OS, DBMS, and CN. 8 aptitude questions (probability, P&C). 3 coding questions (Leetcode medium) with time constraints.
Solved a problem to find the number of subarrays with exactly k odd numbers using the two-pointer technique. Discussed OOPs concepts related to abstract classes and interfaces. Answered SQL query questions. Discussed reasons a React website might work slowly.
Discussed random number generators, their implementation, and measuring randomness. Solved puzzles involving identifying a bag with counterfeit coins using a weighing machine and finding the longest reward path in a matrix using dynamic programming (DP). Answered SQL queries.
Solved a problem to find the subarray with the kth largest sum using prefix sum array and a max-heap. Discussed searching in a rotated sorted array and variations of the problem. Solved a word break problem using a trie and DP, explaining both approaches. Answered SQL queries related to correlative subqueries.
Discussed database normalization, normalization on a given database schema, OS concepts, OOPs, and design patterns. Answered SQL queries.
The De Shaw online assessment was conducted virtually with a delayed start. The test had a fixed structure with three sections, each with a strict time limit. The questions focused on Greedy, Dynamic Programming, and Standard DP problems.
The online assessment was conducted virtually with a fixed duration of 1 hour and 30 minutes. It consisted of three sections with non-transferable time limits: Section 1 (25 minutes), Section 2 (35 minutes), and Section 3 (35 minutes). The questions were categorized under Greedy, Dynamic Programming (DP), and Standard DP problems.
The online assessment consisted of three timed sections with fixed durations. Candidates were required to solve problems within the allocated time for each section.
Greedy Algorithm Problem
Dynamic Programming Problem
Standard Dynamic Programming Problem
InterviewDigest