Filter interviews by
Algorithm to determine visible buildings in a 2D plane with given positions and heights
Sort the buildings by their x-coordinates
Traverse the sorted buildings from left to right
For each building, check if it is visible by comparing its height with the maximum height of previously visited buildings
If visible, add it to the list of visible buildings
Return the list of visible buildings
In a group of people with a symmetric relation of knowing each other, there will always be at least two people who know the same number of people.
Consider the person who knows the maximum number of people in the group.
If there is no one who knows the same number of people, then everyone else must know a different number of people.
But this would mean that the total number of people known by everyone else is different fr...
Prove that there exists a rectangle with all corners of the same color in a 2D plane with blue and red points.
Divide the plane into a grid of squares.
By the pigeonhole principle, there must be at least one row or column with four points of the same color.
Consider the pairs of points in that row or column and check if any of them form a rectangle.
Prove that F_nk is divisible by F_n where F_i is the ith Fibonacci number. with f_0 = 0
Use mathematical induction to prove the statement
Base case: F_n0 = 0, F_n is also 0, so 0 is divisible by 0
Inductive step: Assume F_nk is divisible by F_n, prove F_n(k+1) is divisible by F_n
F_n(k+1) = F_nk + F_n(k-1), use the assumption to show that F_nk is divisible by F_n
Therefore, F_n(k+1) is also divisible by F_n
Hence, the statem
Find the largest substring formed from repetition of a smaller string.
Identify all possible substrings of the given string.
Check if each substring can be formed by repeating a smaller string.
Return the largest substring that can be formed from repetition of a smaller string.
Expected length of segment containing (1,0) on a unit circle with three random points.
Use law of cosines to find length of each segment.
Calculate expected value using probability density function.
Answer is (4/pi) + (2/3).
If dist(u,v)>n/2 in an undirected graph, there exists a vertex x such that removing x makes u and v go to different connected components.
Find the shortest path between u and v
If the path length is greater than n/2, then there must be a vertex x on the path
Removing x will separate u and v into different connected components
For any subset of size n+1 of the set S of the first 2n numbers, there exists 2 numbers u and v such that u divides v.
Divide the set S into two subsets of n numbers each.
By the pigeonhole principle, at least one of the subsets contains two numbers whose ratio is an integer.
If the subset contains n+1 numbers, then one of the numbers must be in the subset with the two numbers whose ratio is an integer.
Therefore, there ex
For an odd-sized grid, there cannot be a Hamiltonian cycle in the graph.
A Hamiltonian cycle is a path that visits every vertex exactly once and ends at the starting vertex.
In an n*n grid, there are n^2 vertices and each vertex has degree 4.
For an odd n, the total degree of all vertices is odd, which means there cannot be a Hamiltonian cycle.
Top trending discussions
I appeared for an interview 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.
posted on 17 Jul 2024
I applied via Campus Placement and was interviewed in Apr 2024. There was 1 interview round.
Topic macro economics factor on indian capital market
Stay topic
Give important macro economic factors
I applied via Naukri.com and was interviewed in Oct 2024. There was 1 interview round.
I applied via Naukri.com and was interviewed in Apr 2022. There were 3 interview rounds.
I am currently working as a Relationship Manager. I have experience in demat account opening and UAT.
I am a Relationship Manager with experience in demat account opening and UAT.
Demat account is an account that holds securities in electronic form.
Documents required for demat account opening include PAN card, Aadhaar card, and a cancelled cheque.
My achievement includes achieving 120% of the sales target in the last quar...
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
posted on 18 Oct 2023
70 minutes test, and 4 questions
Some of the top questions asked at the Tower Research Capital LLC Strategist interview -
Software Engineer
35
salaries
| ₹20 L/yr - ₹68.8 L/yr |
Software Developer
32
salaries
| ₹24 L/yr - ₹53.9 L/yr |
Sde1
25
salaries
| ₹30 L/yr - ₹60 L/yr |
Senior Software Engineer
20
salaries
| ₹30 L/yr - ₹50 L/yr |
SDE (Software Development Engineer)
17
salaries
| ₹35 L/yr - ₹50 L/yr |
Nomura Holdings
Blackrock
Muthoot Homefin India
Adarsh Credit Co-Operative Society