Fidelity International Interview Questions, Process, and Tips

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 Problem Statement
Given a string A consisting of lowercase English letters, determine the length of the longest palindromic subsequence within A.
Explanation:
• A subsequ...read more
Ans. 
Find the length of the longest palindromic subsequence in a given string.
• Use dynamic programming to solve this problem efficiently.

• Create a 2D array to store the lengths of palindromic subsequences for different substrings.

• Fill the array diagonally based on the characters of the string.

• Consider both the cases where the characters at the start and end of the substring match or not.

• Return the length of the longest palind
Answered by AI
Add your answer
Q2. 
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. 
Implement a function to determine the total number of ways to make change for a specified value using given denominations.
• Use dynamic programming to keep track of the number of ways to make change for each value up to the target value.

• Iterate through each denomination and update the number of ways to make change for each value based on the current denomination.

• Return the total number of ways to make change for the targ...read more
Answered by AI
Add your answer

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 Non-Adjacent Nodes in a Binary Tree
Given a binary tree with integer values assigned to each node, select nodes such that their sum is maximum, ensuring no two adjacent nodes are picked.
I...read more
Ans. 
Find the maximum sum of non-adjacent nodes in a binary tree.
• Use dynamic programming to keep track of the maximum sum at each node considering whether to include or exclude the current node.

• Recursively traverse the binary tree while keeping track of the maximum sum of non-adjacent nodes.

• Consider the scenarios where the current node is included in the sum or excluded from the sum.

• Handle cases where the current node has c...read more
Answered by AI
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 Problem Statement
You are provided with an N x N matrix MAT consisting of positive integers, where each row and column is sorted in a non-decreasing order.
Your task is to return a list cont...read more
Add your answer
Q2. 
Longest Increasing Subsequence Problem Statement
Given an array of integers with 'N' elements, determine the length of the longest subsequence where each element is greater than the previous element. This...read more
Add your answer

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 Problem
You are provided with an array ARR of integers. The objective is to determine the second largest element in ARR.
Note:
a) Duplicate elements are allowed.
b) If no second ...read more
Add your answer