Upload Button Icon Add office photos
Engaged Employer

i

This company page is being actively managed by Blackrock Team. If you also belong to the team, you can get access from here

Blackrock Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

Clear (1)

Blackrock Software Developer Interview Questions, Process, and Tips

Updated 9 Oct 2024

Top Blackrock Software Developer Interview Questions and Answers

  • Q1. Greatest Common Divisor Problem Statement You are tasked with finding the greatest common divisor (GCD) of two given numbers 'X' and 'Y'. The GCD is defined as the large ...read more
  • Q2. Ninja And The Triangle Problem Statement Ninja is provided with 'N' stars and the task is to construct a triangle such that the 'i'th level of the triangle uses 'i' numb ...read more
  • Q3. Shortest Distance in a Binary Search Tree Your task is to determine the shortest distance between two nodes with given keys in a Binary Search Tree (BST). It is assured ...read more
View all 6 questions

Blackrock Software Developer Interview Experiences

5 interviews found

Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(2 Questions)

  • Q1. Java questions , stream api
  • Q2. Whatever you have mention in resume

Interview Preparation Tips

Interview preparation tips for other job seekers - Java basics, memory management, multithreading.
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
2-4 weeks
Result
Selected Selected

I applied via Campus Placement and was interviewed in Apr 2024. There were 3 interview rounds.

Round 1 - Aptitude Test 

Aptitude, maths, cs fundamentals, dbms

Round 2 - Technical 

(1 Question)

  • Q1. Leetcode easy-medium
Round 3 - HR 

(1 Question)

  • Q1. General questions

Interview Preparation Tips

Interview preparation tips for other job seekers - Be confident

Software Developer Interview Questions Asked at Other Companies

asked in Amazon
Q1. Maximum Subarray Sum Problem Statement Given an array of integers ... read more
asked in Amazon
Q2. Minimum Number of Platforms Needed Problem Statement You are give ... read more
asked in Rakuten
Q3. Merge Two Sorted Arrays Problem Statement Given two sorted intege ... read more
asked in Cognizant
Q4. Nth Fibonacci Number Problem Statement Calculate the Nth term in ... read more
Q5. Find Duplicate in Array Problem Statement You are provided with a ... read more

I was interviewed in Jan 2022.

Round 1 - Video Call 

(3 Questions)

Round duration - 100 Minutes
Round difficulty - Hard

There were 2 interviewers. It started with an introduction from me and one of the interviewers directly started with a DSA questions. Two problems were asked and I had to code them on a compiler of my choice by sharing my screen. Level of DSA question was medium but I was severely grilled on oops. I had to create different abstract classes, interface and explain entire oops with examples.

This was followed by a set of core JAVA questions :

Difference between == and .equals() ?
Mention some methods of the object class?
Difference between TreeSet and SortedSet?
How is a String saved in JAVA?
difference between string pool and heap memory?

  • Q1. 

    Shortest Distance in a Binary Search Tree

    Your task is to determine the shortest distance between two nodes with given keys in a Binary Search Tree (BST).

    It is assured that both keys exist within the BS...

  • Ans. 

    Find the shortest distance between two nodes in a Binary Search Tree.

    • Traverse the BST to find the paths from the root to both nodes.

    • Compare the paths to find the common ancestor node.

    • Calculate the distance by adding the lengths of the paths from the common ancestor to both nodes.

    • Return the shortest distance as the result.

  • Answered by AI
  • Q2. 

    Greatest Common Divisor Problem Statement

    You are tasked with finding the greatest common divisor (GCD) of two given numbers 'X' and 'Y'. The GCD is defined as the largest integer that divides both of the...

  • Ans. 

    Find the greatest common divisor (GCD) of two given numbers 'X' and 'Y'.

    • Iterate from 1 to the minimum of X and Y, check if both X and Y are divisible by the current number, update GCD if true

    • Use Euclidean algorithm to find GCD: GCD(X, Y) = GCD(Y, X % Y)

    • If one of the numbers is 0, the other number is the GCD

    • Handle edge cases like when one of the numbers is 0 or negative

  • Answered by AI
  • Q3. 

    Bridge in Graph Problem Statement

    Given an undirected graph with V vertices and E edges, your task is to find all the bridges in this graph. A bridge is an edge that, when removed, increases the number of...

  • Ans. 

    Find all the bridges in an undirected graph.

    • Use Tarjan's algorithm to find bridges in the graph.

    • A bridge is an edge whose removal increases the number of connected components.

    • Check for bridges by removing each edge and running a DFS to see if the graph is still connected.

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Vellore Institute of Technology - VIT Bhopal. I applied for the job as SDE - 1 in GurgaonEligibility criteriaAbove 6CGPA, no backlogBlackrock interview preparation:Topics to prepare for the interview - DSA, oops, OS, DBMS, CN, low level designTime required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

