Fidelity International Software Developer Intern Interview Questions and Answers

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 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