Filter interviews by
I applied via Campus Placement and was interviewed before Apr 2023. There were 3 interview rounds.
A Spring Boot project
TreeMap is a class in Java that implements the Map interface using a tree structure.
TreeMap stores key-value pairs in a sorted order based on the natural ordering of keys or a custom Comparator.
It allows for efficient retrieval, insertion, and deletion operations.
Example: TreeMap<String, Integer> treeMap = new TreeMap<>();
Creating a Spring Boot API involves setting up a project, defining endpoints, and implementing business logic.
1. Set up a Spring Boot project using Spring Initializr or your IDE.
2. Define RESTful endpoints using @RestController and @RequestMapping annotations.
3. Implement service classes to handle business logic.
4. Use @Autowired to inject dependencies like repositories.
5. Configure application properties for database ...
Top trending discussions
posted on 15 Jul 2022
I applied via Referral and was interviewed before Jul 2021. There were 3 interview rounds.
If you are a fresher , then this is for you else almost no coding test for experienced candidates.
I applied via Naukri.com and was interviewed before Nov 2022. There was 1 interview round.
posted on 29 Jun 2024
I applied via Referral and was interviewed before Jun 2023. There were 3 interview rounds.
Coding test are just basic Array and linkedList question
posted on 5 Aug 2024
I applied via Job Portal and was interviewed in Feb 2024. There were 3 interview rounds.
30 mins Aptitude Question
30 mins - 3 Coding Question
Response codes indicate the status of a HTTP request. 200 & 201 are success codes, while 400 & 403 are client error codes.
200 - OK: Request was successful
201 - Created: Request was successful and a new resource was created
400 - Bad Request: The server cannot process the request due to a client error
403 - Forbidden: The server understood the request, but refuses to authorize it
I applied via Campus Placement and was interviewed in Mar 2021. There were 4 interview rounds.
Count the maximum continuous occurrences of '1' in a binary string.
Initialize a counter to track current streak of '1's.
Use a variable to store the maximum streak found.
Iterate through each character in the string.
If the character is '1', increment the current counter.
If the character is '0', compare and reset the current counter.
At the end of the iteration, ensure to check the last streak.
I applied via Company Website and was interviewed in Sep 2022. There were 4 interview rounds.
Basic Aptitude questions like quantitative and logical
Programs have to written for given questions
I applied via Company Website and was interviewed in May 2022. There were 4 interview rounds.
The test contains basic programming output questions and some aptitude questions.
We have to solve 5 programming questions in 1 hour. Questions are on arrays and strings.
Three technical questions related to string manipulation and clock calculations.
For parenthesis balancing, use a stack data structure to keep track of opening and closing brackets.
To reverse a string, use two pointers starting from the beginning and end of the string and swap characters until they meet in the middle.
To find the angle between hour and minute hand of clock, use the formula (30H - 11/2M) degrees, where H ...
The question asks to check if a number is prime and add all its digits.
To check if a number is prime, we can use a loop to divide it by all numbers from 2 to its square root.
If the number is divisible by any of these numbers, it is not prime.
To add all digits in a number, we can use a loop to extract each digit and add it to a running total.
I applied via Campus Placement and was interviewed in Jun 2022. There were 5 interview rounds.
20 questions were given.
aptitude + simple coding output based.
5 questions were shared on a doc file. We need to code them paste their solutions in the file. Level was easy to medium. Array-string based Questions.
Find minimum angle between hour and minute hand.
Calculate the angle made by hour hand with 12 o'clock position and minute hand with 12 o'clock position.
Calculate the difference between the two angles.
If the difference is greater than 180 degrees, subtract it from 360 degrees to get the minimum angle.
Find the maximum span of 1 in a 0,1 array.
Iterate through the array and keep track of the first and last occurrence of 1.
Calculate the difference between the last and first occurrence of 1.
Repeat the process for all 1's in the array and return the maximum difference.
Sort a binary array using one traversal and no extra space.
Use two pointers, one starting from the beginning and one from the end of the array.
Swap the elements if the left pointer points to 1 and the right pointer points to 0.
Continue traversing until the pointers meet in the middle.
based on 1 interview experience
Difficulty level
Duration
based on 2 reviews
Rating in categories
Development Engineer
18
salaries
| ₹5 L/yr - ₹7.1 L/yr |
Senior Solution Consultant
16
salaries
| ₹4 L/yr - ₹16 L/yr |
Business Analyst
15
salaries
| ₹3 L/yr - ₹8 L/yr |
Solution Consultant
14
salaries
| ₹3.3 L/yr - ₹10 L/yr |
Quality Engineer
12
salaries
| ₹3 L/yr - ₹8.5 L/yr |
Saama Technologies
Jumio
DISYS
Data-Core Systems