FactSet Software Engineer2 Interview Questions and Answers

Q1. Introduce yourself
Add your answer
Q2. What has been your experience with framework design and implementation?
Ans. 
I have extensive experience in designing and implementing frameworks for various software projects.
• Designed and implemented a custom testing framework for automated testing of web applications.

• Utilized Spring framework for developing enterprise applications, including dependency injection and aspect-oriented programming.

• Contributed to the design and implementation of a microservices architecture using Netflix OSS frame
Answered by AI
Add your answer
Q3. What is the tech and languages you are comfortable with? Rate yourself on each.
Ans. 
I am comfortable with Java, Python, and SQL. I rate myself 8/10 in Java, 7/10 in Python, and 9/10 in SQL.
• Java - 8/10

• Python - 7/10

• SQL - 9/10
Answered by AI
Add your answer
Q4. What is your experience with finance?
Ans. 
I have experience working on financial software applications and projects.
• Developed financial software applications for tracking expenses and budgeting

• Worked on projects involving payment processing and transaction management

• Familiar with financial data analysis and reporting tools

• Collaborated with finance teams to understand requirements and implement solutions
Answered by AI
Add your answer
Q5. What is TDD and BDD? What are the differences and which one do you prefer?
Ans. 
TDD stands for Test-Driven Development and BDD stands for Behavior-Driven Development. TDD focuses on writing tests before writing code, while BDD focuses on the behavior of the system.
• TDD involves writing a failing test, writing code to make the test pass, and then refactoring the code.

• BDD focuses on defining the behavior of the system through examples written in a specific format like Given-When-Then.

• TDD is more deve...read more
Answered by AI
Add your answer

Q1. Write a program to find the frequency of word in a sentence
Ans. 
Program to find frequency of words in a sentence
• Split the sentence into words using space as delimiter

• Create a map to store word frequencies

• Iterate through the words and update the map accordingly

• Handle case sensitivity and punctuation if needed
Answered by AI
Add your answer
Q2. Write a program to check if the sum of digits of.the given number is a prime number
Ans. 
Program to check if sum of digits of a number is prime
• Convert the number to a string to iterate through each digit

• Calculate the sum of digits

• Check if the sum is a prime number
Answered by AI
Add your answer
Q3. Write an SQL query to get the second highest salary in the table
Ans. 
SQL query to get the second highest salary in a table
• Use the MAX() function to find the highest salary

• Use the WHERE clause to exclude the highest salary

• Order the salaries in descending order and limit the result to 1
Answered by AI
Add your answer
Q4. What is the difference between abstract class and interface? Give a use case for both.
Ans. 
Abstract class allows partial implementation while interface allows full abstraction.
• Abstract class can have both abstract and non-abstract methods, while interface can only have abstract methods.

• A class can only extend one abstract class, but can implement multiple interfaces.

• Abstract class is used when some common functionality needs to be shared among subclasses, while interface is used to define a contract for clas...read more
Answered by AI
Add your answer
Q5. Explain static and give it's use case.
Ans. 
Static keyword is used in programming to declare variables or methods that belong to the class itself, rather than instances of the class.
• Static variables are shared among all instances of a class.

• Static methods can be called without creating an instance of the class.

• Static keyword is used to define constants in a class.

• Static keyword is used in Java, C++, and other programming languages.
Answered by AI
Add your answer
Q6. Where are objects stored in memory?
Ans. 
Objects are stored in memory in the heap or stack depending on their scope and lifetime.
• Objects with local scope are stored on the stack, while objects with dynamic memory allocation are stored on the heap.

• Primitive data types like int, float are stored on the stack, while complex objects like arrays, classes are stored on the heap.

• Objects stored on the stack have faster access but limited size, while objects on the he
Answered by AI
Add your answer

Q1. Asked about my work experience and questions based on the resume points
Add your answer

Q1. Asked java programs, SQL questions.
Add your answer

Q1. With Manager, asked few technical questions based on resume points
Add your answer

Q1. It was casual discussion
Add your answer

Q1. It was mainly salary discussion and joining date related
Add your answer

Q1. Dsa questions- medium level
Add your answer
Q2. Dsa questions - medium level
Add your answer

Round duration - 45 Minutes
Round difficulty - Hard

Q1. 
Find the Duplicate Number Problem Statement
Given an integer array 'ARR' of size 'N' containing numbers from 0 to (N - 2). Each number appears at least once, and there is one number that appears twice. Yo...read more
Ans. 
Find the duplicate number in an integer array containing numbers from 0 to (N - 2).
• Iterate through the array and keep track of the frequency of each number using a hashmap.

• Return the number that appears twice in the array.

• The duplicate number is always present in the given array.
Answered by AI
Add your answer

Round duration - 50 Minutes
Round difficulty - Easy

Q1. 
Bubble Sort Problem Statement
Sort an unsorted array of non-negative integers using the Bubble Sort algorithm, which swaps adjacent elements if they are not in the correct order to sort the array in non-d...read more
Ans. 
Bubble Sort is used to sort an array of non-negative integers in non-decreasing order by swapping adjacent elements if they are not in the correct order.
• Iterate through the array and compare adjacent elements, swapping them if they are in the wrong order.

• Repeat this process until the array is sorted in non-decreasing order.

• Time complexity of Bubble Sort is O(n^2) in worst case.

• Example: For input [6, 2, 8, 4, 10], the o
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

Q1. 
Unweighted Graph Shortest Path Problem
You are tasked with finding the shortest path between two houses in the city of Ninjaland, represented as an unweighted graph. The city has N houses numbered from 1 ...read more
Ans. 
Find the shortest path between two houses in a city represented as an unweighted graph.
• Use breadth-first search (BFS) algorithm to find the shortest path in an unweighted graph.

• Start BFS from the source house and keep track of the shortest path to each house.

• Once the destination house is reached, backtrack to find the shortest path.

• Consider using a queue data structure to implement BFS efficiently.
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Easy