Fidelity International Software Developer Intern Interview Questions and Answers for Freshers

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

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.

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

Technical MCQ and coding (medium)

This was long programing round. In this you need to design a application. First you need do ER or class diagram. Then you need code in any programing language but OOPS is prefered. They see is app is scalable and data modeling

Q1. Basing OOPS, DBMS, SQL and DS
Add your answer
Q2. Sql joins and normalisation
Add your answer
Q3. Sort stack ds and real life example
Ans. 
Sorting a stack data structure and its real-life example
• Sorting a stack involves popping elements and comparing them to the remaining elements in the stack

• Real-life example: arranging books on a shelf in alphabetical order

• Another example: sorting a deck of cards by suit and rank
Answered by AI
Add your answer
Q4. Question from resume and previous round solution
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

The round consisted of 3 coding Questions and 20 Technical MCQs.

Q1. 
Connect Ropes Problem Statement
Given a number of ropes denoted as 'N' and an array containing the lengths of these ropes, your task is to connect the ropes into one single rope. The cost to connect two r...read more
Ans. 
The task is to find the minimum cost required to connect all the ropes by summing their lengths.
• Iterate through the ropes and connect the two shortest ropes at each step to minimize cost

• Use a priority queue to efficiently find the shortest ropes

• Keep track of the total cost as you connect the ropes

• Example: For input [4, 3, 2, 6], connect 2 and 3 (cost 5), then connect 4 and 5 (cost 9), then connect 9 and 6 (cost 15) for...read more
Answered by AI
View 2 more answers
Q2. 
Idempotent Matrix Verification
Determine if a given N * N matrix is an idempotent matrix. A matrix is considered idempotent if it satisfies the following condition:
M * M = M
Input:
The first line cont...read more
Ans. 
Check if a given matrix is idempotent by verifying if M * M = M.
• Iterate through the matrix and multiply it with itself to check if it equals the original matrix.

• If the condition M * M = M is satisfied, then the matrix is idempotent.

• If the condition is not satisfied, then the matrix is not idempotent.
Answered by AI
Add your answer
Q3. 
Sum of LCM Problem Statement
Given an integer 'N', calculate and print the sum of the least common multiples (LCM) for each integer from 1 to N with N.
The sum is represented as:
LCM(1, N) + LCM(2, N) + ....read more
Ans. 
Calculate and print the sum of least common multiples (LCM) for each integer from 1 to N with N.
• Iterate from 1 to N and calculate LCM of each number with N

• Add all the calculated LCM values to get the final sum

• Return the sum for each test case
Answered by AI
Add your answer

Round duration - 120 minutes
Round difficulty - Medium

This round is a Long Coding Round. Every Candidate was assigned with a mentor who guides them, We were given a real-life scenario for which we have to construct a database with required tables. We should draw an ER Diagram to demonstrate the Database. After the Database Completion, We have to Start Coding the Application. The Design(like Placing the button or background colour) is not given much importance. They mainly test the practical knowledge of candidates in OOPS and expertise in a C, C++, Java, Android or any other language were OOPS Concepts can be applied.

Round duration - 180 Minutes
Round difficulty - Medium

This Round is a technical Interview. I was asked Questions to test my Technical Knowledge.

Q1. 
Sort 0 1 2 Problem Statement
Given an integer array arr of size 'N' containing only 0s, 1s, and 2s, write an algorithm to sort the array.
Input:
The first line contains an integer 'T' representing the n...read more
Ans. 
Sort an array of 0s, 1s, and 2s in linear time complexity.
• Use three pointers to keep track of 0s, 1s, and 2s while iterating through the array.

• Swap elements based on the values encountered to sort the array in-place.

• Time complexity of the algorithm should be O(N) where N is the size of the array.
Answered by AI
Add your answer

Round duration - 20 Minutes
Round difficulty - Easy

Maths,verbal reasoning.
Like percentage,wages, proportional problems

Particular topic on political party