Carat Java Developer Interview Questions and Answers

Basic coding questions And logical questions

Simple program for mathematics

2 questions of DSA medium to hard

Q1. Question related to oops
Add your answer
Q2. Question related to coding
Add your answer
Q3. I was rejected after 2nd round
Add your answer

Q1. Question related to advanced topic in oops
Add your answer
Q2. Question related to coding
Add your answer

Easy to medium leetcode questions

Q1. Oops, Interfaces, Exception Handling, Collections, SQL, etc
Add your answer
Q2. Coding Question - Find 2nd largest element in array with least time complexity
Ans. 
Find the 2nd largest element in an array with the least time complexity.
• Sort the array in descending order and return the element at index 1.

• Initialize two variables to keep track of the largest and second largest elements.

• Iterate through the array and update the variables accordingly.

• Return the second largest element.
Answered by AI
View 1 more answer

Q1. Coding Question - print * matrix
Add your answer
Q2. HashMap, HashSet, Spring, Spring Framework, Microservices, etc
Add your answer

Q1. Basic Details, CTC Info
Add your answer
Q2. Tech Stack, Challenges Faced in career
Add your answer

Coding questions about array and string.

Cosing questions about sql and ds.

Q1. Personal and behavioral questions.
Add your answer

Q1. How make a queue using a stack
Ans. 
To implement a queue using a stack, use two stacks and simulate the queue operations.
• Use two stacks, one for enqueue operation and one for dequeue operation.

• For enqueue operation, simply push elements onto the stack used for enqueueing.

• For dequeue operation, if the dequeue stack is empty, pop all elements from enqueue stack and push onto dequeue stack.

• Then pop from the dequeue stack to simulate dequeue operation.
Answered by AI
Add your answer
Q2. Create a linked list
Ans. 
A linked list is a data structure consisting of nodes where each node points to the next node in the sequence.
• Create a Node class with data and next pointer

• Initialize a head pointer to null

• Add nodes by updating next pointers

• Traverse the list by following next pointers
Answered by AI
Add your answer

Q1. Easy-Medium level Leetcode questions on linkedlists
Add your answer
Q2. Simple recursion question
Add your answer
Q3. An SQL query Basic question in OOPS and resume description..
Add your answer
Q4. Basic questions regarding SQL
Add your answer
Q5. Difference between thread and process
Ans. 
A process is an instance of a program while a thread is a subset of a process that can run concurrently with other threads.
• Processes have their own memory space while threads share the same memory space within a process.

• Processes are independent of each other while threads within the same process can communicate with each other.

• Processes are heavier in terms of resource consumption compared to threads.

• Example: A web br...read more
Answered by AI
Add your answer

It was based on frontend technologies

Q1. Basic frontend question
Add your answer

Q1. Managerial round
Add your answer