Upload Button Icon Add office photos

Fidelity International

Compare button icon Compare button icon Compare

Filter interviews by

Clear (1)

Fidelity International Software Developer Intern Interview Questions and Answers

Updated 28 Apr 2024

Fidelity International Software Developer Intern Interview Experiences

2 interviews found

Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Campus Placement and was interviewed in Mar 2024. There were 2 interview rounds.

Round 1 - Aptitude Test 

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

Round 2 - Coding Test 

Basic understanding was checked, if basics are clear of DSA and computer science fundamentals then very easy to crack

Interview Preparation Tips

Interview preparation tips for other job seekers - make sure your basics and foundation of DSA is very thorough

I was interviewed in Jan 2021.

Round 1 - Coding Test 

(2 Questions)

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

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

  • Answered by AI
Round 2 - Telephonic Call 

(1 Question)

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

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

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Civil Engineering from Malaviya National Institute of Technology Jaipur. I applied for the job as SDE - Intern in BangaloreEligibility criteriaabove 7 cgpa, all branches were allowedFidelity International interview preparation:Topics to prepare for the interview - Data Structures, hashmap, linked list, Pointers, OOPS, System Design, Algorithms, Dynamic Programming, array, 2-pointer problemsTime required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

Tip 1 : practice on gfg and coding ninjas
Tip 2 : compete on codechef and codeforces
Tip 3 : learn DSA and practice regularly
 

Application resume tips for other job seekers

Tip 1 : put your entire valuable experience in brief
Tip 2 : put the handle of you competitive coding profiles
Tip 3 : try to put those things that really attracts the recruiter, will be better if your past experiences relates to the company

Final outcome of the interviewSelected

Skills evaluated in this interview

Software Developer Intern Interview Questions Asked at Other Companies

Q1. Sum of Maximum and Minimum Elements Problem Statement Given an ar ... read more
asked in Amazon
Q2. Fish Eater Problem Statement In a river where water flows from le ... read more
asked in Apple
Q3. Kevin and his Fruits Problem Statement Kevin has 'N' buckets, eac ... read more
asked in CommVault
Q4. Sliding Maximum Problem Statement Given an array of integers ARR ... read more
Q5. Reverse Words in a String: Problem Statement You are given a stri ... read more

Interview questions from similar companies

I was interviewed before May 2021.

Round 1 - Coding Test 

(1 Question)

Round duration - 90 Minutes
Round difficulty - Medium

  • Q1. You will be provided with SQL queries and code snippets along with their outputs or errors in the options. Can you analyze and determine the correct outputs or identify the errors?
  • Ans. 

    Yes, I can analyze SQL queries and code snippets to determine correct outputs or errors.

    • Understand the SQL syntax and logic to identify errors in queries.

    • Check for syntax errors, missing or incorrect keywords, and data type mismatches.

    • Analyze the code snippets to identify logical errors or potential bugs.

    • Compare the expected output with the provided output to determine correctness.

  • Answered by AI
Round 2 - Face to Face 

(1 Question)

Round duration - 15 minutes
Round difficulty - Medium

  • Q1. What can you tell me about joins and indexing in database management systems?
  • Ans. 

    Joins are used to combine rows from two or more tables based on a related column, while indexing is a technique to improve the performance of queries by creating a data structure that allows for quick lookup of data.

    • Joins are used to retrieve data from multiple tables based on a related column, such as INNER JOIN, LEFT JOIN, RIGHT JOIN, and FULL JOIN.

    • Indexing involves creating data structures like B-trees or hash table...

  • Answered by AI
Round 3 - HR 

Round duration - 20 Minutes
Round difficulty - Medium

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - Intern in GurgaonEligibility criteriaAbove 7 CGPABlackrock interview preparation:Topics to prepare for the interview - Data Structures, OOPS, Operating Systems, DBMS, C++Time required to prepare for the interview - 4 MonthsInterview preparation tips for other job seekers