Tip 1 : Tree is the most important topic in BlackRock recruitment process. 
Tip 2 : have atleast one live working project- host your project either on Heroku/Play Store.
Tip 3 : Practice atleast 100 leetcode medium questions.

Application resume tips for other job seekers

Tip 1 : Don't oversell yourself because interviewers will grind you on everything that you write in resume. 
Tip 2 : Mention links to your project.

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed before Jun 2021.

Round 1 - Coding Test 

Round duration - 90 Minutes
Round difficulty - Medium

Round 2 - Video Call 

(1 Question)

Round duration - 60 Minutes
Round difficulty - Medium

  • Q1. 

    Validate Binary Search Tree Problem Statement

    Your task is to determine if a given binary tree with 'N' nodes is a valid Binary Search Tree (BST). A BST is defined by the following properties:

    • The lef...
  • Ans. 

    Validate if a given binary tree is a valid Binary Search Tree (BST) based on its properties.

    • Check if the left subtree of a node has only nodes with data less than the node's data.

    • Verify if the right subtree of a node has only nodes with data greater than the node's data.

    • Ensure that both the left and right subtrees are also binary search trees.

    • Implement a validation function for a BST.

    • Output 'true' if the binary tree is

  • Answered by AI
Round 3 - HR 

Round duration - 60 Minutes
Round difficulty - Easy

Interview Preparation Tips

Eligibility criteria8 CGPABlackrock interview preparation:Topics to prepare for the interview - Data Structure , Oops , Dynamic Programming, Memory Management, DBMSTime required to prepare for the interview - 2 MonthsInterview preparation tips for other job seekers

Tip 1 : Pratice regularly atleast 5 problem . Make it habit .Try to cover Leetcode medium questions as many as possible 
Tip 2 : Be through with your projects . At some point interviewer will ask you some project related questions 
Tip 3 : Be strong in your CS fundamentals.

Application resume tips for other job seekers

Tip 1 : Do not put irrelevant information such as DOB
Tip 2 : Put only those skill which you can defend in cross questioning

Final outcome of the interviewSelected

Skills evaluated in this interview

Blackrock interview questions for designations

 Software Developer Intern

 (4)

 Software Engineer

 (3)

 Backend Developer

 (2)

 Senior Software Engineer

 (3)

 Senior Java Developer

 (1)

 Front end Developer

 (1)

 QA Associate

 (2)

 QA Tester

 (1)

I was interviewed before Dec 2020.

Round 1 - Coding Test 

(1 Question)

Round duration - 87 minutes
Round difficulty - Medium

Timing : It was conducted in evening at 3 PM
The pacreception environment was very user friendly .
The platform was audio and video proctored.

  • Q1. 

    Binary to Decimal Conversion

    Convert a given binary number, represented as a string 'S' of size 'N', into its decimal equivalent integer and output it.

    Input:

    The first line contains an integer 'T', den...
  • Ans. 

    Convert a binary string to its decimal equivalent integer.

    • Iterate through the binary string from right to left, multiplying each digit by 2 raised to the power of its position.

    • Add the results of the multiplication to get the decimal equivalent.

    • Ensure the binary string consists only of '0' and '1' characters.

    • Handle multiple test cases by repeating the conversion process for each case.

  • Answered by AI
Round 2 - Face to Face 

