Fidelity International Interview Questions, Process, and Tips

Basic aptitude and logical reasoning

Q1. 1-Diffeerence between explict wait and implicit wait 2-How to handle stale exceptions 3-XML parsing and Json parsing 4-Maven compile and Mavem install 5-Sql Join questions 6-Requirement.txt in Python 7-sha...read more
Ans. 
Test Analyst interview questions on wait types, parsing, Maven, SQL, Python, and database connectivity and exceptions.
• Explicit wait waits for a specific condition to be met, while implicit wait waits for a certain amount of time before throwing an exception

• Stale exceptions occur when an element is no longer attached to the DOM, can be handled by refreshing the page or finding the element again

• XML parsing involves readi...read more
Answered by AI
Add your answer

Q1. 1-Spring ,agile,Jira,left shift approach
Add your answer

Aptitude test , questions based on english , maths and logical

Q1. Technical discussion with senior
Add your answer

Q1. Interview round with Assistant Director
Add your answer

Q1. Technical related to your skill
Add your answer

Q1. Current and expected CTC
Add your answer

Q1. AWS Architect Questions - Know your resume.
Add your answer

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