Fidelity International Interview Questions, Process, and Tips for Freshers

Q1. Can you please introduce yourself?
Ans. 
I am a motivated and detail-oriented finance student with a strong interest in investment management.
• Currently pursuing a degree in finance

• Completed relevant coursework in investment analysis and portfolio management

• Previous internship experience in financial services industry

• Strong analytical and problem-solving skills
Answered by AI
Add your answer
Q2. Can you describe about the last movie or web series/ book you read/ last vacation?
Ans. 
I recently read the book 'The Great Gatsby' by F. Scott Fitzgerald.
• The Great Gatsby is a classic novel set in the 1920s Jazz Age

• The story follows the mysterious millionaire Jay Gatsby and his obsession with Daisy Buchanan

• Themes of love, wealth, and the American Dream are explored throughout the book
Answered by AI
Add your answer

The test carried 7 sections of aptitude with no negative markings and the questions were also easy with time duration of 1 hours which was to be used for the coding round also

Basic understanding was checked, if basics are clear of DSA and computer science fundamentals then very easy to crack

Round duration - 100 minutes
Round difficulty - Easy

Test started at 04:00 PM sharp and complete the same by 06:00 PM.
The test duration is 1 hour 40 minutes.
Environment (Amcat) is user friendly.
Web cam and mic were enabled

Q1. Longest Palindromic Subsequence
You have been given a string ‘A’ consisting of lower case English letters. Your task is to find the length of the longest palindromic subsequence in ‘A’.
A subsequence is ...read more
Ans. Recursive Approach
The main idea behind this approach is to use recursion. The idea is to compare the first character of the string A[i..j] with its last character. There are two possibilities:
1. If the first character of the string is the same as the last character, we include first and last characters in the palindrome and do a recursive call for the remaining substring A[i + 1, j - 1].
2. If the last character of the string...read more
Answered by CodingNinjas
View 1 more amswer
Q2. Ways To Make Coin Change
You are given an infinite supply of coins of each of denominations D = {D0, D1, D2, D3, ...... Dn-1}. You need to figure out the total number of ways W, in which you can make a cha...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 by CodingNinjas
View 3 more amswers

Round duration - 45 minutes
Round difficulty - Hard

Interview stared at 11:00 am and went for 90 min.
Interview was held in zoom
Environment was very much user friendly

Q1. Maximum Sum of nodes in a binary tree such that no two nodes are adjacent
You have been given a binary tree with an integer value associated to each node. You are supposed to choose a subset of these nodes...read more
Ans. Using Memoization
Keeping in mind the fact that both node and its children can not be considered for the maximum sum at the same time, we know that if we take a node into our sum, then we will directly call recursively for its grandchildren, OR if we don't take the node into our consideration, we will call for its child nodes and finally consider the maximum sum from both these results.
 
Considering the above idea, ...read more
Answered by CodingNinjas
View 1 more amswer
Q2. Basic Puzzles
There are 3 mislabeled jars, with apple and oranges in the first and second jar respectively. The third jar contains a mixture of apples and oranges. You can pick as many fruits as required to...read more
Add your answer

Round duration - 120 minutes
Round difficulty - Easy

This round consisted of 4 sections, namely,
1. English
2. Technical MCQs
3. Coding
4. Algorithms

1. English: This section consisted of 10 questions in all(Time limit was 15min). 5 questions were based on a given passage which were of moderate level. Remaining questions were on vocabulary, error correction and phrases which were easy to moderate.

2. Technical MCQs: This section consisted of 20 technical questions(Time limit was 30min). Questions were mainly on simple SQL commands, Tracing the output of recursive or iterative code snippet, basics of networking(components of IP address), Output of a given algorithm, output of a given code snippet. This round was of moderate level.

3. Coding: In this section we were supposed to solve two coding questions in 60min. First question was simple which was based on basic operations on a 2D matrix. The second question was of moderate level. It was one of the well known problems, 'The longest increasing substring'.

4. Algorithm: This section had two questions(Time limit was 15min). We were required to design a suitable algorithm and type that for the given problem statement. The questions were
a. Add two polynomials as linked lists(Problem URL: shorturl.at/dPVX5)
b. Conversion of an infix expression to postfix(Problem URL: shorturl.at/ltDG6)
we were required to write algorithms for the above problems

This online screening test was conducted on 29th of October from 4PM to 6PM. It was conducted on HirePro platform and it was audio and video proctored. Switching tabs were not allowed.

Q1. Sorted Matrix
You are given an N x N matrix 'MAT' of positive integers, where every row and column is sorted in non-decreasing order.
Your task is to return a list containing all elements of the ...read more
Ans. Brute Force
We have a simple brute force solution for this problem.
 
1. Initialize a list ‘ANS’ of size N * N to store the elements of the matrix in sorted order.
2. Store all the elements of the matrix in the list ‘ANS’.
3. Sort the elements of the list in ascending order.
4. Return the ‘ANS’.
Space Complexity: O(1)Explanation:
O(1).
 
Constant space is used.
Time Complexity: OtherExplanation:
O(N ^ 2 * log(N ^ 2)), where N is t...read more
Answered by CodingNinjas
View 1 more amswer
Q2. Longest increasing subsequence
For a given array with N elements, you need to find the length of the longest subsequence from the array such that all the elements of the subsequence are sorted in strictly ...read more
Ans. 
Step 1: Brute did not work for me.
Step 2: DP solution was expected.
Answered by CodingNinjas
View 4 more amswers

Round duration - 30 minutes
Round difficulty - Medium

This round was purely technical. It was scheduled for me from 9AM. Most questions focused on OOP in C++/java.
First I was asked to explain Dynamic binding in OOP with a suitable code snippet. Then a code was shown by the interviewer and i was asked to verify if it was an example of static or dynamic binding. 
Then, I was asked about synchronization in java and to explain various methods to bring in synchronization in a multi-threaded program in java.
Then i was asked about rand() function in C++. I was asked to write a suitable code to demonstrate rand() function and explain srand() too.
I was then asked to solve the problem: Find the second largest element in an unsorted array without sorting
Then i was asked to explain about a project which i had done. 
Next I was asked few questions on basics of HTML and CSS.

Q1. Second largest element in the array
You have been given an array/list 'ARR' of integers. Your task is to find the second largest element present in the 'ARR'.
Note:
a) Duplicate elements...read more
Ans. 
I said that i would find the largest element using brute force, delete it and again find the largest element to find the second largest element.
Answered by CodingNinjas
View 3 more amswers