(1 Question)

Round duration - 80 minutes
Round difficulty - Medium

So This was a very interactive round . There were two interviewers , one male and one female . The male interviewer was quite experienced where as female interviewer was relatively new . The Interview started by a small introduction followed by some OOPS related questions where I was tested on how i perceive the concept of OOPS in real life . Then this conversation was followed by some core concepts of JAVA like abstract classes and interfaces . Then I was asked about my projects that i mentioned in my resume , then after some healthy discussion on those projects , the interviewer started to question about DBMS , I was asked some basic queries followed by some advanced queries and then followed by a discussion on SQL vs NoSQL . Then Interviewers asked me about my tech stack and the source of my technical knowledge. Then at last I was asked that why Blackrock and this concluded my Interview.

  • Q1. 

    Ninja And The Triangle Problem Statement

    Ninja is provided with 'N' stars and the task is to construct a triangle such that the 'i'th level of the triangle uses 'i' number of stars. The goal is to make th...

  • Ans. 

    Given 'N' stars, construct a triangle with maximum height using 'i' stars in 'i'th level.

    • Calculate the maximum height of the triangle using the formula: height = floor((-1 + sqrt(1 + 8 * N)) / 2)

    • Iterate through each test case and calculate the maximum height for each 'N'.

    • Output the maximum height for each test case.

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from TIET - Thapar Institute of Engineering And Technology. I applied for the job as SDE - 1 in MumbaiEligibility criteriaAbove 7 CGPABlackrock interview preparation:Topics to prepare for the interview - Data Structures , Algorithms , Operation Systems , OOPS , DBMS , Web DevelopmentTime required to prepare for the interview - 4 monthsInterview preparation tips for other job seekers

Tip 1 : Be precise about what to do and what not to do.
Tip 2 : Always Revise the concepts you have done in past , use prime day revision theory.
Tip 3 : Do as many projects as you can but always mention those projects in which you are very well versed.
Tip 4 : Keep on reading random news related to your favourite tech and always have an in depth knowledge of what tech you currently use.

Application resume tips for other job seekers

Tip 1 : Keep it short , precise and effective .
Tip 2 : Mention even small things that you did had an impact on other people.

Final outcome of the interviewRejected

Skills evaluated in this interview

Get interview-ready with Top Blackrock Interview Questions

Interview questions from similar companies

I applied via Naukri.com and was interviewed in Apr 2020. There was 1 interview round.

Interview Questionnaire 

2 Questions

  • Q1. What synchronous and asynchronous means??
  • Ans. 

    Synchronous means happening at the same time, while asynchronous means not happening at the same time.

    • Synchronous operations occur in real-time, while asynchronous operations can be delayed or queued.

    • Synchronous operations block the program until they are completed, while asynchronous operations allow the program to continue running.

    • Examples of synchronous operations include function calls and loops, while examples of ...

  • Answered by AI
  • Q2. When to use CTE and temp table.
  • Ans. 

    CTE and temp table usage in SQL

    • Use CTE for recursive queries and complex subqueries

    • Use temp tables for large data sets and complex queries

    • CTE is more efficient for small data sets

    • Temp tables can be indexed for faster performance

    • Consider the scope and lifespan of the data when choosing between CTE and temp table

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Understand question first and answer.

I applied via Recruitment Consulltant and was interviewed before Jan 2021. There were 2 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all Resume tips
Round 2 - Coding Test 

Python coding test

Interview Preparation Tips

Topics to prepare for Deloitte Software Developer interview:
  • Python
Interview preparation tips for other job seekers - always practice coding
ex: python, java etc

Interview Preparation Tips

Round: Test
Experience: The first round was an online test with maths, logic and english questions. If you have prepared for any of the standardised tests (GMAT, GRE, CAT etc.), the test would be pretty simple. And try to answer as many questions as possible.
Tips: It would be really helpful if you give atleast your first attempt to any of the exams like GMAT, GRE etc. This is only for the online test because the pattern is quite similar to GMAT. For the interviews, be prepared for a set of standard questions asked during interviews that you can easily find online.

