Aegon Full Stack Developer Interview Questions and Answers

Q1. System design interview
Add your answer

Q1. What is transactional annotation in spring ?
Ans. 
Transactional annotation in Spring is used to define the scope of a transaction.
• Transactional annotation is used to mark a method or a class as transactional.

• It ensures that all the operations within the annotated method or class are executed within a single transaction.

• If an exception occurs, the transaction is rolled back.

• Transactional annotation can be applied at the method level or class level.

• It provides various a...read more
Answered by AI
View 1 more answer
Q2. What is cache in spring?
Ans. 
Cache in Spring is a mechanism to store frequently accessed data in memory for faster retrieval.
• Cache improves application performance by reducing the load on the database.

• Spring provides caching support through annotations like @Cacheable, @CachePut, and @CacheEvict.

• Caches can be configured with different eviction policies, such as LRU or FIFO.

• Example: @Cacheable annotation can be used to cache the result of a method
Answered by AI
Add your answer
Q3. It stores the data in cache, where checks the dup
Add your answer

30 Technical MCQs, 1 medium level code

Q1. Java technical interview
Add your answer

Q1. Compensation discussion and RISES values questions
Add your answer

Round duration - 30 minutes
Round difficulty - Medium

It was in the morning. We had to complete 1 coding question in given time limit

Q1. 
Most Frequent Non-Banned Word Problem Statement
Given a paragraph consisting of letters in both lowercase and uppercase, spaces, and punctuation, along with a list of banned words, your task is to find th...read more
Ans. Brute Force
1. To find the frequency of each word we need to extract the words from the paragraph.
2. So we will convert all the punctuation to space in the paragraph and lowercase alphabets to uppercase.
3. Now we can use the library function (e.g sstream in C++) to extract words from the paragraph in an array of strings say WORDS.
4. We will iterate over WORDS and do:
   1. Iterate over the banned array and check if the current word is pre...read more
Answered Anonymously
Add your answer

Round duration - 60 minutes
Round difficulty - Hard

Interviewer was friendly. He asked 2 coding questions and some fullstack questions. 

Q1. 
Ways To Make Coin Change
Given an infinite supply of coins of varying denominations, determine the total number of ways to make change for a specified value using these coins. If it's not possible to make...read more
Ans. Recursion
 
1. The idea is to use recursion.
2. For a particular coin, we have two options either include it or exclude it.
3. If we include that coin, then calculate the remaining number that we have to generate so recur for that remaining number.
4. If we exclude that coin, then recur for the same amount that we have to make.
5. Our final answer would be the total number of ways either by including or excluding.
6. There will be two edg...read more
Answered Anonymously
Add your answer
Q2. 
The Skyline Problem
Compute the skyline of given rectangular buildings in a 2D city, eliminating hidden lines and forming the outer contour of the silhouette when viewed from a distance. Each building is ...read more
Ans. Brute Force
The idea here is to first, sort the critical POINTS with respect to their coordinate and height pairs. Make a pair of 'X1' and take a negative of the height for the building so that 'X1' pairs are sorted before 'X2' pairs. Create a dictionary keeping the heights as keys and as soon as a left edge of a building is encountered, we add that building to the dictionary with its height as the key. When we encounte...read more
Answered Anonymously
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

Its duration is of 90 minutes in the hackerearth platform with 30 mcqs, 1 coding question and 1 sql query. It is a Web Proctored Exam. As its a hackathon we can write the written test from 11th Feb 2021 to 21st Feb 2021(11:59 p.m).

Q1. 
Query and Matrix Problem Statement
You are given a binary matrix with 'M' rows and 'N' columns, initially consisting of all 0s. You will receive 'Q' queries, which can be of four types:
Query 1: 1 R inde...read more
Ans. Brute Force
A simple idea is to traverse the given row or column. If you come across a query that is of type 1 then swap 0 with 1 and vice-versa and for the query of type 2 initialize a variable ‘COUNT’ and increment count when you encounter ‘0’ and return ‘COUNT’.
 
The steps are as follows:
 
• If the type of query is 1.
  • If we have to consider row ‘R’ at the given ‘INDEX’
    • Run a loop for row ‘INDEX’  and every c...read more
Answered Anonymously
Add your answer

Round duration - 30 Minutes
Round difficulty - Medium

The interview is conducted over the Teams Call at around 5:40 on 27th February. It is combined of both TR and HR. It was one of the best experience that I had so far. The TR and HR are about 15 mins for every candidate. 

SOLID, API Security, Git commands, Node.js basics

Round duration - 120 Minutes
Round difficulty - Medium

This was a coding round conducted from 12 PM to 2 PM and it was not proctored but we could not switch the tabs. There were 2 coding questions each of 100 marks. The MCQ had HTML,CSS, JS, SQL, Coding and aptitutude questions.

