Addepar Senior Java Developer Interview Questions and Answers

Q1. Kth node from behind for linked list
Ans. 
Find the Kth node from the end of a linked list
• Traverse the linked list to find the length of the list

• Calculate the position of the Kth node from the beginning

• Traverse the list again to find the Kth node from the end
Answered by AI
Add your answer

Q1. Java 8 Features
Add your answer
Q2. Reflection API ?
Add your answer

Q1. Basic Java and SQL query
Add your answer

General Question depended on daily life

List of employees and get employee name who is getting bonus more the 10000

Q1. Java OPPPS concept
Add your answer
Q2. String and feature
Add your answer
Q3. Spring feature and implementation
Add your answer
Q4. Hibernate and its implementation
Ans. 
Hibernate is a popular Java ORM framework that simplifies database interactions by mapping Java objects to database tables.
• Hibernate is an ORM (Object-Relational Mapping) framework that allows developers to map Java objects to database tables and vice versa.

• It provides a way to perform database operations using Java objects without writing complex SQL queries.

• Hibernate handles the mapping of Java classes to database ta...read more
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

This round had 2 questions of DSA where I was asked to first explain my approach and then code it as well in a production ready manner . After that , I was asked some questions related to Operating Systems and Java .

Q1. 
Remove the Kth Node from the End of a Linked List
You are given a singly Linked List with 'N' nodes containing integer data and an integer 'K'. Your task is to delete the Kth node from the end of this Lin...read more
Ans. 
Approach : 
1) Maintain two pointers – reference pointer and main pointer. 
2) Initialize both reference and main pointers to head. 
3) First, move the reference pointer to n nodes from head.
4) Now move both pointers one by one until the reference pointer reaches the end. 
5) Now the main pointer will point to nth node from the end. 
6) Return the main pointer.

TC : O(N) where N=length of the Linked
Answered Anonymously
Add your answer
Q2. 
Intersection of Linked List Problem
You are provided with two singly linked lists containing integers, where both lists converge at some node belonging to a third linked list.
Your task is to determine t...read more
Ans. 
Approach :

I) Using Hashing :

Basically, we need to find a common node of two linked lists. So we hash all nodes of the first list and then check the second list.

Note : Hash the nodes not the node value

1) Create an empty hash set.
2) Traverse the first linked list and insert all nodes' addresses in the hash set.
3) Traverse the second list. For every node check if it is present in the hash set. If we find a node in the has...read more
Answered Anonymously
Add your answer
Q3. Can you explain the life cycle of a thread in Java?
Ans. 
In Java, a thread always exists in any one of the following states. These states are:

1) New
2) Active
3) Blocked / Waiting
4) Timed Waiting
5) Terminated

Explanation of Different Thread States : 

1) New: Whenever a new thread is created, it is always in the new state. For a thread in the new state, the code has not been run yet and thus has not begun its execution.

2) Active: When a thread invokes the start() method, it ...read more
Answered Anonymously
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

This round also had 2 questions of DS/Algo where I coded one of them and then we switched our discussion to DBMS and OOPS ( particularly in Java ) .

Q1. 
Merge Two Sorted Linked Lists Problem Statement
You are provided with two sorted linked lists. Your task is to merge them into a single sorted linked list and return the head of the combined linked list.
...read more
Ans. 
Approach 1 (Recursive) :

1) Compare the head of both linked lists.
2) Find the smaller node among the two head nodes. The current element will be the smaller node among two head nodes.
3) The rest elements of both lists will appear after that.
4) Now run a recursive function with parameters, the next node of the smaller element, and the other head.
5) The recursive function will return the next smaller element linked with r...read more
Answered Anonymously
Add your answer
Q2. 
LRU Cache Design Question
Design a data structure for a Least Recently Used (LRU) cache that supports the following operations:
1. get(key) - Return the value of the key if it exists in the cache; otherw...read more
Ans. 
Answer : 

Structure of an LRU Cache :

1) In practice, LRU cache is a kind of Queue — if an element is reaccessed, it goes to the end of the eviction order
2) This queue will have a specific capacity as the cache has a limited size. Whenever a new element is brought in, it
is added at the head of the queue. When eviction happens, it happens from the tail of the queue.
3) Hitting data in the cache must be done in constan...read more
Answered Anonymously
Add your answer
Q3. What is the difference between the DELETE and TRUNCATE commands in DBMS?
Ans. 
Answer :

DELETE command:

1) This command is needed to delete rows from a table based on the condition provided by the WHERE clause.
2) It can be rolled back if required.
3) It maintains a log to lock the row of the table before deleting it and hence it’s slow.

TRUNCATE command:
1) This command is needed to remove complete data from a table in a database. It is like a DELETE command which has no WHERE clause.
2) It removes com...read more
Answered Anonymously
Add your answer
Q4. What is the garbage collector in Java?
Ans. 
Answer :

1) Garbage Collection in Java is a process by which the programs perform memory management automatically.
2) The Garbage Collector(GC) finds the unused objects and deletes them to reclaim the memory. I
3) In Java, dynamic memory allocation of objects is achieved using the new operator that uses some memory and the
memory remains allocated until there are references for the use of the object.
4) When there are no re...read more
Answered Anonymously
Add your answer

Round duration - 50 Minutes
Round difficulty - Medium

This round was inclined towards some Low Level Design Principles and some concepts from Java .

Q1. Design a Railway Reservation System.
Ans. 
Tip 1: Firstly, remember that the system design round is extremely open-ended and there’s no such thing as a standard answer. Even for the same question, you’ll have a totally different discussion with different interviewers.

Tip 2:Before you jump into the solution always clarify all the assumptions you’re making at the beginning of the interview. Ask questions to identify the scope of the system. This will clear the in...read more
Answered Anonymously
Add your answer
Q2. Why is Java considered platform-independent while the Java Virtual Machine (JVM) is platform-dependent?
Ans. 
JVM is platform dependent because it takes java byte code and generates byte code for the current operating system. So Java software is platform dependent but Java language is platform independent because different operating system have different JVMs.
Answered Anonymously
Add your answer

Java 8 related problems and basic Data structures

Core Java, Database, Spring, etc..

Q1. Salary and job location discussion
Add your answer