General Tips: Be prepared to spend all day at the interviews. You might not even get a lunch break. Sometimes the interview calls are late at night and also extend upto 2-3am. Be alert during the Pre-placement talk because the interviewers ask you questions from that too. I would advice you to ask questions to the interviewer when asked to regarding the company.
Don't write fake stuff in resume. At max you can exaggerate a bit in your CV. The panel does question you on your CV. Everything in it must be justified.
Skills:
College Name: NIT Surathkal

I was interviewed before Mar 2021.

Round 1 - Coding Test 

(3 Questions)

Round duration - 90 minutes
Round difficulty - Medium

There were 33 questions in total. The objective questions were simple.

  • Q1. 

    Sort Big List Dates Problem Statement

    Mary is an enthusiastic party-goer who struggles with remembering event dates. Help Mary by sorting a given list of event dates in an ascending order.

    Example:

    Inpu...
  • Ans. 

    Sort a list of event dates in ascending order based on year, month, and day.

    • Sort the list of dates based on year, then month, and finally day.

    • Use a sorting algorithm to rearrange the dates in ascending order.

    • Ensure the constraints are met for each date in the list.

  • Answered by AI
  • Q2. 

    Pair Sum Problem Statement

    You are given an integer array 'ARR' of size 'N' and an integer 'S'. Your task is to find and return a list of all pairs of elements where each sum of a pair equals 'S'.

    Note:
    ...
  • Ans. 

    Given an array and a target sum, find all pairs of elements that add up to the target sum.

    • Iterate through the array and for each element, check if the complement (target sum - current element) exists in a hash set.

    • If the complement exists, add the pair to the result list.

    • Sort the pairs based on the first element and then the second element.

    • Handle edge cases like duplicate elements and pairs with the same values.

    • Example...

  • Answered by AI
  • Q3. 

    Maximum Sum Problem Statement

    Given an integer N, your task is to recursively break it into three integer parts: N / 2, N / 3, and N / 4. You need to compute the maximum sum possible by dividing the numbe...

  • Ans. 

    Given an integer N, recursively break it into three parts and find the maximum sum possible.

    • Recursively divide N into N/2, N/3, and N/4 to find the maximum sum

    • Compare the sum obtained by dividing N with the sum of N itself

    • Return the maximum sum for each test case

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAMorgan Stanley interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 4 monthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more

Final outcome of the interviewRejected

Skills evaluated in this interview

I was interviewed before Mar 2021.

Round 1 - Face to Face 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Medium

Technical Interview round with questions based on DSA.

  • Q1. 

    Duplicate Integer in Array

    Given an array ARR of size N, containing each number between 1 and N-1 at least once, identify the single integer that appears twice.

    Input:

    The first line contains an integer...
  • Ans. 

    Identify the duplicate integer in an array containing numbers between 1 and N-1.

    • Iterate through the array and keep track of the frequency of each element using a hashmap.

    • Return the element with a frequency greater than 1 as the duplicate integer.

    • Ensure the constraints are met and a duplicate number is guaranteed to be present.

  • Answered by AI
  • Q2. 

    Sum Root to Leaf Numbers

    You are given an arbitrary binary tree consisting of N nodes, each associated with an integer value from 1 to 9. Each root-to-leaf path can be considered a number formed by concat...

  • Ans. 

    Calculate the total sum of all root to leaf paths in a binary tree formed by concatenating node values.

    • Traverse the binary tree from root to leaf nodes, keeping track of the current path sum

    • Add the current node value to the path sum and multiply by 10 for each level

    • When reaching a leaf node, add the final path sum to the total sum

    • Return the total sum modulo (10^9 + 7)

  • Answered by AI
  • Q3. 

    Topological Sort Problem Statement

    You are given a directed acyclic graph (DAG). Your task is to perform topological sorting of the graph and return any valid ordering.

    Explanation:

    A directed acyclic g...

  • Ans. 

    Implement a function to perform topological sorting on a directed acyclic graph (DAG) and return any valid ordering.

    • Create a graph data structure to represent the DAG

    • Use depth-first search (DFS) to perform topological sorting

    • Maintain a visited array to keep track of visited nodes

    • Return the ordering of nodes after DFS traversal

  • Answered by AI