Tip 1 : Be well versed with the concepts of Data Structures and SQL
Tip 2 : Should have thorough knowledge of your projects 

Application resume tips for other job seekers

Tip 1 : Mention your projects very clearly
Tip 2 : You should be able to justify everything on your resume from grades to skills

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed before Sep 2020.

Round 1 - Face to Face 

(3 Questions)

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

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

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

  • 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
Round 2 - Face to Face 

(3 Questions)

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

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

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

  • Answered by AI
  • 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...

  • 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
Round 3 - Face to Face 

(1 Question)

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

  • 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
Round 4 - Face to Face 

Round duration - 30 minutes
Round difficulty - Medium

THIS WAS A PUZZLE BASED ROUND

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - Intern in BangaloreEligibility criteria7 CGPAGoldman Sachs interview preparation:Topics to prepare for the interview - I covered major data structure topics like Arrays, Stacks, Queues, Linked List, Trees, Graphs, backtracking, Dynamic Programming. After reading each topic, I tried to practice maximum questions on the concerned topic from Coding Ninjas, geeksforgeeks, Hackerrank and when stuck on a question, I preferred watching solution videos provided by Coding Ninjas.Time required to prepare for the interview - 5 monthsInterview preparation tips for other job seekers

Tip 1 : It is important to practice coding consistently because it is what enables you to solve interview-questions in the stipulated time. But before this, it is even important to have a clear understanding of all the data-structures, so that they can be easily implemented as and when required to solve a problem. 
Tip 2 : They do not judge you upon the number of internships you have done or the number of projects you have made. A single,good-quality project is sufficient, provided you have in-depth knowledge about it. 
Tip 3 : Practise topic-wise questions, participate in lots of coding contests, watch lots of Youtube solutions even after you could solve a question, because you may find a different approach that is efficient than yours,

Application resume tips for other job seekers

Tip 1 : Keep your resume short and clear. Mention your projects and internships with a brief description and year of completion. 
Tip 2 : Be very honest and figure out only those things in your resume that you really know.

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed before Sep 2020.

Round 1 - Face to Face 

(2 Questions)

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

  • Answered by AI
  • 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...
  • 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
Round 2 - HR 

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.

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from TIET - Thapar Institute of Engineering And Technology. Eligibility criteria8 CGPA or aboveBlackrock interview preparation:Topics to prepare for the interview - AVL Trees ,OOPS, Data Structures, WebDev(if mentioned in resume), Operating system, DBMSTime required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

Tip 1 : Revise Trees especially AVL trees and tree traversals as the major questions for data structures were from trees. 
Tip 2 : Revise your OOPs concepts for the interview round.
Tip 3 : If you have done a project in development, make sure you know well about them.

Application resume tips for other job seekers

Tip 1 : Mention only those things in your resume, you have knowledge about.
Tip 2 : A project in development is a plus.

Final outcome of the interviewRejected

Skills evaluated in this interview

Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Campus Placement and was interviewed in Aug 2024. There were 2 interview rounds.

Round 1 - Aptitude Test 

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

Round 2 - Technical 

(4 Questions)

  • 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
  • Q2. Resume projects
  • Q3. 2 DSA questions
  • Q4. One SQL Query question
Interview experience
3
Average
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Campus Placement and was interviewed in Aug 2024. There was 1 interview round.

Round 1 - Technical 

(4 Questions)

  • Q1. MULTIPLE QUESTIONS OF OOPS
  • 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
  • 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
  • Q4. Basic questions of sql and mongodb

Interview Preparation Tips

Interview preparation tips for other job seekers - have proper command of oops ,basic DSA and have good projects

Skills evaluated in this interview

I was interviewed in Nov 2020.

Round 1 - Coding Test 

(2 Questions)

Round duration - 120 minutes
Round difficulty - Medium