Q1. 
N Queens Problem
Given an integer N, find all possible placements of N queens on an N x N chessboard such that no two queens threaten each other.
Explanation:
A queen can attack another queen if they ar...read more
Ans. Backtracking
1. Instead of checking all the places on the chessboard, we can use backtracking and place queen row-wise or column-wise.
2. Suppose we place queens row-wise, and we start with the very first row. Place the queen and move to the next row until either there is a solution or there are no viable cells left.
3. As we backtrack, check to place the queen in the different columns of the same row.
4. When we can place a queen at ...read more
Answered Anonymously
Add your answer
Q2. 
Rearrange String Problem Statement
Given a string ‘S’, your task is to rearrange its characters so that no two adjacent characters are the same. If it's possible, return any such arrangement, otherwise re...read more
Ans. Brute force
In this approach, we will generate all the possible rearrangements of the string and check if the current string in our rearrangement does not have any two adjacent characters that are the same. If we can find any string which satisfies our criteria then we will return that string else we will return “not possible”.
 
We can implement the above approach by – 
1. Generate all permutations of a string.
2. For ...read more
Answered Anonymously
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

There were two interviewers. They started by asking me to introduce myself and asked me to explain any one of my projects in my resume and after that, they asked me about the ML algorithms used in my project and about the difficulties faced. What is NaN property in JavaScript? This took around 10 minutes. They also asked 2 coding questions.
It was conducted at 10 AM on CodePair and MS Teams. Interviewers were friendly.

Q1. 
Group Anagrams Together
Given an array/list of strings STR_LIST, group the anagrams together and return each group as a list of strings. Each group must contain strings that are anagrams of each other.
E...read more
Ans. Sorting based Approach
The idea behind this approach is that two or more than two strings are anagrams if and only if their sorted strings are equal. So we will use a HashMap, let’s say “anagramGroup”, where each key is a sorted string, and the key will be mapping to the list of indices from the given list of strings that form a group of anagrams. This means that if we sort the strings at those indices, we will get the ...read more
Answered Anonymously
Add your answer
Q2. 
Friends Pairing Problem
The task is to determine the total number of ways to pair up 'N' friends or leave some of them single, following these rules:
1. Each friend can either pair with one other friend ...read more
Ans. Bruteforce
The idea is to solve the problem using recursion and break down the problem into different subproblems.
Let’s define NUMBER_OF_WAYS(N) as the total number of ways ‘N’ friends can be paired up or remain single.
The N-th person has two choices - either remain single or pair up with one of the other ‘N - 1’ friends.
If he remains single, then the number of possible pairings are NUMBER_OF_WAYS(N - 1) as there are (N...read more
Answered Anonymously
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

There were 2 questions based on data structures, the round started from 1.15 PM .Some SQL questions like What is a Subquery? What are its types? What are UNION, MINUS and INTERSECT commands?

Q1. 
Vertical Order Traversal Problem Statement
You are given a binary tree, and the task is to perform a vertical order traversal of the values of the nodes in the tree.
For a node at position ('X', 'Y'), th...read more
Ans. Efficient Approach
The intuition is to find the breadth of the tree first so that we can beforehand know the maximum horizontal distance and minimum horizontal distance of a node from the root node. We can use the absolute value of minimum horizontal distance as an offset. Now we can use an array/list visited to store the visited nodes where ith element will store the node at (i - offset”) distance horizontally from the...read more
Answered Anonymously
Add your answer
Q2. 
Divide Two Integers Problem Statement
You are given two integers dividend and divisor. Your task is to divide the integers without using multiplication, division, and modular operators. Return the quotien...read more
Ans. Using Subtraction
We can subtract the divisor from the dividend until the dividend is greater than the divisor. The quotient will be equal to the number of total subtractions performed.
 
Below is the detailed algorithm:
 
1. Store the ‘IS_DIVIDEND_NEGATIVE = false’ and ‘IS_DIVISOR_NEGATIVE = false’.
2. Check if the ‘DIVIDEND’ and ‘DIVISOR’ are positive or negative and update the values of ‘IS_DIVIDEND_NEGATIVE’ and ...read more
Answered Anonymously
Add your answer

Round duration - 30 Minutes
Round difficulty - Easy

The round was at 7.30 PM and I was asked to introduce myself and we had basic talk on where I live and my interests. I asked about the work culture and about the role at the end.

Q1. You are presented with a puzzle where there are n balloons, and your task is to burst the maximum number of balloons using an arrow. How would you approach solving this puzzle?
Ans. 
This was basically finding a maximum number of points in a line. I coded that but he wanted an improved solution. He told me to assume the positions of balloons in a matrix where 1 represents if the balloon is present and vice versa. Then I had to find which row or column or diagonal had the maximum number of 1’s. Later he asked me if I had some questions.
Answered Anonymously
Add your answer