Kloudspot SDE (Software Development Engineer) Interview Questions and Answers

The aptitude test was relatively straightforward, consisting of both aptitude and technical questions, with a difficulty level ranging from easy to medium.

Q1. Was asked to write a code on basic DSA concept
Add your answer
Q2. Then was asked basic questions on DSA and SQL
Add your answer

Q1. Can you please introduce yourself?
Ans. 
I am a Software Development Engineer with 5 years of experience in developing web applications using Java, Spring, and Angular.
• 5 years of experience in software development

• Proficient in Java, Spring, and Angular

• Strong problem-solving skills

• Experience in developing web applications

• Good team player
Answered by AI
Add your answer
Q2. What type of questions are being asked?
Add your answer

Q1. What is the difference between an abstract class and an interface in object-oriented programming?
Ans. 
Abstract class can have both abstract and non-abstract methods, while interface can only have abstract methods.
• Abstract class can have method implementations, while interface cannot.

• A class can implement multiple interfaces, but can only inherit from one abstract class.

• Interfaces are used to define contracts for classes to implement, while abstract classes are used to provide a common base for subclasses.

• Example: Abstr...read more
Answered by AI
Add your answer
Q2. Abstract classes can have implemented methods; interfaces can only have declarations (before JAVA 8).
Add your answer

Q1. What is the implementation of Merge Sort in Java?
Ans. 
Merge Sort is a divide and conquer algorithm that divides the input array into two halves, recursively sorts them, and then merges the sorted halves.
• Divide the input array into two halves

• Recursively sort the two halves

• Merge the sorted halves back together
Answered by AI
Add your answer
Q2. What is the implementation of the Quick Sort algorithm in Java?
Ans. 
Quick Sort is a popular sorting algorithm that uses a divide-and-conquer approach to sort elements in an array.
• Choose a pivot element from the array.

• Partition the array into two sub-arrays: elements less than the pivot and elements greater than the pivot.

• Recursively apply the same process to the sub-arrays.

• Combine the sorted sub-arrays to get the final sorted array.
Answered by AI
Add your answer

Q1. Design tinyurl system design
Add your answer

Q1. They ask me about my previous job description details and education details
Add your answer
Q2. About carrier goals
Add your answer
Q3. About my responsibility in side the current company
Add your answer

Q1. They ask me about core concept of react js and next js
Add your answer
Q2. Ask me about core concepts of mongo Db and Node js
Add your answer

Q1. They told me about company curriculum, goals and ethics
Add your answer

Queue question - create queue from array

Q1. Working structure preference
Add your answer
Q2. Salary preference
Add your answer
Q3. No more questions
Add your answer

First round is apti when in placement

Too hard all are dsa questions