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 and Answers
6 Interview questions
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 left...
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 tr...
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 ...
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.
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 BST...
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.
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 ...
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
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 the...
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.
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', deno...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.
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
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
Top trending discussions
Interview questions from similar companies
I appeared for an interview before Sep 2020.
(1 Question)
Round duration - 30 minutes
Round difficulty - Easy
It was in the day time. I was asked the programming language of my choice. It was mostly focused on programming fundamentals. I was asked 2 questions based on Data Structures and Algorithms.
- Q1. How can you detect a loop in a linked list?
- Ans.
A loop in a linked list can be detected using Floyd's Cycle Detection Algorithm.
Use two pointers - slow and fast, where slow moves one step at a time and fast moves two steps at a time.
If there is a loop, the two pointers will eventually meet at some point within the loop.
To detect the start of the loop, reset one pointer to the head and move both pointers one step at a time until they meet again.
(1 Question)
Round duration - 30 minutes
Round difficulty - Easy
This round was mostly focused on my resume and projects.
- Q1. Tell me about your projects.
Round duration - 30 minutes
Round difficulty - Easy
It was in the evening. I went to their office in Gurgaon. It was taken by one of the technology director who had a lot of experience.
Interview Preparation Tips
Do practice a lot of data structures questions as mostly questions in interviews are based on them. Also, do prepare for projects mentioned in your resume and skills which you have mentioned. Coding ninjas has a big hand in making my interview clear as I have taken a course from the coding Ninjas which helped me a lot to make my concepts clear.
Application resume tips for other job seekersKeep it short and crisp. Go through it properly before the interview. Make sure that you haven't put anything in it that can cause you problems during the interview.
Final outcome of the interviewSelectedSkills evaluated in this interview
Software Developer Interview Questions & Answers
JPMorgan Chase & Co.
Anonymous
posted on 16 Dec 2021
I applied via Recruitment Consultant and was interviewed in Jun 2021. There were 4 interview rounds.
Interview Questionnaire
2 Questions
- Q1. Basic react
- Q2. Basic javascript
Interview Preparation Tips
Software Developer Interview Questions & Answers
JPMorgan Chase & Co.
Anonymous
posted on 7 Jun 2021
I applied via Company Website and was interviewed in May 2021. There were 3 interview rounds.
Interview Questionnaire
2 Questions
- Q1. Data warehousing concepts
- Q2. Database optimization
Interview Preparation Tips
Interview Questionnaire
1 Question
- Q1. Core java,multi threading and react
Interview Preparation Tips
Software Developer Interview Questions & Answers
State Street Corporation
Anonymous
posted on 20 May 2017
I appeared for an interview in May 2017.
Interview Questionnaire
6 Questions
- Q1. Can string class be extended
- Ans.
Yes, the string class can be extended in most programming languages.
Inheritance can be used to extend the functionality of the string class.
By creating a new class that inherits from the string class, additional methods and properties can be added.
Extending the string class allows for customization and adding specific functionality to strings.
Example: In Python, the string class can be extended by creating a new class ...
- Q2. What are the implecit object in JSP
- Ans.
Implicit objects in JSP are predefined objects that are available for use without any declaration or initialization.
Implicit objects in JSP include request, response, session, application, out, config, pageContext, page, exception, and others.
These objects provide access to various aspects of the JSP environment and can be used to perform common tasks.
For example, the request object allows access to HTTP request parame...
- Q3. How does hash map works
- Ans.
A hash map is a data structure that uses a hash function to map keys to values.
Hash map stores key-value pairs
It uses a hash function to compute an index for each key
Collisions can occur when two keys hash to the same index
Hash maps provide fast access to values based on their keys
- Q4. Difference between string buffer and string builder
- Ans.
StringBuffer and StringBuilder are both used to manipulate strings, but StringBuffer is thread-safe while StringBuilder is not.
StringBuffer is synchronized, making it safe for use in multi-threaded environments.
StringBuilder is not synchronized, making it faster but not thread-safe.
StringBuffer is preferred when multiple threads are involved, while StringBuilder is preferred for single-threaded scenarios.
Both classes p...
- Q5. What is MVC
- Ans.
MVC is a software architectural pattern that separates an application into three main components: Model, View, and Controller.
Model represents the data and business logic of the application.
View is responsible for displaying the user interface.
Controller handles user input, updates the model, and interacts with the view.
MVC promotes separation of concerns and modularity in software development.
Example: In a web applica...
- Q6. What are the annotation used in RESTFULL web services
- Ans.
Annotations used in RESTful web services
1. @Path - Specifies the URI path for the resource
2. @GET - Specifies that the method handles HTTP GET requests
3. @POST - Specifies that the method handles HTTP POST requests
4. @PUT - Specifies that the method handles HTTP PUT requests
5. @DELETE - Specifies that the method handles HTTP DELETE requests
6. @PathParam - Binds the value of a URI template parameter to a method paramete...
Interview Preparation Tips
Skills evaluated in this interview
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
- Software Engineer Interview Questions
- Java Developer Interview Questions
- Web Developer Interview Questions
- Senior Software Developer Interview Questions
- Application Developer Interview Questions
- Salesforce Developer Interview Questions
- Software Development Engineer Interview Questions
- Developer Interview Questions
- Show more
Overall Interview Experience Rating
based on 2 interview experiences
Difficulty level
Duration
Software Developer Interview Questions from Similar Companies
Blackrock Software Developer Reviews and Ratings
based on 6 reviews
Rating in categories
|
Analyst
1.2k
salaries
|  ₹8.3 L/yr - ₹14.5 L/yr |
|
Associate
1.1k
salaries
| ₹16.8 L/yr - ₹31 L/yr |
|
Vice President
424
salaries
| ₹31.5 L/yr - ₹53 L/yr |
|
Financial Analyst
136
salaries
| ₹8.2 L/yr - ₹15.4 L/yr |
|
Senior Associate
100
salaries
| ₹16.8 L/yr - ₹31.8 L/yr |
Wells Fargo
JPMorgan Chase & Co.
HSBC Group
Citicorp
- Home >
- Interviews >
- Blackrock Interview Questions
