AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
i
Blackrock
Compare
Filter interviews by
Blackrock Software Developer Interview Questions, Process, and Tips
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
Blackrock Software Developer Interview Experiences
5 interviews found
(2 Questions)
- Q1. Java questions , stream api
- Q2. Whatever you have mention in resume
Interview Preparation Tips
Jasleen Kaur
Selected
I applied via Campus Placement and was interviewed in Apr 2024. There were 3 interview rounds.
Aptitude, maths, cs fundamentals, dbms
(1 Question)
- Q1. Leetcode easy-medium
(1 Question)
- Q1. General questions
Interview Preparation Tips
I appeared for an interview in Jan 2022.
(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.
- 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
- 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.
Interview Preparation Tips
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.
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.
Skills evaluated in this interview
I appeared for an interview before Jun 2021.
Round duration - 90 Minutes
Round difficulty - Medium
(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
Round duration - 60 Minutes
Round difficulty - Easy
Interview Preparation Tips
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.
Tip 1 : Do not put irrelevant information such as DOB
Tip 2 : Put only those skill which you can defend in cross questioning
Skills evaluated in this interview
Blackrock interview questions for designations
I appeared for an interview before Dec 2020.
(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.
(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.
Interview Preparation Tips
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.
Tip 1 : Keep it short , precise and effective .
Tip 2 : Mention even small things that you did had an impact on other people.
Skills evaluated in this interview
Get interview-ready with Top Blackrock Interview Questions
Interview questions from similar companies
Software Developer Interview Questions & Answers
Tower Research Capital LLC
Anonymous
posted on 14 Sep 2021
I appeared for an interview in Dec 2020.
(2 Questions)
Round duration - 60 minutes
Round difficulty - Easy
This was the qualification round which comprised of several MCQs and 3 coding questions.
It was held on Hackerearth from 3:00 PM to 4:00 PM.
Use of any other IDE was prohibited.
- Q1. Given a problem statement and a piece of code, how would you find and correct the bug in the code?
- Ans.
To find and correct a bug in code, analyze problem statement, review code, use debugging tools, and test different scenarios.
Understand the problem statement and expected output.
Review the code for syntax errors, logical errors, and potential bugs.
Use debugging tools like breakpoints, print statements, and IDE debuggers.
Test the code with different inputs to identify the bug.
Make necessary corrections based on the iden...
- Q2.
Print Nodes at Distance K from a Given Node
Given an arbitrary binary tree, a node of the tree, and an integer 'K', find all nodes that are at a distance K from the specified node, and return a list of th...
- Ans.
Given a binary tree, a target node, and an integer K, find all nodes at distance K from the target node.
Traverse the binary tree to find the target node.
Use BFS to traverse the tree from the target node to nodes at distance K.
Keep track of the distance while traversing the tree.
Return the values of nodes at distance K in any order.
(1 Question)
Round duration - 90 minutes
Round difficulty - Medium
I was shared a link of Google Meet and the Google Docs was shared where there was 1 coding problem to be coded there and then the code was run on an IDE to check the sample tests.
Then the interview was followed by a lot of Operating System and Computer System Architecture Questions.
There were 2 Interviewers and both were helpful.
The timing was from 2:30 PM to 4:00 PM
- Q1.
Subarray Challenge: Largest Equal 0s and 1s
Determine the length of the largest subarray within a given array of 0s and 1s, such that the subarray contains an equal number of 0s and 1s.
Input:
Input beg...
- Ans.
Find the length of the largest subarray with equal number of 0s and 1s in a given array.
Iterate through the array and maintain a count of 0s and 1s encountered so far.
Store the count difference in a hashmap with the index as the key.
If the same count difference is encountered again, the subarray between the two indices has equal 0s and 1s.
Return the length of the longest subarray found.
Round duration - 45 minutes
Round difficulty - Easy
The round was held on Google Meet with HR from 2:30 PM to 3:15 PM.
The HR was friendly and asked the basic questions.
Interview Preparation Tips
Tip 1 : Practice daily 4-5 medium level problems on sites like Leetcode, CodeZen, Hackerearth
Tip 2 : Even though Data Structures and Algorithms is the base but study Course Subjects like DBMS,OS,OOPS too.
Tip 3 : Try to Participate in Contests on LeetCode,Codeforces.
Tip 1 : Mention the projects you worked on in your past work experience and how it helped your company.
Tip 2 : Keep your resume up to date in accordance with the role you are applying for
Tip 3 : Don't put false things on your resume.
Skills evaluated in this interview
Software Developer Interview Questions & Answers
Tower Research Capital LLC
Anonymous
posted on 28 May 2022
I appeared for an interview in Feb 2022.
(1 Question)
Round duration - 90 minutes
Round difficulty - Easy
Consisted of 3 DSA questions and MCQ on python proficiency
- Q1.
Palindromic Substrings Problem Statement
Given a string
S, your task is to return all distinct palindromic substrings of the given string in alphabetical order.Explanation:
A string is considered a pal...
- Ans.
Return all distinct palindromic substrings of a given string in alphabetical order.
Iterate through all possible substrings of the given string.
Check if each substring is a palindrome by comparing it with its reverse.
Store all palindromic substrings in a set to ensure uniqueness.
Return the sorted list of palindromic substrings.
(1 Question)
Round duration - 60 minutes
Round difficulty - Medium
It was a pure DSA round and interviewer was very helpful with providing significant hints to solve the given problems
- Q1.
Island Perimeter Calculation Problem
Given a binary grid representation of a map of an island, calculate the perimeter of the island. The grid uses '0' for water and '1' for land.
The grid has only one i...
- Ans.
Calculate the perimeter of an island represented by a binary grid.
Iterate through the grid and count the perimeter based on land cells and their adjacent cells.
Each land cell contributes 4 units to the perimeter, subtract 2 units for each adjacent land cell.
Handle edge cases where land cells are at the boundaries of the grid.
Return the total perimeter for each test case.
(1 Question)
Round duration - 60 minutes
Round difficulty - Hard
DSA+OS
- Q1.
Clearing the Forest Problem Statement
Ninja lives in a city called Byteland where a festive event is being organized. To make space for this event, Ninja is tasked with clearing a nearby forest. The fores...
- Ans.
Calculate the minimum number of steps Ninja needs to cut down all trees in a forest grid.
Iterate through the grid to find the shortest path to cut down all trees in order.
Use a priority queue to keep track of the shortest trees to cut next.
If it's impossible to cut all trees, return -1.
Consider all four cardinal directions for movement in the grid.
Interview Preparation Tips
Tip 1 : Practice at least 250 questions
Tip 2 : Do at least two projects
Tip 1 : Should be covered in One page
Tip 2 : Project description should be professional
Skills evaluated in this interview
Software Developer Interview Questions & Answers
Tower Research Capital LLC
Anonymous
posted on 28 May 2022
I appeared for an interview in Jun 2022.
(2 Questions)
Round duration - 70 Minutes
Round difficulty - Hard
The test link was active for a week, and you can give anytime you like. The IDE was very good and self explanatory. There were 2 coding questions and 15 aptitude questions.
- Q1.
Unweighted Graph Shortest Path Problem
You are tasked with finding the shortest path between two houses in the city of Ninjaland, represented as an unweighted graph. The city has
Nhouses numbered from 1 ... - Ans.
Find the shortest path between two houses in a city represented as an unweighted graph.
Use breadth-first search (BFS) algorithm to find the shortest path in an unweighted graph.
Start BFS from the source house and keep track of the path taken to reach each house.
Once the destination house is reached, backtrack from destination to source to find the shortest path.
Consider using a queue data structure to implement BFS eff...
- Q2.
Check If Two Nodes Are Cousins
You are given an arbitrary binary tree consisting of N nodes, where each node is associated with a certain value, and two node values,
aandb. Your task is to determine if ... - Ans.
Check if two nodes in a binary tree are cousins by comparing their levels and parents.
Traverse the tree to find the levels and parents of the given nodes.
Compare the levels and parents of the two nodes to determine if they are cousins.
If the levels are the same and the parents are different, the nodes are cousins.
(2 Questions)
Round duration - 60 Minutes
Round difficulty - Medium
It contained two programming questions.
- Q1.
Counting Nodes in a Complete Binary Tree - Problem Statement
Given the root of a complete binary tree, calculate the total number of nodes in this tree.
A complete binary tree is defined as a binary tree...
- Ans.
Count the total number of nodes in a complete binary tree given its root.
Traverse the tree in level order and count the nodes
Use a queue to keep track of nodes at each level
Check for null nodes represented by -1 in the input
The total number of nodes in the example tree is 7
- Q2.
Rearrange Array Numbers for Largest Possible Number
Given an array
ARRconsisting of non-negative integers, rearrange the numbers to form the largest possible numerical value. You are not permitted to alt... - Ans.
Rearrange array numbers to form the largest possible numerical value by combining digits of each number in the array.
Convert integers in the array to strings for easier manipulation.
Sort the array of strings in non-increasing order based on custom comparison function.
Join the sorted strings to form the largest possible number.
(1 Question)
Round duration - 60 Minutes
Round difficulty - Medium
This was more of a interaction round with some technical skills.
- Q1. Can you explain the ACID properties and the rollback mechanism in DBMS?
- Ans.
ACID properties ensure database transactions are processed reliably. Rollback mechanism undoes changes if transaction fails.
ACID properties: Atomicity, Consistency, Isolation, Durability
Atomicity ensures all operations in a transaction are completed successfully or none at all
Consistency ensures database remains in a valid state before and after transaction
Isolation ensures transactions are independent and do not inter...
Interview Preparation Tips
Tip 1 : Focus on different varieties of problems, quality of problems matter greater than the quantity.
Tip 2 : Focus on design thinking, that will help in rounds other than problem solving.
Tip 1 : Focus on demonstrating your academic excellence and course projects
Tip 2 : Mention internship details with clarity
Skills evaluated in this interview
Software Developer Interview Questions & Answers
Tower Research Capital LLC
Anonymous
posted on 16 Sep 2024
I applied via Recruitment Consulltant and was interviewed in Mar 2024. There were 2 interview rounds.
DSA medium level questions were asked.
(2 Questions)
- Q1. Design MakeMyTrip kind of application.
- Ans.
MakeMyTrip is a travel booking application that allows users to book flights, hotels, and holiday packages.
Include features like flight/hotel search, booking, payment gateway integration, and user profiles.
Implement filters for search results, reviews/ratings for hotels, and notifications for booking updates.
Integrate maps for location tracking, weather forecasts, and customer support chatbot.
Offer discounts, loyalty p...
- Q2. Oops based questions.
Interview Preparation Tips
Skills evaluated in this interview
I applied via LinkedIn and was interviewed before Apr 2022. There were 3 interview rounds.
Tell me about a time where you resolve a conflict
Reverse a string, identify anagram
Interview Preparation Tips
Blackrock Interview FAQs
Tell us how to improve this page.
Blackrock Interviews By Designations
- Blackrock Analyst Interview Questions
- Blackrock Associate Interview Questions
- Blackrock Software Developer Interview Questions
- Blackrock Intern Interview Questions
- Blackrock Software Developer Intern Interview Questions
- Blackrock Software Engineer Interview Questions
- Blackrock Senior Software Engineer Interview Questions
- Blackrock Data Analyst Interview Questions
- Show more
Interview Questions for Popular Designations
- Senior Software Developer Interview Questions
- Associate Software Developer Interview Questions
- Lead Software Engineer Interview Questions
- Software Development Engineer II Interview Questions
- Software Engineer Interview Questions
- Software Development Engineer 1 Interview Questions
- Software Engineer Level 1 Interview Questions
- Java Software Developer Interview Questions
- Show more
Blackrock Software Developer Interview Process
based on 2 interviews
Interview experience
Software Developer Interview Questions from Similar Companies
Fast track your campus placements
Blackrock Software Developer Reviews and Ratings
based on 6 reviews
Rating in categories
|
Analyst
1.1k
salaries
|  ₹5 L/yr - ₹16.5 L/yr |
|
Associate
910
salaries
| ₹10 L/yr - ₹37.4 L/yr |
|
Vice President
360
salaries
| ₹18.8 L/yr - ₹66 L/yr |
|
Financial Analyst
136
salaries
| ₹4 L/yr - ₹15.8 L/yr |
|
Senior Associate
58
salaries
| ₹11 L/yr - ₹32.8 L/yr |
Nomura Holdings
Muthoot Homefin India
Adarsh Credit Co-Operative Society
Debtcare Enterprises
- Home >
- Interviews >
- Blackrock Interview Questions >
- Blackrock Software Developer Interview Questions
