Upload Button Icon Add office photos

Nomura Holdings

Compare button icon Compare button icon Compare

Filter interviews by

Nomura Holdings Java Developer Interview Questions and Answers

Updated 26 Dec 2024

Nomura Holdings Java Developer Interview Experiences

1 interview found

Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

Questions on Collections

Round 2 - Technical 

(2 Questions)

  • Q1. 2 coding questions
  • Q2. Questions on Collections

Interview Preparation Tips

Interview preparation tips for other job seekers - Prepare well for DSA questions

Interview questions from similar companies

Interview Questionnaire 

4 Questions

  • Q1. One coding question.
  • Q2. Questions on Data Structures
  • Q3. Logical Question: You are a captive. If you say the right answer, the assasin will hang you, if you say the wrong answer, he will shoot you. How do you escape?
  • Q4. Other aptitude questions

Interview Preparation Tips

Round: Other Interview
Experience: One year since I took the interview, so no idea exactly what questions they asked. But I was asked to write the code on paper in front of him and was asked to debug it. Some puzzles and aptitude questions along with other basic coding questions. It was great that the guy was interactive and started asking about my projects and college life.
Btw the answer to the logical question is: I should say " you will shoot me". Paradoxical.
Tips: Feel free to ask anything that you would like to know from them. Also frankly say that you don't know a certain topic if you have no clue what it is about. They don't like people wasting their time.

Round: HR Interview
Experience: This was not exactly a technical interview. He asked me to write a code to find the day of week when a certain date in any year of the calendar is given. I answered it and then he starting asking general questions as to why do u want to join the company, etc.
I gave answers to most of them convincingly. But I kept him engaged by explaining my life at college, the extra curriculars I did at college. Also I asked him about his experience as a software engineer. I asked him to reflect upon his career and how I should approach about my career.
Tips: The best part about HR interviews is they expect you to ask them lots and lots of questions. The more they are engaged, the more are your chances of impressing and getting selected. And more importantly, ask the interviewer about his experience with the present firm. This also works with my manager when ever he has a one on one with me :P
Cheers and all the best.

Skills: Soft Skills, General Aptitude, LOGICAL THINKING ABILITIES, Coding Skills And Knowledge On Data Structures
College Name: IIT Hyderabad

I was interviewed in Dec 2016.

Interview Preparation Tips

Round: Test
Experience: Programming section had basic questions on C++ & data structures.
Tips: Try to score maximum in aptitude test, they consider your score while placement.
Duration: 2 hours
Total Questions: 35

Round: Technical Interview 1
Experience: Questions asked during this round:
Introduce yourself.
Questions on projects & internships.
Questions on Final year project in detail (max part of interview was on final year project).
Basic concepts of C++.
Few programs on C++.
Puzzles.


Round: Technical Interview 2
Experience: ? 2 interviewers were there.
? Stressed interview.
? They grilled me a lot on C++ & data structures.
One interviewer started asking questions, and before I could complete my answer, another used to cut me in
middle & start asking another question. I realized it

Interview Preparation Tips

Round: Test
Experience: It was an easy test overall, basic programming things were asked in technical part of test whereas aptitude questions were also relatively easy.
Tips: You just need to know things which were there in CS101 for technical part of test .Nothing else is required.
Duration: 30 minutes
Total Questions: 1

Skills: Problem
College Name: Indian Institute of Technology, Bombay

Interview Questionnaire 

11 Questions

  • Q1. Print all nodes at a distance k from a given node in binary tree?
  • Q2. RandN function : which generates random number in [1,2,3..N] with equal probability. Given rand5, write a code for rand7 using rand5
  • Ans. 

    Code for rand7 using rand5 function

    • Use rand5 twice to generate a number in [1,25] with equal probability

    • If the number is greater than 21, discard and try again

    • Otherwise, return (number mod 7) + 1

  • Answered by AI
  • Q3. Puzzle: Using all(8,8,3,3) and only operators(*,/,-,+), make 24
  • Q4. How do you implement LRU cache?
  • Ans. 

    LRU cache is implemented using a doubly linked list and a hash map.

    • Create a doubly linked list to keep track of the order of elements in the cache.

    • Create a hash map to store the key-value pairs of the cache.

    • When a new element is added, check if the cache is full. If it is, remove the least recently used element from the linked list and the hash map.

    • When an element is accessed, move it to the front of the linked list to...

  • Answered by AI
  • Q5. Your current project in Company? A lot of questions from CV? Discussion went on for about 15 minutes?
  • Q6. Then had a lot of questions around java script and java. About different design patterns and web services
  • Q7. A lot of questions around java, collections frameworks, multi threading and so on. (This took a good 25-30 minutes )
  • Q8. A strategy question. It would be asked depending on which team you are being interviewed for.Mine was some apple seller problem. Here knowledge of real world scenario helps. Advice is to observe things aro...
  • Q9. Write down function to select pivot element randomly in Quick Sort
  • Ans. 

    Function to randomly select pivot element in Quick Sort

    • Generate a random index within the range of the array

    • Return the element at the randomly generated index as the pivot

  • Answered by AI
  • Q10. He asked me what is a data structure and why do we use one. Explained him. He asked some real life example of stack and queue. All I could gave him was programming examples but when he insisted on real li...
  • Q11. As we were talking very much on each question. He felt like talking more and from tech he went around for some biggest learning from a mistake/biggest achievement of life kind of questions. There were oth...