A 120-minute online test was conducted on HackerRank which had the following format:
1st Section :
2 Coding questions(30 minutes)
2nd Section :
10 MCQ questions(30 minutes)
3rd Section :
1 Advanced Programming Question(45 minutes)
4th Section :
2 Subjective Questions(15 minutes)
The coding questions and MCQ questions were a bit tricky so you need to manage your time properly and try to solve all the questions correctly..
Technical – included c and c++ output question, os(scheduling, semaphore), dbms(normal form, etc).

 

  • Q1. 

    Consecutive Sum Representation of a Number

    Find the number of ways the given number 'N' can be expressed as the sum of two or more consecutive natural numbers.

    Example:

    Input:
    N = 9
    Output:
    2
    Explan...
  • Ans. 

    Find the number of ways a given number can be expressed as the sum of two or more consecutive natural numbers.

    • Use a sliding window approach to iterate through all possible consecutive sums.

    • Keep track of the sum of the current window and adjust the window size accordingly.

    • Count the number of valid consecutive sum representations of the given number.

    • Example: For N = 9, valid representations are 2 + 3 + 4 and 4 + 5, so th

  • Answered by AI
  • Q2. 

    Count Pairs with Given Sum

    Given an integer array/list arr and an integer 'Sum', determine the total number of unique pairs in the array whose elements sum up to the given 'Sum'.

    Input:

    The first line c...
  • Ans. 

    Count the total number of unique pairs in an array whose elements sum up to a given value.

    • Use a hashmap to store the frequency of each element in the array.

    • Iterate through the array and for each element, check if (Sum - element) exists in the hashmap.

    • Increment the count of pairs if the complement exists in the hashmap.

  • Answered by AI
Round 2 - Video Call 

(1 Question)

Round duration - 45 minutes
Round difficulty - Medium

interview started with a typical tell me about yourself question. The interviewer was nice and friendly. 

He asked me to explain a little about my projects (only basics).
Which all data structures you know and my favourite data structure. I replied with a linked list.
He asked the difference between array and linked list, time complexities of insertion, deletion, etc. in both of them. Then he asked about sorting an array, different algorithms, and their time complexities.
How would you sort a linked list? How would you find the middle of the linked list in one pass? How would you merge two linked lists (I had to write code for the same)?
Then he asked how would you be able to manage the business and finance decisions at GS.
Tell me an incident when you had the chance to display your leadership skills.
Lastly, I was allowed to ask questions from the interviewer.

  • Q1. 

    Cousin Nodes in a Binary Tree

    Determine if two nodes in a binary tree are cousins. Nodes are considered cousins if they are at the same level and have different parents.

    Explanation:

    In a binary tree, e...

  • Ans. 

    Determine if two nodes in a binary tree are cousins based on level and parent criteria.

    • Traverse the tree to find the levels and parents of the given nodes.

    • Check if the nodes are at the same level and have different parents.

    • Return 'YES' if the nodes are cousins, 'NO' otherwise.

  • Answered by AI
Round 3 - Video Call 

(1 Question)

Round duration - 45 minutes
Round difficulty - Medium

This round was relatively short and mostly consisted of coding (on hackerrank’s codepair platform)

The interviewer asked me about my previous interview and what all questions were asked in it.
Then there was a discussion about my projects and the technologies used in them. How would you deploy an application and what happens in the process of entering a keyword in the browser and loading your requested page? 
He asked me to write the code for finding the middle of a linked list in one pass.
After that, I had to write the code for the implementation of a queue. I first discussed the approaches with him using array and linked lists for some time. They wrote the code using a linked list by taking head and tail pointer.
He was satisfied with it and the round ended with me asking him the questions I had.

  • Q1. 

    Middle of a Linked List

    You are given the head node of a singly linked list. Your task is to return a pointer pointing to the middle of the linked list.

    If there is an odd number of elements, return the ...

  • Ans. 

    Return the middle element of a singly linked list, or the one farther from the head if there are even elements.

    • Traverse the linked list with two pointers, one moving twice as fast as the other

    • When the fast pointer reaches the end, the slow pointer will be at the middle

    • If there are even elements, return the one that is farther from the head node

    • Handle edge cases like linked list of size 1 or empty list

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Sathyabama Institute Of Science And Technology. Eligibility criteriaNo criteriaGoldman Sachs interview preparation:Topics to prepare for the interview - Data Structures,CPP,Algorithms,PUZZLES,Operating systems,DBMS.Time required to prepare for the interview - 2 monthsInterview preparation tips for other job seekers