Round 2 - Face to Face 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Technical interview round with questions based on DSA.

  • Q1. 

    LCA of Binary Tree Problem Statement

    You are given a binary tree consisting of distinct integers and two nodes, X and Y. Your task is to find and return the Lowest Common Ancestor (LCA) of these two nodes...

  • Ans. 

    Find the Lowest Common Ancestor (LCA) of two nodes in a binary tree.

    • Traverse the binary tree to find the paths from the root to nodes X and Y.

    • Compare the paths to find the last common node, which is the LCA.

    • Handle cases where one node is an ancestor of the other.

    • Consider edge cases like when X or Y is the root node.

    • Implement a recursive or iterative solution to find the LCA efficiently.

  • Answered by AI
  • Q2. 

    Rotated Array Minimum Finder

    You are provided with a sorted array that has undergone 'K' rotations (the exact value of 'K' is unknown). A rotation involves shifting each element of the array to the right,...

  • Ans. 

    Implement a function to find the minimum number in a rotated sorted array efficiently.

    • Use binary search to find the minimum element in the rotated array.

    • Compare the mid element with the start and end elements to determine which half of the array to search next.

    • Continue the binary search until the minimum element is found.

  • Answered by AI
  • Q3. 

    Maximum Binary Tree Construction Problem

    Given an array TREE of 'N' unique integers, construct a maximum binary tree using the following rules:

    1. The root of this tree is the maximum number in TREE.
    2. T...
  • Ans. 

    Construct a maximum binary tree from an array of unique integers following specific rules.

    • Find the maximum number in the array to set as the root of the tree.

    • Recursively construct the left subtree with elements before the maximum number.

    • Recursively construct the right subtree with elements after the maximum number.

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAMorgan Stanley interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Final outcome of the interviewRejected

Skills evaluated in this interview

Contribute & help others!
anonymous
You can choose to be anonymous

Blackrock Interview FAQs

How many rounds are there in Blackrock Software Developer interview?
Blackrock interview process usually has 2 rounds. The most common rounds in the Blackrock interview process are Technical, Aptitude Test and HR.
What are the top questions asked in Blackrock Software Developer interview?

Some of the top questions asked at the Blackrock Software Developer interview -

  1. Java questions , stream ...read more
  2. Leetcode easy-med...read more
  3. General questi...read more

Recently Viewed

REVIEWS

L&T Construction

No Reviews

INTERVIEWS

Blackrock

No Interviews

INTERVIEWS

Blackrock

No Interviews

INTERVIEWS

Blackrock

No Interviews

SALARIES

UKG

SALARIES

Intellect Design Arena

REVIEWS

UKG

No Reviews

SALARIES

Persistent Systems

REVIEWS

Keysight Technologies

No Reviews

INTERVIEWS

IDEMIA

No Interviews

Tell us how to improve this page.

Blackrock Software Developer Interview Process

based on 2 interviews

Interview experience

4
  
Good
View more
Blackrock Software Developer Salary
based on 45 salaries
₹8.5 L/yr - ₹23 L/yr
89% more than the average Software Developer Salary in India
View more details

Blackrock Software Developer Reviews and Ratings

based on 6 reviews

2.9/5

Rating in categories

2.9

Skill development

2.9

Work-life balance

3.4

Salary

3.0

Job security

3.3

Company culture

2.6

Promotions

3.2

Work satisfaction

Explore 6 Reviews and Ratings
Analyst
1.1k salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Associate
863 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Vice President
362 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Financial Analyst
136 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Software Engineer
53 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare Blackrock with

Vanguard

4.1
Compare

State Street Global Advisors

3.8
Compare

Fidelity Investments

4.2
Compare

Goldman Sachs

3.5
Compare
Did you find this page helpful?
Yes No
write
Share an Interview
Rate your experience using AmbitionBox
Terrible
Terrible
Poor
Poor
Average
Average
Good
Good
Excellent
Excellent