BlackRock campus technology hiring filters hard on a timed multi-section OA, then tests language depth and SQL alongside DSA. Composites below draw from public GeeksforGeeks VIT and other campus write-ups.
Cannot go back; easy-medium items but flowchart boxes can be tricky
Funnel context: ~1000 sat after CGPA cut from 4000+ applicants; ~250 shortlisted (+50 waitlist)
Round 2 - Technical (~1 hour, 2 interviewers)
Intro; projects (tip: one-slide-per-project PPT)
Python basics if listed; candidate pivoted to Java proficiency
Live DSA: median of two sorted arrays; detect cycle in linked list
SQL: 3 tables, joins + subqueries
Java: volatile; HashSet vs TreeSet vs LinkedHashSet; DFS/BFS complexity; list/array/LinkedList retrieval costs; synchronisation / threads; string pool (ok to say unknown if rest is strong)
Easy-medium; coding section included flow-graph style analysis
One account: ~400-500 shortlisted including waitlist; 81 for Data Science and Engineering role in that report
Technical panels
DBMS: SQL vs NoSQL; FK; primary vs unique; second-highest record; JOIN types
MongoDB formatting/usage if MERN on resume
Coding (explanation; live not always required): shortest path; reverse string without builtins; ASCII replace; char frequency / second-largest via hashing
OS topics appear on some panels (deadlocks, RAID in related reports)
HR (~5-10 min)
How was your day; intro; other campus drives; interests
Internship/training vs direct project questions from candidate side
Takeaways
What decided it: Resume-stack honesty (only defendable MERN/Mongo lines) under follow-ups
Common fail: Inflated resume stacks that collapse when interviewers dig into Mongo or frontend choices
How to practise: Delete indefensible bullets; rehearse architecture decisions for each listed project
Technical interview experience 3 - SDE On Campus 2024 (managerial + tech same day)
Technical interview experience 3
Candidate profile: Campus SDE; eLitmus OA with aptitude, coding, and SQL sections. Source: GeeksforGeeks BlackRock SDE On Campus 2024.
OA structure
Aptitude (~39 Q / ~47 min in one report), coding skills (~10 Q / 20 min), SQL (~20 Q / 20 min)
Difficulty easy–medium; accuracy under section timers matters
Family background; free-time interests (can become a real conversation)
Relocate; location preference; higher studies
Failures and how you handled them (chat-style panels)
Final result: Offer when cleared
Key takeaways: Listen and ask follow-ups - conversational HR is common and scored.
Sample answers for high-frequency questions
Technical
Q. Detect cycle in a linked list? A. Floyd: slow/fast pointers; meet ⇒ cycle. Optional: find entry with reset-to-head then equal steps. O(1) space.
Q. Median of two sorted arrays? A. Binary-search partition for O(log(min(m,n))); state edge cases when one side empty. Brute merge only as first step.
Q. HashSet vs TreeSet vs LinkedHashSet? A. HashSet: unordered O(1) avg; TreeSet: sorted via tree O(log n); LinkedHashSet: insertion order. Pick by need for order vs speed.
Q. Why not index / what is volatile? A.volatile ensures visibility of writes across threads, not atomicity of compounds - pair with sync/locks when needed.
HR
Q. Why BlackRock? A. Tie Aladdin/tech-at-scale or India engineering centres to your skills; one concrete PPT fact beats “prestigious finance.”
Common questions checklist
OA
Aptitude; verbal; flowcharts; SQL - timed, no backtrack
Technical
Projects; live DSA (arrays, LL); SQL joins; Java/Python internals; complexities
These links are research inputs we used to map round structure and recurring questions - not copied page mirrors. We reorganized reports into process tables, outcome notes, and prep takeaways for BlackRock.