Tip 1 : Revise all the coding interview questions that you have solved so far in the last few days
Tip 2 : Practice writing the codes on paper with clarity
Tip 3 : Mention only those thing that you know in your CV and revise your projects nd everything you have mentioned on your resume thoroughly.

Application resume tips for other job seekers

Tip 1 : Do not even mention topics you have no idea about
Tip 2 : you should have some projects on resume and you should be able to explain clearly why you have chosen the particular project, what does it do, its functionality, outcomes and everything about each of the projects.
Tip 3 : Tailor your resume according to the needs/the role you are applying for

Final outcome of the interviewRejected

Skills evaluated in this interview

I was interviewed in Mar 2021.

Round 1 - Coding Test 

(1 Question)

Round duration - 90 minutes
Round difficulty - Medium

This test was conducted on the Hackerrank platform, it was divided into 6 sections which contained a total of 66 questions with an overall time limit of 90 minutes, There was video proctoring, and changing sections were allowed.
The sections were-

Numerical Computations — 8 questions
Numerical Reasoning -12 questions
Comprehension — 10 questions
Abstract Reasoning — 12 questions
Diagrammatic Reasoning — 12 questions
Logical Reasoning — 12 questions

  • Q1. 

    Convert a Number to Words

    Given an integer number num, your task is to convert 'num' into its corresponding word representation.

    Input:

    The first line of input contains an integer ‘T’ denoting the number o...
  • Ans. 

    Convert a given integer number into its corresponding word representation.

    • Implement a function that takes an integer as input and returns the word representation of the number in English lowercase letters.

    • Break down the number into its individual digits and convert each digit into its corresponding word form.

    • Handle special cases like numbers between 10 and 19, multiples of 10, and numbers with zeros in between.

    • Concaten...

  • Answered by AI
Round 2 - Video Call 

(1 Question)

Round duration - 45 Minutes
Round difficulty - Easy

The interview started at 12 in the noon.
The interviewer seemed very cheerful. He began by greeting and asked me for a quick introduction.
Then he talked about the various projects I have mentioned in my resume and what further improvements I was going to make in my projects. Further he started asking questions on fundamentals of Data Structures and Algorithms, few questions on operating syatem and gave a problem statement on DSA.

  • Q1. 

    Pair Sum Problem Statement

    You are provided with an array ARR consisting of N distinct integers in ascending order and an integer TARGET. Your objective is to count all the distinct pairs in ARR whose sum...

  • Ans. 

    Count distinct pairs in an array whose sum equals a given target.

    • Use two pointers approach to iterate through the array and find pairs with sum equal to target.

    • Keep track of visited elements to avoid counting duplicate pairs.

    • Return -1 if no such pair exists with the given target.

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaNo criteriaGoldman Sachs interview preparation:Topics to prepare for the interview - Python, Data Structure, Operations in Binary trees, arrays, stacks and linked lists, CS fundamentals, optimization of algorithms.Time required to prepare for the interview - 10 monthsInterview preparation tips for other job seekers

Tip 1 : Be honest about your skills and work experiences,especially prepare a good answer for the question "Tell me about yourself"
Tip 2 : Take whatever guidance you can get from seniors, faculty and your mentors.
Tip 3 : work on dynamic projects
Tip:4 : Try to write good and effective answers for the paragraph-based questions in the technical round.
Tip:5 : At the end always ask questions to the interviewer which shows your passion and interest to work in the company
Tip:6 : Always do some background search on the company you are applying for.

Application resume tips for other job seekers