Interview Preparation Tips

General Tips: I recently interviewed with Goldman Sachs, and had 4 rounds of interview with them at their campus in Bangalore.
Skills: Algorithm, Data structure
College Name: na

Skills evaluated in this interview

Interview Preparation Tips

Round: Technical Interview
Experience: Technical on paper test questions:(dis was only for 12 among d 26 shortlisted ppl after apti...others directly had interviews)
5 wer selected in this test who wer nw sent for interviews
TECHNICAL INTERVIEW: (pls list the questions asked in all the rounds)
26 shortlisted after apti (14 directly for interviews & 12 had one more technical on paper test...mentioned above)
der wer min 2 technical rounds for each of them...max were 5

- You are given course dependencies
A->B,C
B->D
C->A
D->nothing
The above dependencies mean...if you want to take course A...you should take courses B and C first....To take B,Course D must be taken first....D is an independent course and can be taken without any prior requirements.
Now you are told these dependencies.Come up with an appropriate data structure to represent these dependencies.Then write a code that finds out all the courses that the student can take up...in this case the student can first take course D because its independent.Now that course D has been taken he can next take up B as it depends on B alone...But the courses A and C can never be taken because they depend on each other...So here all the courses that can be taken are B and D.
After i wrote the code....he asked for all possible test cases
-Given an array of length N....It can be filled with nos. only from 1 to N....find which nos are repeated in the array
-Given pointers to two nodes in a binary tree....find their least common ancestor...each node has pointer to only the parent node...not the left and right child..
-In a binary tree(Not necessarily a BST)...suppose the weight of any node is defined as the product of the key value of the node and the level of the node(Root at level 1)...find the node with maximum weight in the binary tree
-A sorted array of size n is right circularly rotated k times and this rotated array is given to you as input...Find out the value of k in log n time .
-There are some processes running at time T....and there are processes running at time T+30.
You have to find out
1)Which processes died at time T+30,which were alive at time T
2)Which are the new processes at time T+30,which were not there at time T
3)Which are the processes that were there at time T and are still running at time T+30
What data structure will you use to represent the process lists and write code to find out the answers to the 3 questions above
-Given a binary search tree...and a target sum...starting at the root...which all paths add up to the target sum?...if there are multiple paths....return the path with least no. of nodes.


College Name: Veermata Jijabai Technological Institute, Mumbai [ VJTI ]

Associate Interview Questions & Answers

Deutsche Bank user image Ashish Viswananthan

posted on 5 Dec 2015

I applied via Walk-in

Interview Questionnaire 

