Skylad Java Software Engineer Interview Questions and Answers

They discussed some easy questions on Node JS and Dp and heap , binary search

Q1. Introduce yourself
Add your answer
Q2. What is multithreading and explain its usecases.
Ans. 
Multithreading is the ability of a CPU to execute multiple threads concurrently, improving performance and responsiveness.
• Multithreading allows for parallel execution of tasks, improving performance by utilizing multiple CPU cores.

• It is commonly used in applications that require handling multiple tasks simultaneously, such as web servers, video games, and data processing.

• Multithreading can help improve responsiveness i...read more
Answered by AI
Add your answer

Q1. Oops, basic ,SQL ,ado
Add your answer

Curd operation with SQL connectivity

Ms office,Core Java , Tally , C,

In my Opinion,view , If you ask me, As far as I can see/I am Concerned , It seems to me that , I think /feel/reckon/ belive , If you want my option , What we have to decide

Q1. Java 8 oops spring spring boot rest api
Add your answer

Q1. Java 8 spring stream api java oops rest api
Add your answer

Q1. It was salary negotiation round which went good with a FAKE promise that the offer will be rolled out the next day which was also the last working day , they didnt roll the offer out with a lame excuse .
Add your answer

Round duration - 70 minutes
Round difficulty - Medium

Link was active for 24 hours, I took the test at night.
Difficulty was medium.
There were some MCQs on Springboot/Java along with 2 DSA questions.

Q1. 
Zigzag Binary Tree Traversal Problem
Given a binary tree, compute the zigzag level order traversal of the node values in the tree. The zigzag traversal requires traversing levels from left to right, then ...read more
Ans. 
Applied BFS for level order traversal.
The core logic is how to append the current level nodes in the resultList.
If currLevel is even:
then append the curr level node list as it is to the resultList
else:
reverse the curr level node list and then append to the resultList.

Finally return the resultList.
Answered Anonymously
Add your answer
Q2. 
K Closest Points to Origin Problem Statement
Your house is located at the origin (0,0) of a 2-D plane. There are N neighbors living at different points on the plane. Your goal is to visit exactly K neighb...read more
Ans. 
As we need to find K closest restaurants to the source (0,0), I used priority queue(MaxHeap) in python to eliminate all the farthest restaurants and have only k closest restaurants left at the end of the loop.

I had stored the elements in priority Queue as a pair [distance, coordinates], so that at I can directly get the coordinates for the k closest restaurants to return in the result.
Answered Anonymously
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

Technical round (Questions on Java, Spring Boot, Microservices, Rest APIs, OOPs and Solid principals).

Round duration - 45 minutes
Round difficulty - Easy