Tip 1 : Being honest about your achievements and projects
Tip 2 : Do not mention unnecessary details, only relevant details and information about the post you are applying for must be mentioned in your resume.
Tip 3 : Mention your unique qulities.
Tip 4 : Include 5-10 skills in the resume, and do highlight your most important skills and achievements.

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed in Jan 2021.

Round 1 - Coding Test 

(2 Questions)

Round duration - 120 minutes
Round difficulty - Easy

This round was held in the evening at 6 o'clock on Hackerrank. It had coding questions: easy, medium, and hard level and MCQ's ( 1 minute for each MCQ). Negative marking was also there

  • Q1. 

    Excel Column Number Problem Statement

    Given a column title as it appears in an Excel sheet, return its corresponding column number.

    Example:

    Input:
    "AB"
    Output:
    28
    Explanation:

    Column title "AB" co...

  • Ans. 

    Convert Excel column title to corresponding column number

    • Iterate through the characters in the column title from right to left

    • Calculate the corresponding value of each character using its position in the alphabet

    • Multiply the value by 26 raised to the power of its position from right

    • Sum up all the values to get the final column number

  • Answered by AI
  • Q2. 

    Climbing the Leaderboard Problem Statement

    In a game leaderboard, scores determine rankings where the highest score gets rank 1. Players with identical scores share the same rank, followed by the next ran...

  • Ans. 

    Implement a function to determine a player's leaderboard rank for each game score.

    • Iterate through the game scores and compare them with the leaderboard scores to determine the rank.

    • Handle cases where players have identical scores by assigning them the same rank.

    • Ensure the leaderboard scores are in descending order and game scores are in ascending order.

    • Return the ranks for each game score in an array.

  • Answered by AI
Round 2 - Video Call 

(2 Questions)

Round duration - 30 minutes
Round difficulty - Easy

This was an interview round ( technical round) that was held on video-call and a coding platform was also shared. The interviewer was very friendly with me . She was praising me on every solution that I provided.

  • Q1. 

    Flatten The Multi-Level Linked List

    You are given a multi-level linked list of N nodes, where each node can have two pointers: next and child. Flatten this multi-level linked list into a singly linked lis...

  • Ans. 

    Flatten a multi-level linked list into a singly linked list and return the head of the flattened list.

    • Traverse the linked list in level order

    • Use a stack to keep track of nodes with child pointers

    • Merge the child nodes into the main list

  • Answered by AI
  • Q2. 

    The Celebrity Problem

    Imagine there are 'N' people at a party, each assigned a unique ID from 0 to N-1. A celebrity at the party is a person who is known by everyone but knows no one else.

    Problem Statem...

  • Ans. 

    Identify the celebrity at a party where one person knows everyone but is not known by anyone.

    • Use a two-pointer approach to eliminate non-celebrities.

    • Start with two pointers at the beginning and end, move them based on 'knows' results.

    • If A knows B, A cannot be the celebrity; move A pointer. If A does not know B, B cannot be the celebrity; move B pointer.

    • Repeat until only one person remains, check if this person is known...

  • Answered by AI
Round 3 - Video Call 

(1 Question)

Round duration - 35 minutes
Round difficulty - Easy

This was an interview round ( technical round) that was held on video-call and a coding platform was also shared. The interviewer was very friendly with me . She was praising me on every solution that I provided.

  • Q1. 

    Design a HashSet

    Create a HashSet data structure without using any built-in hash table libraries.

    Functions Description:

    1) Constructor: Initializes the data members as required.
    
    2) add(value): Inserts...
  • Ans. 

    Design a HashSet data structure with add, contains, and remove functions.

    • Implement a HashSet using an array of linked lists to handle collisions.

    • Use a hash function to determine the index in the array for each element.

    • For add function, check if the element already exists before inserting.

    • For contains function, search for the element in the corresponding linked list.

    • For remove function, find and remove the element from ...

  • Answered by AI
Round 4 - HR 

Round duration - 20 minutes
Round difficulty - Easy

