Nomura Holdings Senior Software Engineer Interview Questions and Answers

Q1. Frequency of character in string
Ans. 
The question is asking about how to find the frequency of each character in a given string.
• Iterate through the string and count the occurrences of each character

• Store the counts in a data structure like a hashmap or array

• Return the counts for each character
Answered by AI
Add your answer

Q1. Reverse a string
Ans. 
Reverse a given string
• Create a new empty string to store the reversed string

• Iterate through the original string from end to start and append each character to the new string

• Return the reversed string
Answered by AI
Add your answer

Q1. Longest Increasing Subsequence
Ans. 
Find the length of the longest increasing subsequence in an array.
• Use dynamic programming to solve this problem efficiently.

• Iterate through the array and keep track of the longest increasing subsequence ending at each index.

• Example: For array [10, 22, 9, 33, 21, 50, 41, 60, 80], the longest increasing subsequence is [10, 22, 33, 50, 60, 80] with length 6.
Answered by AI
Add your answer

Q1. UseEffect polyfill
Add your answer

Few basics of java
Dsa question

Q1. Java multithreading questions
Add your answer
Q2. Spring boot questions.
Add your answer

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...read more
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
Add your answer

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...read more
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
Add your answer

Tell me about a time where you resolve a conflict

Reverse a string, identify anagram

70 minutes test, and 4 questions

Q1. Behavioural Queston
Add your answer

Q1. About projects in resume
Add your answer
Q2. Resume related questions
Add your answer