CodeClouds Senior Software Engineer Interview Questions and Answers

Q1. Java,oop, microservice, JPA
Add your answer
Q2. Spring boot , MySQL
Add your answer

Q1. Java, spring boot
Add your answer
Q2. Microservice, rest api
Add your answer

It started with basic introduction, than move ahead with Java, Spring boot question in the end, he asked one leetcode medium question based on DP . Ques : Find a minimum number of jumps required to reach the end of the array, and each index , it can jump arr[index] time at max, you need to calculate minimum number of steps required to reach at the end.

Hacker rank coding tesr

Q1. Relational database queries
Add your answer
Q2. Coding Question on JavaScript
Add your answer

Haker rank coding test on c# and sql

Q1. Ist technical interview
Add your answer

Q1. 2nd technical interview
Add your answer

Q1. This is technical with manager round
Add your answer

Q1. HR round ,in this round HR asked about your strength and comming 5 years where you want to reach.
Add your answer

It was good ...questions were easy and straight forward..basic questions based on ds algo

Q1. How to check a number is power of 2
Ans. 
To check if a number is a power of 2, we can use bitwise operations.
• A power of 2 has only one bit set to 1, so we can use the bitwise AND operator to check if the number is a power of 2.

• If n is a power of 2, then n & (n-1) will be 0.

• For example, 8 (1000 in binary) is a power of 2, and 8 & 7 (0111 in binary) is 0.
Answered by AI
Add your answer
Q2. Sort a stack without using another data structure
Ans. 
Sort a stack without using another data structure
• Use recursion to pop the top element and insert it at the bottom of the remaining stack

• Repeat until the stack is sorted in ascending order

• Time complexity: O(n^2), space complexity: O(n) due to recursion
Answered by AI
Add your answer
Q3. Check weather array have continuous increasing than decreasing value
Ans. 
Check if array has continuous increasing and decreasing values
• Loop through the array and check if each element is greater than the previous one

• Once you find the maximum element, check if the remaining elements are in decreasing order

• If yes, return true else false
Answered by AI
Add your answer

Q1. Design a cricinfo (LLD)
Ans. 
Design a cricinfo (LLD)
• Identify the entities: players, teams, matches, scorecards, tournaments, etc.

• Define the relationships between entities

• Create a database schema to store the data

• Implement APIs to fetch and update data

• Design a UI to display the information

• Consider scalability and performance

• Ensure data security and privacy
Answered by AI
Add your answer

Q1. Share details of your previous job.
Add your answer
Q2. Why should we hire you?
Add your answer
Q3. What are your strengths and weaknesses?
Add your answer

Q1. Core and Advance concepts of Java
Add your answer

Q1. Mainly on mutltithrerading concepts and previous experience on projects.
Add your answer

Q1. About projects and scenarios based questions.
Add your answer

Q1. About Salary negotiation and final round
Add your answer