Online HR+Technical Round .

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - Intern in HyderabadEligibility criteriaNo criteriaGoldman Sachs interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, Database, System Design, Operating Systemsmajor data structure topics like Arrays, Stacks, Queues, Linked List, Trees, Graphs, backtracking, Dynamic Programming. After reading each topic, I tried to practice maximum questions on the concerned topic from Coding Ninjas, geeksforgeeks, Hackerrank and when stuck on a question, I preferred watching solution videos provided by Coding Ninjas.Time required to prepare for the interview - 5 monthsInterview preparation tips for other job seekers

Tip 1 : Practice DP based questions as much as you can. Also, be confident during the interview about your solution. For practice, you can prefer Coding Ninjas and Geeks For Geeks.
Tip 2 : They do not judge you upon the number of internships you have done or the number of projects you have made. A single ,good-quality project is sufficient, provided you have in-depth knowledge about it. What matters to them is how efficient learner you are, how good is your problem-solving skill and also how confident you are with your answers. 
Tip 3 : Practice topic -wise questions, participate in lots of coding contests, watch lots of Youtube solutions even after you could solve a question, because you may find a different approach that is efficient than yours and watching video solutions is always a better option than just reading the solution , as it gives a clear and deeper understanding of the logic's . Also pray hard along with your preparation.

Application resume tips for other job seekers

Tip 1 : Keep it short. Mention the academic and professional projects you've done. Add your educational details properly with percentage or CGPA obtained.
Tip 2 : Keep your resume short and clear. Mention your projects and internships with a brief description and year of completion. Mention coding languages are known to you, or other technical skills that you are good at. Do not mention anything that you are not good at. Highlight the topics that you are really good at. 
Tip 3 : Be very honest and figure out only those things in your resume that you really know. Anything extra or unknown may have a negative impact upon your interview if asked by the interviewer.

Final outcome of the interviewSelected

Skills evaluated in this interview

Contribute & help others!
anonymous
You can choose to be anonymous

Fidelity International Interview FAQs

How many rounds are there in Fidelity International Software Developer Intern interview?
Fidelity International interview process usually has 2 rounds. The most common rounds in the Fidelity International interview process are Aptitude Test and Coding Test.

Recently Viewed

JOBS

Browse jobs

Discover jobs you love

COMPANY BENEFITS

KNR Constructions

20 benefits

COMPANY BENEFITS

IRB Infrastructure

60 benefits

COMPANY BENEFITS

Dilip Buildcon

304 benefits

COMPANY BENEFITS

Dilip Buildcon

304 benefits

INTERVIEWS

Havells

No Interviews

INTERVIEWS

Casagrand

No Interviews

INTERVIEWS

Aparna Constructions and Estates

No Interviews

INTERVIEWS

Sutherland Global Services

No Interviews

INTERVIEWS

JP Associates

No Interviews

Tell us how to improve this page.

Fidelity International Software Developer Intern Interview Process

based on 1 interview

Interview experience

5
  
Excellent
View more

Interview Questions from Similar Companies

Goldman Sachs Interview Questions
3.5
 • 408 Interviews
Morgan Stanley Interview Questions
3.7
 • 308 Interviews
Morningstar Interview Questions
3.9
 • 241 Interviews
FactSet Interview Questions
3.9
 • 208 Interviews
Apex Group Interview Questions
2.7
 • 132 Interviews
Kotak Securities Interview Questions
3.6
 • 116 Interviews
Blackrock Interview Questions
3.8
 • 100 Interviews
Mr Cooper Interview Questions
4.1
 • 81 Interviews
View all
Senior Programmer Analyst
460 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Programmer Analyst
320 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Technical Specialist
226 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Associate
184 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior Test Analyst
157 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare Fidelity International with

Fidelity Investments

4.2
Compare

Blackrock

3.8
Compare

Vanguard

4.1
Compare

State Street Global Advisors

3.8
Compare
Did you find this page helpful?
Yes No
write
Share an Interview
Rate your experience using AmbitionBox
Terrible
Terrible
Poor
Poor
Average
Average
Good
Good
Excellent
Excellent