Fidelity International Software Developer Intern Interview Questions and Answers for Freshers

Round duration - 60 Minutes
Round difficulty - Medium

This was a Technical round. About 60 students were shortlisted for this round. There were two interviewers. First, they asked me to introduce myself. Then I was asked some concepts of OOPS. some questions from OS and DBMS. I was asked to write code to reverse a link list on the notepad and share my screen. Then I was asked about my projects and internship. There were some situational questions related to the internship. They asked me what I know about the company.

My interview took place in the morning at around 10:00 a.m. and lasted for about an hour.

Q1. What is the difference between Python and C++?
Ans. 
Python is a high-level, interpreted language known for its simplicity and readability, while C++ is a low-level, compiled language known for its performance and efficiency.
• Python is dynamically typed, while C++ is statically typed.

• Python uses indentation for code blocks, while C++ uses curly braces.

• Python has automatic memory management, while C++ requires manual memory management.

• Python is slower in execution compared...read more
Answered by AI
Add your answer
Q2. 
Reverse Linked List Problem Statement
Given a singly linked list of integers, return the head of the reversed linked list.
Example:
Initial linked list: 1 -> 2 -> 3 -> 4 -> NULL
Reversed link...read more
Ans. 
Reverse a singly linked list of integers and return the head of the reversed linked list.
• Iterate through the linked list and reverse the pointers to point to the previous node instead of the next node.

• Use three pointers to keep track of the current, previous, and next nodes while reversing the linked list.

• Update the head of the reversed linked list as the last node encountered during the reversal process.
Answered by AI
Add your answer

Round duration - 30 Minutes
Round difficulty - Medium

It was a virtual interview and there was just one interviewer. The interviewer was really friendly. First of all, the interviewer introduced himself and also shared some facts about the company. Then he asked me to introduce myself. Then behavioral and situational questions were asked. Then he asked if I was comfortable with relocation. BlackRock has 2 locations that are Gurgaon and Mumbai.

Round duration - 90 minutes
Round difficulty - Easy

This was face to face interview round. The interviewer was very friendly. He started by asking tell me
something about yourself. I told him about my interest in competitive coding(since I am weak in
probability, I always mentioned competitive coding in my introduction so that the interviewer
asks me coding questions and didn’t move to the probability section).

Q1. 
Maximum Value of an Equation Problem Statement
Given an array/list of integers points containing coordinates (x, y) of N points in a 2D plane, sorted by x-values in non-decreasing order. You need to deter...read more
Ans. 
Find the maximum value of an equation involving coordinates of points in a 2D plane.
• Iterate through all pairs of points and calculate the equation value

• Keep track of the maximum value encountered

• Consider the constraint |xi - xj| ≤ K while calculating the equation value
Answered by AI
Add your answer
Q2. 
Shortest Bridge Problem Statement
Two characters, Tony Stark and Thanos, reside on two separate islands within a 2-D binary matrix of dimensions N x M. Each matrix cell has a value of either 1 (land) or 0...read more
Ans. 
The task is to find the shortest path of transformed 0s that connects two islands in a binary matrix.
• Identify the two islands in the binary matrix.

• Find the shortest path between the two islands by converting 0s to 1s.

• Output the minimal length of the bridge needed to connect the two islands.
Answered by AI
Add your answer
Q3. 
Beautiful City Problem Statement
Ninja plans to visit a city where each house is connected via roads in a binary tree structure. Each level of the tree can have at most 2^K houses. Houses at the same leve...read more
Ans. 
The task is to connect houses at the same level in a binary tree structure using 'next' pointers.
• Traverse the binary tree level by level using BFS

• Connect nodes at the same level using 'next' pointers

• Use a queue to keep track of nodes at each level
Answered by AI
Add your answer

Round duration - 40 minutes
Round difficulty - Medium

The interviewer was very friendly to me. She was praising me for every solution that I provided.

Q1. 
Ninja's Apartment Problem Statement
Ninja plans to build an apartment in the shape of a rectangle. The goal is to determine the length and breadth of this rectangle such that the length is greater than th...read more
Ans. 
Given the area of a rectangle, find the length and breadth such that the length is greater than the breadth and the difference between them is minimized.
• Iterate through possible combinations of length and breadth

