Nomura Holdings Senior Software Engineer Interview Questions and Answers

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

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

Few basics of java
Dsa question

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

Round duration - 90 Minutes
Round difficulty - Medium

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

Round duration - 60 Minutes
Round difficulty - Easy

Q1. The interview emphasized team collaboration and work ethics, with a particular focus on my overall work experience at my previous company.
Add your answer
Q2. What were your preferences regarding work locations, specifically your views on working from the office (WFO) compared to working from home (WFH)?
Ans. 
I prefer a mix of both working from the office and working from home.
• I believe in the benefits of face-to-face collaboration and communication that come with working from the office.

• At the same time, I appreciate the flexibility and productivity that working from home offers.

• I think a hybrid approach, where employees have the option to choose between WFO and WFH based on their tasks and preferences, is ideal.

• I have exp...read more
Answered by AI
Add your answer

Q1. Focus was on DS algo and scenario based coding questions
Add your answer
Q2. Design skills and OS knowledge
Add your answer

First round was a coding test which has 2 problem solving questions and 3 subjective questions based on C++

Q1. This is also based on problem solving and DSA. A small part will be OS and network.
Add your answer

More of a subjective round, highly focused on OS, networking and computer architecture.

Q1. This round is with the HM, totally subjective. Highly focused on past experience, current projects etc.
Add your answer

Q1. HR discussion mostly questions are related to past and current experience.
Add your answer

2 coding questions based on DSA.

Q1. Easy coding problem.
Add your answer
Q2. Medium coding problem.
Add your answer