Empower Retirement Associate Specialist Interview Questions and Answers

Simple aptitude test ............

3 question leetcode medium .......

Q1. Basic programming based questions
Add your answer

Q1. Project based questions
Add your answer

Q1. Basic personal questions
Add your answer

Q1. Oops, mvc, design principles
Add your answer

Round duration - 120 minutes
Round difficulty - Medium

Round duration - 120 minutes
Round difficulty - Medium

Q1. 
Rat in a Maze Problem Statement
You need to determine all possible paths for a rat starting at position (0, 0) in a square maze to reach its destination at (N-1, N-1). The maze is represented as an N*N ma...read more
Ans. 
Find all possible paths for a rat in a maze from source to destination.
• Use backtracking to explore all possible paths in the maze.

• Keep track of visited cells to avoid revisiting them.

• Explore all possible directions ('U', 'D', 'L', 'R') from each cell.

• Return the list of valid paths sorted in alphabetical order.
Answered by AI
Add your answer
Q2. 
Word Presence in Sentence
Determine if a given word 'W' is present in the sentence 'S' as a complete word. The word should not merely be a substring of another word.
Input:
The first line contains an in...read more
Ans. 
Check if a given word is present in a sentence as a complete word.
• Split the sentence into words using spaces as delimiter.

• Check if the given word matches any of the words in the sentence.

• Ensure the word is not a substring of another word in the sentence.
Answered by AI
Add your answer

This round consisted of multiple choice questions based on angular and java. I was asked to design a 3X3 grid that should listen to the click event and the selected grid should change the color to green.

Q1. Longest common subsequence of two string
Ans. 
The longest common subsequence of two strings is the longest sequence of characters that appear in the same order in both strings.
• Use dynamic programming to solve this problem efficiently.

• Create a 2D array to store the lengths of the longest common subsequences.

• Iterate through the characters of both strings and update the array based on the matching characters.

• Trace back the array to find the longest common subsequence
Answered by AI
Add your answer
Q2. Logical questions, questions about my project
Add your answer

Q1. Why this company, will you be able to relocate to given city
Add your answer

Round of 3 phases : Vocabulary, Business analytics and Coding

Q1. Convert number to ruman numeral
Ans. 
Convert a number to Roman numeral representation.
• Create a mapping of numbers to Roman numerals (e.g. 1 -> 'I', 5 -> 'V', 10 -> 'X', etc.)

• Iterate through the mapping in descending order and subtract the largest possible numeral from the number until it reaches 0.

• Build the Roman numeral representation by appending the corresponding numeral for each subtraction.

• Handle special cases like 4, 9, 40, 90, etc. by including the
Answered by AI
Add your answer

Q1. Resume questions
Add your answer

Q1. 
Alien Dictionary Problem Statement
You are provided with a sorted dictionary (by lexical order) in an alien language. Your task is to determine the character order of the alien language from this dictiona...read more
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
Add your answer
Q3. 
Reverse Words In A String Problem Statement
Given a string of length N, reverse the string word by word. Ensure that the output reversed string has a single space between two words and does not contain le...read more
Add your answer
Q4. 
Flood Fill Algorithm Task
Assist Ninja in altering the color of a specific region in his photo. Given the image as a 2D array where each pixel is a positive integer, update the color of a specified pixel ...read more
Add your answer