Barclays Senior Java Developer Interview Questions and Answers

Q1. Difference between hashmap and hash table
Ans. 
HashMap is non-synchronized and allows null values, while HashTable is synchronized and does not allow null values.
• HashMap is non-synchronized, meaning it is not thread-safe, while HashTable is synchronized and thread-safe.

• HashMap allows null values for both keys and values, while HashTable does not allow null keys or values.

• HashMap is generally preferred for non-thread-safe applications, while HashTable is used in mul
Answered by AI
Add your answer
Q2. Significance of equals and hashcode in java
Ans. 
Equals method is used to compare the content of objects while hashcode method is used to generate a unique integer value for an object.
• Equals method is used to compare the content of objects for equality.

• Hashcode method is used to generate a unique integer value for an object.

• Both methods are important for implementing proper object comparison and hashing in Java.
Answered by AI
Add your answer

Q1. What motivates you to come to office
Ans. 
I am motivated to come to the office by the opportunity to work on challenging projects, collaborate with talented colleagues, and contribute to the success of the team.
• Challenging projects provide a sense of accomplishment and growth

• Collaborating with talented colleagues allows for learning and innovation

• Contributing to the success of the team fosters a sense of purpose and fulfillment
Answered by AI
Add your answer
Q2. Any scenario where you coached and mentored your collegue in previous organisation?
Ans. 
Yes, I coached a junior developer on implementing design patterns in a project.
• Provided guidance on how to apply design patterns in code

• Reviewed their code and provided feedback for improvement

• Encouraged them to ask questions and seek clarification
Answered by AI
Add your answer

1)Buy and sell stock
2)2 sum
3) system design
4) Elastic search
5) deployment

Q1. Java related questions
Add your answer
Q2. Microservices related questions
Add your answer

They ask two questions for coding

Simple algorithm question about sorting

Q1. Algorith question about quick sort
Add your answer
Q2. Nlonn run time of the sort
Ans. 
The time complexity of the quicksort algorithm is O(n log n).
• Quicksort has an average time complexity of O(n log n).

• The best case time complexity of quicksort is O(n log n) when the pivot element divides the array into two equal halves.

• The worst case time complexity of quicksort is O(n^2) when the pivot element is the smallest or largest element in the array.
Answered by AI
Add your answer

3 rounds of basic aptitude questions

Q1. Basic C, DSA, JAVA questions
Add your answer

Q1. Tell us about your projects, whats your interests are, then some technical questions in JAVA
Add your answer

Q1. Basic HR questions
Add your answer

It had more than 30 aptitude questions and 2 coding questions

Q1. It was totally a tech round all questions were from Data structure, dbms, java, computer networking
Add your answer