i
Blackrock
Filter interviews by
I was interviewed before Jun 2021.
Round duration - 90 Minutes
Round difficulty - Medium
Round duration - 60 Minutes
Round difficulty - Medium
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:
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
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
Derivatives are financial contracts that derive their value from an underlying asset or security.
Types of derivatives include futures, options, swaps, and forwards.
Futures are contracts to buy or sell an asset at a predetermined price and date.
Options give the buyer the right, but not the obligation, to buy or sell an asset at a predetermined price and date.
Swaps involve exchanging cash flows based on different financi...
I applied via Campus Placement and was interviewed in May 2021. There were 4 interview rounds.
Blackrock interview questions for popular designations
Get interview-ready with Top Blackrock Interview Questions
I applied via Recruitment Consultant and was interviewed before Dec 2020. There were 3 interview rounds.
I was interviewed before Dec 2020.
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.
Convert a given binary number, represented as a string 'S' of size 'N', into its decimal equivalent integer and output it.
The first line contains an integer 'T', den...
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.
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.
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...
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.
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.
I was interviewed before Sep 2020.
Round duration - 60 Minutes
Round difficulty - Medium
This was a Technical round. About 60 students were shortlisted for this round. There were two interviewers. First, they asked me to introduce myself. Then I was asked some concepts of OOPS. some questions from OS and DBMS. I was asked to write code to reverse a link list on the notepad and share my screen. Then I was asked about my projects and internship. There were some situational questions related to the internship. They asked me what I know about the company.
My interview took place in the morning at around 10:00 a.m. and lasted for about an hour.
Python is a high-level, interpreted language known for its simplicity and readability, while C++ is a low-level, compiled language known for its performance and efficiency.
Python is dynamically typed, while C++ is statically typed.
Python uses indentation for code blocks, while C++ uses curly braces.
Python has automatic memory management, while C++ requires manual memory management.
Python is slower in execution compared...
Given a singly linked list of integers, return the head of the reversed linked list.
Initial linked list: 1 -> 2 -> 3 -> 4 -> NULL
Reversed link...
Reverse a singly linked list of integers and return the head of the reversed linked list.
Iterate through the linked list and reverse the pointers to point to the previous node instead of the next node.
Use three pointers to keep track of the current, previous, and next nodes while reversing the linked list.
Update the head of the reversed linked list as the last node encountered during the reversal process.
Round duration - 30 Minutes
Round difficulty - Medium
It was a virtual interview and there was just one interviewer. The interviewer was really friendly. First of all, the interviewer introduced himself and also shared some facts about the company. Then he asked me to introduce myself. Then behavioral and situational questions were asked. Then he asked if I was comfortable with relocation. BlackRock has 2 locations that are Gurgaon and Mumbai.
Tip 1 : Revise Trees especially AVL trees and tree traversals as the major questions for data structures were from trees.
Tip 2 : Revise your OOPs concepts for the interview round.
Tip 3 : If you have done a project in development, make sure you know well about them.
Tip 1 : Mention only those things in your resume, you have knowledge about.
Tip 2 : A project in development is a plus.
I applied via Naukri.com and was interviewed in Nov 2020. There were 3 interview rounds.
Deferred revenue is the income received in advance for goods or services that are yet to be delivered or rendered.
Deferred revenue is also known as unearned revenue.
It is a liability on the balance sheet until the goods or services are delivered or rendered.
Examples include magazine subscriptions, prepaid rent, and gift cards.
Deferred revenue is recognized as revenue on the income statement when the goods or services a
The duration of Blackrock interview process can vary, but typically it takes about less than 2 weeks to complete.
based on 74 interviews
Interview experience
based on 445 reviews
Rating in categories
Analyst
1.1k
salaries
| ₹0 L/yr - ₹0 L/yr |
Associate
863
salaries
| ₹0 L/yr - ₹0 L/yr |
Vice President
362
salaries
| ₹0 L/yr - ₹0 L/yr |
Financial Analyst
136
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
53
salaries
| ₹0 L/yr - ₹0 L/yr |
Vanguard
State Street Global Advisors
Fidelity Investments
Goldman Sachs