Absolute Senior Java Developer Interview Questions and Answers

The exam duration is one and a half hours.

The total exam time is one and a half hours.

It encompasses all topics related to full stack development.

Q1. Asks questions on SQL
Add your answer
Q2. Asks question in typical topics
Add your answer

Q1. Where do you see yourself in two years?
Ans. 
In two years, I see myself as a senior software developer leading a team on innovative projects.
• Advancing to a senior software developer role

• Leading a team on new and innovative projects

• Continuing to enhance my technical skills through ongoing learning and training
Answered by AI
Add your answer

Q1. LRU Cache - how to tackle
Ans. 
LRU Cache is a data structure that maintains a list of items in order of most recently used to least recently used.
• Implement using a doubly linked list and a hashmap for efficient operations

• When an item is accessed, move it to the front of the list

• When the cache is full, remove the least recently used item from the end of the list
Answered by AI
Add your answer
Q2. LRU Cache implementation based on a real time system. How would the main work which will be called etc etc
Add your answer

3 Medium level dsa questions

Q1. Lld of cab booking system
Ans. 
The Low Level Design (LLD) of a cab booking system involves detailing the system architecture and components at a lower level of abstraction.
• Identify the main components of the system such as user interface, booking engine, payment gateway, and driver allocation algorithm.

• Define the interactions between these components and how data flows between them.

• Specify the data structures and algorithms used for efficient bookin...read more
Answered by AI
Add your answer
Q2. Discussion about online assesment
Add your answer

HAckerrank based test

Medium leet code question

Q1. We have considered to directly send your profile to companies. How much CTC do you expect?
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

This was a online coding interview where I was asked coding questions.

Q1. 
Preorder Traversal of a BST Problem Statement
Given an array PREORDER representing the preorder traversal of a Binary Search Tree (BST) with N nodes, construct the original BST.
Each element in the given...read more
Ans. 
Preorder traversal is: process the root, left subtree, and then right subtree. So, to emulate this behaviour in a non-recursive way, a stack can be used. 
1. Start with pushing the root node to the stack and continue the traversal till there is at least one node onto the stack. 2. Pop the root node from stack, process it and push it’s right and left child on to stack. We push the right child before the left child b...read more
Answered Anonymously
Add your answer
Q2. 
Convert Sorted Array to BST Problem Statement
Given a sorted array of length N, your task is to construct a balanced binary search tree (BST) from the array. If multiple balanced BSTs are possible, you ca...read more
Ans. 
The approach to this question is quite simple. We traverse the array and process each element one by one. We separately create an insert function which basically takes the root node and the array element as parameters and insert the element in the tree after evaluating the conditions: 
1.Start from the root. 
2. Compare the inserting element with root, if less than root, then recurse for left, else recurse for ...read more
Answered Anonymously
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

This was a technical round. Programming based questions and oops/dbms based were asked. 
Some questions were :
1. How many types of trigger?
Ans. In SQL, there are 3 types of triggers :
DML (data manipulation language) triggers – Eg.– INSERT, UPDATE, and DELETE
DDL (data definition language) triggers Eg.– CREATE, ALTER, and DROP
Logon triggers –This type reacts to LOGON events
2. Can trigger be used with select statement?
Ans. No, triggers cannot be used with select statements. They can only be used with Insert, update or delete statements. 
3. Indexing in mysql? How many types of indexing in mysql?
Ans. Indexes are used to find rows with specific column values quickly. It helps to determine the position to seek to in the middle of the data file without having to look at all the data. It performs much faster than reading every row sequentially.
4. Engines in mysql?
Ans. So, in mysql, storage engine is a software module that a database management system uses to create, read, update data from a database. There are two types of storage engines: transactional and non-transactional.
5. Singleton pattern?
Ans. Singleton is a creational design pattern that ensured that a class has only one instance, while providing a global access point to this instance.

Q1. 
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:
...read more
Ans. 
The problem can be solved in O(n) time using the concept of hashing. 
Use a hashset to check for the current array value. Check if targetsum – current value exists in the map or not. If it exists, that means a pair with sum equal to target sum exists in the array.
Answered Anonymously
Add your answer