Evergent SQL Developer Interview Questions and Answers

Normal java coding question

Q1. What are spring ioc
Ans. 
Spring IoC (Inversion of Control) is a design pattern where the control of object creation and lifecycle is shifted to a container or framework.
• In Spring IoC, objects are created and managed by the Spring container.

• It helps in achieving loose coupling between classes.

• Dependency Injection is a key feature of Spring IoC, where dependencies of a class are injected by the container.

• Example: @Autowired annotation in Spring
Answered by AI
Add your answer
Q2. Different implementation of map interface
Ans. 
The Map interface in Java provides a way to store key-value pairs and retrieve values based on keys.
• Different implementations of the Map interface include HashMap, TreeMap, LinkedHashMap, and ConcurrentHashMap.

• HashMap provides constant-time performance for basic operations but does not guarantee the order of elements.

• TreeMap maintains elements in sorted order based on keys.

• LinkedHashMap maintains the insertion order of...read more
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Easy

The platform was HackerEarth time duration was 1 hour.
2 Coding questions were asked, 30 minutes for each were allotted.

Q1. Longest Substring Without Repeating Characters
Given a string 'S' of length 'L', return the length of the longest substring without repeating characters.
Example:
Suppose given input is ...read more
Ans. Brute Force
In the brute force approach, we will use two nested loops. The outer loop is used to select the starting index of the substring and the inner loop is used to fix the ending index of the substring. After selecting the substring, we will use another loop (or a method) to check whether the substring contains all unique characters or not using a HashSet.
Space Complexity: O(n)Explanation:
O(L), where L is the len...read more
Answered Anonymously
Add your answer
Q2. Triplets with Given Sum
You are given an array/list ARR consisting of N integers. Your task is to find all the distinct triplets present in the array which adds up to a given number K.
An array is said t...read more
Ans. Brute Force
• The most trivial approach would be to find all triplets of the array and count all such triplets whose ‘SUM’ = 'K'.
• We can find the answer using three nested loops for three different indexes and check if the values at those indexes sum up to 'K'.
• Create a set  to keep the track of triplets we have visited. Run first loop from i = 0 to i = ‘N’ - 3, second loop from j = i + 1 to j = ‘N’ - 2 and third loop ...read more
Answered Anonymously
Add your answer

Round duration - 120 Minutes
Round difficulty - Hard

This was a 2 hours round, with the following problem statement. At the end of the allotted time you had give a demo and explain your implementation.

Round duration - 45 Minutes
Round difficulty - Medium

The platform was Zoom, time duration was 45 mins. Started with Tell me something about yourself. I told them, that I like solving algorithms and real life problems.

Round duration - 20 Minutes
Round difficulty - Easy

Interviewer was very friendly. Asked few questions about myself and then asked questions about what I know about the company.