• Calculate the area for each combination and check if length is greater than breadth

• Select the combination with minimal difference between length and breadth
Answered by AI
Add your answer
Q2. 
Buy and Sell Stock Problem Statement
Imagine you are Harshad Mehta's friend, and you have been given the stock prices of a particular company for the next 'N' days. You can perform up to two buy-and-sell ...read more
Ans. 
The task is to determine the maximum profit that can be achieved by performing up to two buy-and-sell transactions on a given set of stock prices.
• Iterate through the array of stock prices and calculate the maximum profit that can be achieved by buying and selling at different points.

• Keep track of the maximum profit after the first transaction and the maximum profit overall by considering different combinations of buy a...read more
Answered by AI
Add your answer
Q3. 
Replace Node With Depth Problem Statement
For a given Binary Tree of integers, replace each of its data with the depth of the tree. The root is at depth 0, hence the root data is updated with 0. Replicate...read more
Ans. 
Replace each node in a binary tree with its depth starting from root as 0.
• Traverse the binary tree in inorder fashion and update each node's data with its depth.

• Start with depth 0 for the root node and increment the depth as you go down the tree.

• Handle cases where nodes do not have left or right child by taking -1 in their place.

• Print the inorder traversal of the tree with updated node data representing the depth.
Answered by AI
Add your answer

Round duration - 50 minutes
Round difficulty - Easy

This round was about System Design, Data Structures and Algorithms

Q1. 
Problem: Search In Rotated Sorted Array
Given a sorted array that has been rotated clockwise by an unknown amount, you need to answer Q queries. Each query is represented by an integer Q[i], and you must ...read more
Ans. 
Search for integers in a rotated sorted array efficiently.
• Use binary search to find the pivot point where the array is rotated.

• Based on the pivot point, apply binary search on the appropriate half of the array.

• Return the index of the integer if found, else return -1.

• Example: For input N=5, A=[4, 5, 6, 7, 0, 1, 2], Q=3, Q[i]=[0, 3, 6], output should be 4, -1, 2.
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Medium

THIS WAS A PUZZLE BASED ROUND

Q1. MULTIPLE QUESTIONS OF OOPS
Add your answer
Q2. Program of prime number
Ans. 
A program to find prime numbers within a given range
• Iterate through numbers in the given range

• Check if each number is divisible by any number other than 1 and itself

• If not divisible, it is a prime number
Answered by AI
Add your answer
Q3. Pseudo code of finding ones in a number
Ans. 
Count the number of ones in a given number using pseudo code
• Initialize a count variable to 0

• Iterate through each bit of the number and check if it is 1

• Increment the count if the bit is 1

• Return the count as the result
Answered by AI
Add your answer
Q4. Basic questions of sql and mongodb
Add your answer

Aptitude test with different sections. Each section had its own time limit. Level - Moderate to difficult

Q1. Introduce yourself
Ans. 
I am a passionate software developer with experience in Java, Python, and web development.
• Experienced in Java and Python programming languages

• Proficient in web development technologies like HTML, CSS, and JavaScript

• Currently pursuing a degree in Computer Science
Answered by AI
Add your answer
Q2. Resume projects
Add your answer
Q3. 2 DSA questions
Add your answer
Q4. One SQL Query question
Add your answer

3 questions of medium to hard coding questions.

Q1. Technical interview including SQL, one programming language, and dbms based questions. the interview went well and was of 90mins.
Add your answer

Round duration - 100 minutes
Round difficulty - Medium

Test started at 04:00 PM sharp and complete the same by 06:00 PM.
The test duration is 100 minutes.
Environment (Amcat) is user friendly and understandable.
Web cam and microphone were also enabled.

Q1. 
Longest Substring with At Most K Distinct Characters
Given a string S of length N and an integer K, find the length of the longest substring that contains at most K distinct characters.
Input:
The first...read more
Ans. 
Find the length of the longest substring with at most K distinct characters in a given string.
• Use a sliding window approach to keep track of the characters and their counts within the window.