6 Questions

  • Q1. Personals (tell me about yourself, couple of short questions from resume
  • Q2. Lots of personals about why markets (why not consulting too!), why Deutsche etc
  • Q3. Couple of puzzles (reasonably simple)
  • Q4. Some problems on hedging using futures, FX exposure, credit exposure etc. Interest rates, currencies, some macro gyaan
  • Q5. Good no. of questions on subprime crisis (both factual and also interpretation based questions like „What would you do if you were Ben Bernanke and you found out about all this in 2007‟)
  • Q6. Couple of questions testing knowledge of capital markets etc („If I were an FII with 100 million dollars, where should I invest it today?‟ etc)

Interview Preparation Tips

Round: Technical Interview
Experience: I think they were looking for Analytical ability (more in terms of thought process of approaching a problem), good awareness of financial crisis and general gyaan and willingness to work in markets (i.e. how convincing my reasons were etc). I wasn‟t tested too much on derivatives and puzzles, but I believe a few others had lots of questions in this area.

I think the personals & financial crisis questions went very well, pretty decent with the puzzles too. Started a bit slowly on the problems, but was able to arrive at the solution quickly once I had the hang of the question.
Tips: I prepared pretty well for derivatives & financial crisis. Though my approach was not very quick for the former, this was not a problem because I was not hurried for these questions and they were also seeing how I was approaching the solution. I was well prepared with the personals section – very clear on why I wanted markets, not consulting etc and I think I gave them nearly 6 reasons for Why Deutsche 

Round: Technical Interview
Tips: For most banks, and for Deutsche especially, be prepared with personals at three levels (Tell me about yourself etc | Why markets, why not consult / IBD etc | Why Deutsche). I had done my homework by speaking to seniors in this respect and I think
Name
Ashish Viswanathan
Educational Qualification
B. Tech Chemical Engineering, IIT Madras
Workex
Shell Global Solutions (1 year)
Summers Company & Role
Deutsche Bank Global Markets, London Associate

Networth Fin Summers Guide 2010 6 | P a g e
my clarity of thought on these questions clinched it.

Round: Technical Interview
Tips: Make sure you understand what you are preparing in case of derivatives. Don‟t get caught up and confused by the math, learn the basics of why and how the derivatives work

Round: Technical Interview
Tips: Make sure you are well prepared with financial crisis / current affairs / bailout and efforts to fight the crisis. Have an opinion on issues like „Do you think it was right to not bail out Lehman?‟ etc and be prepared to defend your opinion

Skill Tips: Curiosity, “can-do” attitude, Gyaan on derivatives, basic excel skills, willingness to learn in a sometimes chaotic environment
Skills: basic excel skills, Curiosity To Learn
College Name: IIM Bangalore

I applied via Referral

Interview Questionnaire 

3 Questions

  • Q1. Puzzles
  • Q2. Financial Derivatives questions
  • Q3. HR questions

Interview Preparation Tips

Round: Technical Interview
Experience: I think they were looking for A bit of quant smartness, else mostly culture fit and a strong resume.
Tips: Be calm and confident and honest.

Skills: Finance Basics, Puzzle Solving Capability
College Name: IIM Bangalore

I was interviewed before Mar 2021.

Round 1 - Coding Test 

(3 Questions)

Round duration - 90 minutes
Round difficulty - Medium

There were 33 questions in total. The objective questions were simple.

  • Q1. 

    Sort Big List Dates Problem Statement

    Mary is an enthusiastic party-goer who struggles with remembering event dates. Help Mary by sorting a given list of event dates in an ascending order.

    Example:

    Inpu...
  • Ans. 

    Sort a list of event dates in ascending order based on year, month, and day.

    • Sort the list of dates based on year, then month, and finally day.

    • Use a sorting algorithm to rearrange the dates in ascending order.

    • Ensure the constraints are met for each date in the list.

  • Answered by AI
  • Q2. 

    Pair Sum Problem Statement

    You are given an integer array 'ARR' of size 'N' and an integer 'S'. Your task is to find and return a list of all pairs of elements where each sum of a pair equals 'S'.

    Note:
    ...
  • Ans. 

    Given an array and a target sum, find all pairs of elements that add up to the target sum.

    • Iterate through the array and for each element, check if the complement (target sum - current element) exists in a hash set.

    • If the complement exists, add the pair to the result list.

    • Sort the pairs based on the first element and then the second element.

    • Handle edge cases like duplicate elements and pairs with the same values.

    • Example...

  • Answered by AI
  • Q3. 

    Maximum Sum Problem Statement

    Given an integer N, your task is to recursively break it into three integer parts: N / 2, N / 3, and N / 4. You need to compute the maximum sum possible by dividing the numbe...

  • Ans. 

    Given an integer N, recursively break it into three parts and find the maximum sum possible.

    • Recursively divide N into N/2, N/3, and N/4 to find the maximum sum

    • Compare the sum obtained by dividing N with the sum of N itself

    • Return the maximum sum for each test case

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAMorgan Stanley interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 4 monthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more

Final outcome of the interviewRejected

Skills evaluated in this interview

I was interviewed before Mar 2021.

Round 1 - Face to Face 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Medium

Technical Interview round with questions based on DSA.

  • Q1. 

    Duplicate Integer in Array

    Given an array ARR of size N, containing each number between 1 and N-1 at least once, identify the single integer that appears twice.

    Input:

    The first line contains an integer...
  • Ans. 

    Identify the duplicate integer in an array containing numbers between 1 and N-1.

    • Iterate through the array and keep track of the frequency of each element using a hashmap.

    • Return the element with a frequency greater than 1 as the duplicate integer.

    • Ensure the constraints are met and a duplicate number is guaranteed to be present.

  • Answered by AI
  • Q2. 

    Sum Root to Leaf Numbers

    You are given an arbitrary binary tree consisting of N nodes, each associated with an integer value from 1 to 9. Each root-to-leaf path can be considered a number formed by concat...

  • Ans. 

    Calculate the total sum of all root to leaf paths in a binary tree formed by concatenating node values.

    • Traverse the binary tree from root to leaf nodes, keeping track of the current path sum

    • Add the current node value to the path sum and multiply by 10 for each level

    • When reaching a leaf node, add the final path sum to the total sum

    • Return the total sum modulo (10^9 + 7)

  • Answered by AI
  • Q3. 

    Topological Sort Problem Statement

    You are given a directed acyclic graph (DAG). Your task is to perform topological sorting of the graph and return any valid ordering.

    Explanation:

    A directed acyclic g...

  • Ans. 

    Implement a function to perform topological sorting on a directed acyclic graph (DAG) and return any valid ordering.

    • Create a graph data structure to represent the DAG

    • Use depth-first search (DFS) to perform topological sorting

    • Maintain a visited array to keep track of visited nodes

    • Return the ordering of nodes after DFS traversal

  • Answered by AI
Round 2 - Face to Face 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Technical interview round with questions based on DSA.

  • Q1. 

    LCA of Binary Tree Problem Statement

    You are given a binary tree consisting of distinct integers and two nodes, X and Y. Your task is to find and return the Lowest Common Ancestor (LCA) of these two nodes...

  • Ans. 

    Find the Lowest Common Ancestor (LCA) of two nodes in a binary tree.

    • Traverse the binary tree to find the paths from the root to nodes X and Y.

    • Compare the paths to find the last common node, which is the LCA.

    • Handle cases where one node is an ancestor of the other.

    • Consider edge cases like when X or Y is the root node.

    • Implement a recursive or iterative solution to find the LCA efficiently.

  • Answered by AI
  • Q2. 

    Rotated Array Minimum Finder

    You are provided with a sorted array that has undergone 'K' rotations (the exact value of 'K' is unknown). A rotation involves shifting each element of the array to the right,...

  • Ans. 

    Implement a function to find the minimum number in a rotated sorted array efficiently.

    • Use binary search to find the minimum element in the rotated array.

    • Compare the mid element with the start and end elements to determine which half of the array to search next.

    • Continue the binary search until the minimum element is found.

  • Answered by AI
  • Q3. 

    Maximum Binary Tree Construction Problem

    Given an array TREE of 'N' unique integers, construct a maximum binary tree using the following rules:

    1. The root of this tree is the maximum number in TREE.
    2. T...
  • Ans. 

    Construct a maximum binary tree from an array of unique integers following specific rules.

    • Find the maximum number in the array to set as the root of the tree.

    • Recursively construct the left subtree with elements before the maximum number.

    • Recursively construct the right subtree with elements after the maximum number.

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAMorgan Stanley interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Final outcome of the interviewRejected

Skills evaluated in this interview

Nomura Holdings Interview FAQs

How many rounds are there in Nomura Holdings Java Developer interview?
Nomura Holdings interview process usually has 2 rounds. The most common rounds in the Nomura Holdings interview process are Coding Test and Technical.
How to prepare for Nomura Holdings Java Developer interview?
Go through your CV in detail and study all the technologies mentioned in your CV. Prepare at least two technologies or languages in depth if you are appearing for a technical interview at Nomura Holdings. The most common topics and skills that interviewers at Nomura Holdings expect are Multithreading, Spring, Core Java, Java and Spring Boot.
What are the top questions asked in Nomura Holdings Java Developer interview?

Some of the top questions asked at the Nomura Holdings Java Developer interview -

  1. Questions on Collecti...read more
  2. 2 coding questi...read more

Tell us how to improve this page.

Nomura Holdings Java Developer Interview Process

based on 1 interview

Interview experience

4
  
Good
View more
Analyst
827 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior Analyst
734 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Assistant Manager
449 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Associate
423 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Vice President
196 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare Nomura Holdings with

Morgan Stanley

3.7
Compare

JPMorgan Chase & Co.

4.0
Compare

UBS

3.9
Compare

Barclays

3.8
Compare
Did you find this page helpful?
Yes No
write
Share an Interview