Blackrock interview experience Real time questions & tips from candidates to crack your interview
Analyst
Blackrock
4 rounds | 4 Coding
problems
Selected Interview preparation journey
Preparation
Duration: 3 Months
Topics: Data Structures, Operating Systems, Dynamic Programming, OOPs, Algorithms
Tip 1 : Practice many problems across multiple data structures
Tip 2 : Have working understanding of at least 1 programming language
Application process
Where: Campus
Eligibility: No criteria
Tip 1 : Only mention projects of which you have in depth understanding
Tip 2 : Try highlighting a few key technical skills that the interviewer can pick up by a simple glance
Interview rounds
01
Round
Medium
Online Coding Interview
Duration90 Minutes
Interview date1 Sep 2020
Coding problem1
Various scenario based subjective and objective questions that tested our knowledge and quick thinking with algorithms
1. Puzzle
We were given a flowchart that had a few steps missing, and the task was to fill these blanks
Problem approach
Tip 1: Be sensitive to details
Tip 2: Can divide the problem into various sub problems and solve them piece them together after solving.
02
Round
Easy
Video Call
Duration30 Minutes
Interview date1 Oct 2020
Coding problem1
Early morning
Multiple algorithm based questions were asked, along with light readover of the resume.
1. System Design Question
Design a program that will break a 10 digit randomized code
Problem approach
Tip 1: Solved using recursion/iteration
Tip 2: Think of how both of these will affect the call stack
03
Round
Easy
Video Call
Duration30 Minutes
Interview date1 Oct 2020
Coding problem1
Afternoon
Questions based around data structures and resume
Previous internships
Puzzles
1. Convert binary tree to mirror tree
Easy
15m average time
85% success
0/40
Asked in companies
Given a binary tree, convert this binary tree into its mirror tree.
A binary tree is a tree in which each parent node has at most two children.
Mirror of a Tree: Mirror of a Binary Tree T is another Binary Tree M(T) with left and right children of all non-leaf nodes interchanged.
Note:
1. Make in-place changes, that is, modify the nodes given a binary tree to get the required mirror tree.
Problem approach
Start with recursion.
Identify the exit condition
Understand how the left and right nodes will be travelled.
04
Round
Easy
HR Round
Duration30 Minutes
Interview date1 Oct 2020
Coding problem1
Afternoon
Discussions around resume and work culture related preferences
1. Basic HR questions
Resume based questions
Problem approach
Tip 1: Focus on your through process used in the projects, instead of the in depth tech details
Tip 2: Don't be afraid to ask any queries you might have about the company
Here's your problem of the day 
Solving this problem will increase your chance to get selected in this company
Skill covered: Programming
How do you remove whitespace from the start of a string?
Choose another skill to practice
Similar interview experiences
SDE - 1
3 rounds | 2 problems
Interviewed by Blackrock
Selected 
1071 views
0 comments
0 upvotes
SDE - Intern
3 rounds | 3 problems
Interviewed by Blackrock
Selected 956 views
0 comments
0 upvotes
Analyst
3 rounds | 6 problems
Interviewed by Blackrock
Selected 1029 views
0 comments
0 upvotes
Software Developer
3 rounds | 3 problems
Interviewed by Blackrock
Selected 578 views
1 comments
0 upvotes
Companies with similar interview experiences
Analyst
3 rounds | 4 problems
Interviewed by Ernst & Young (EY)
Selected 2197 views
1 comments
0 upvotes
Analyst
3 rounds | 9 problems
Interviewed by HCL Technologies
Selected 0 views
0 comments
0 upvotes
Analyst
3 rounds | 10 problems
Interviewed by Ernst & Young (EY)
Selected 4510 views
0 comments
0 upvotes