• Maintain a hashmap to store the characters and their frequencies.

• Update the window size and characters count as you iterate through the string.

• Return the maximum window size encountered for each test case.
Answered by AI
Add your answer
Q2. 
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 - 40 minutes
Round difficulty - Hard

This round was conducted on skype platform. I was shared the invitation link one day prior to the interview and also was told the name of my interviewer. I looked at the profile of the interviewer at linked.in and got a better understanding of what kind of person he was and prepared accordingly. The round was scheduled at 3 :00 pm on 5th Nov and I was eagerly waiting for the clock hands to reach 3 o'clock since morning and finally I went in front of him after wearing a white shirt and a black coat over it along with a tie over it.

Q1. 
Ninja and Binary String Problem Statement
Ninja has a binary string S of size N given by his friend. The task is to determine if it's possible to sort the binary string S in decreasing order by removing a...read more
Ans. 
Determine if a binary string can be sorted in decreasing order by removing non-adjacent characters.
• Iterate through the binary string and check if it can be sorted in decreasing order by removing non-adjacent characters.

• Keep track of the count of '1's and '0's in the string to determine if it can be sorted in decreasing order.

• If the count of '1's is greater than the count of '0's, the string can be sorted in decreasing
Answered by AI
Add your answer
Q2. 
Split the String Problem Statement
You are given a string str consisting of N lowercase alphabets. Your task is to determine if it is possible to divide the string into three non-empty substrings such tha...read more
Ans. 
Given a string, determine if it can be split into three non-empty substrings where one is a substring of the other two.
• Check if any substring of the string is a substring of the other two substrings.

• Iterate through all possible splits of the string and check for the condition.

• Use two pointers to find all possible substrings efficiently.
Answered by AI
Add your answer

Round duration - 40 minutes
Round difficulty - Easy

This round was scheduled on 15th Nov, almost after 10 days of the previous technical round. I got the confirmation of passing the previous round on 11th Nov and was asked to appear in this final round which was scheduled on 15th Nov at 11:00 am in the morning and it was going to be an HR round which probably was my favourite among all the other rounds. I prepared for by reading interview experiences available at coding ninjas and geeksforgeeks.

Round duration - 90 Minutes
Round difficulty - Hard

Q1. 
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 - 90 Miinutes
Round difficulty - Medium

I was asked 3 coding questions

Q1. How would you design a system like Facebook?
Ans. 
Designing a system like Facebook involves creating user profiles, news feeds, friend connections, messaging features, and more.
• Create user profiles with personal information, photos, and posts

• Implement a news feed algorithm to display relevant content to users

• Allow users to connect with friends and follow other users

• Include messaging features for private communication between users

• Implement notifications for likes, com...read more
Answered by AI
Add your answer
Q2. 
Sorted Linked List to Balanced BST Problem Statement
Given a singly linked list where nodes contain values in increasing order, your task is to convert it into a Balanced Binary Search Tree (BST) using th...read more
Ans. 
Convert a sorted singly linked list into a Balanced Binary Search Tree (BST) using the same data values.
• Create a function to convert the linked list to a BST by finding the middle element as the root and recursively building the left and right subtrees.

• Maintain a pointer to the head of the linked list and update it as nodes are processed.

• Use level order traversal to output the values of the BST nodes, representing NULL...read more
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Easy

This is HR + Technical Round
Started with tell me about yourself asked about projects in depth

Q1. 
Cycle Detection in a Singly Linked List
Determine if a given singly linked list of integers forms a cycle or not.
A cycle in a linked list occurs when a node's next points back to a previous node in the ...read more
Ans. 
Detect if a singly linked list forms a cycle by checking if a node's next pointer points back to a previous node.
• Use Floyd's Cycle Detection Algorithm to determine if there is a cycle in the linked list.

• Maintain two pointers, one moving at twice the speed of the other.

• If the two pointers meet at any point, there is a cycle in the linked list.
Answered by AI
Add your answer