'Coding has over 700 languages', '67% of programming jobs aren’t in the technology industry', 'Coding is behind almost everything that is powered by electricity'
Fidelity International interview experience Real time questions & tips from candidates to crack your interview
Full Stack Engineering Intern
Fidelity International
upvote
share-icon
3 rounds | 3 Coding problems
Interview preparation journey
expand-icon
Preparation
Duration: 1 month
Topics: Data structures, Algorithms, Basics of databases, Puzzles, OOPS
Tip
Tip

Tip 1 : Master all the OOP concepts
Tip 2 : Be very confident while giving the interview
Tip 3 : Be very true in the resume

Application process
Where: Campus
Eligibility: No criteria
Resume Tip
Resume tip

Tip 1 : Mention only those thing which you have done honestly in resume.
Tip 2 : Keep it simple and one paged.

Interview rounds
01
Round
Easy
Online Coding Interview
Duration120 minutes
Interview date29 Oct 2020
Coding problem2

This round consisted of 4 sections, namely,
1. English
2. Technical MCQs
3. Coding
4. Algorithms

1. English: This section consisted of 10 questions in all(Time limit was 15min). 5 questions were based on a given passage which were of moderate level. Remaining questions were on vocabulary, error correction and phrases which were easy to moderate.

2. Technical MCQs: This section consisted of 20 technical questions(Time limit was 30min). Questions were mainly on simple SQL commands, Tracing the output of recursive or iterative code snippet, basics of networking(components of IP address), Output of a given algorithm, output of a given code snippet. This round was of moderate level.

3. Coding: In this section we were supposed to solve two coding questions in 60min. First question was simple which was based on basic operations on a 2D matrix. The second question was of moderate level. It was one of the well known problems, 'The longest increasing substring'.

4. Algorithm: This section had two questions(Time limit was 15min). We were required to design a suitable algorithm and type that for the given problem statement. The questions were
a. Add two polynomials as linked lists(Problem URL: shorturl.at/dPVX5)
b. Conversion of an infix expression to postfix(Problem URL: shorturl.at/ltDG6)
we were required to write algorithms for the above problems

This online screening test was conducted on 29th of October from 4PM to 6PM. It was conducted on HirePro platform and it was audio and video proctored. Switching tabs were not allowed.

1. Sorted Matrix
Moderate
25m average time
85% success
0/80
Asked in companies
MicrosoftAmazonPaytm (One97 Communications Limited)

You are given an N x N matrix 'MAT' of positive integers, where every row and column is sorted in non-decreasing order.

Your task is to return a list containing all ele...

View more
Try solving now
2. Longest increasing subsequence
Moderate
30m average time
65% success
0/80
Asked in companies
GooglePaytm (One97 Communications Limited)HCL Technologies

For a given array with N elements, you need to find the length of the longest subsequence from the array such that all the elements of the subsequence are sorted in strictly increasing order.

View more
Problem approach

Step 1: Brute did not work for me.
Step 2: DP solution was expected.

Try solving now
02
Round
Medium
Video Call
Duration30 minutes
Interview date3 Nov 2020
Coding problem1

This round was purely technical. It was scheduled for me from 9AM. Most questions focused on OOP in C++/java.
First I was asked to explain Dynamic binding in OOP with a suitable code snippet. Then a code was shown by the interviewer and i was asked to verify if it was an example of static or dynamic binding. 
Then, I was asked about synchronization in java and to explain various methods to bring in synchronization in a multi-threaded program in java.
Then i was asked about rand() function in C++. I was asked to write a suitable code to demonstrate rand() function and explain srand() too.
I was then asked to solve the problem: Find the second largest element in an unsorted array without sorting
Then i was asked to explain about a project which i had done. 
Next I was asked few questions on basics of HTML and CSS.

1. Second largest element in the array
Easy
15m average time
80% success
0/40
Asked in companies
AmazonTech MahindraOracle

You have been given an array/list 'ARR' of integers. Your task is to find the second largest element present in the 'ARR'.

Note:
View more
Problem approach

I said that i would find the largest element using brute force, delete it and again find the largest element to find the second largest element.

Try solving now
03
Round
Easy
HR Round
Duration15 minutes
Interview date3 Nov 2020
Coding problem0

This round lasted for about 15min from 11AM. The interviewer was very friendly and encouraging.
Q1: Tell me about yourself.
Q2: Your views on Music as profession(As i mentioned that I am under formal Carnatic music training).
Q3: Questions on achievements mentioned on my resume.
Q4: Tell me about your project journey briefly from beginning to the end.
Q5: What were the challenges you faced and how you overcame that in a project.
Q6: Tell me a scenario where you were able to showcase your leadership skills.
Q7: Tell me a scenario where you did not wanted to do something in a project as a team, but had to do it.
Q8: Tell me scenario where you did not know a particular concept, but had to learn it to be deployed in a project.
Q8: What do you know about Fidelity Investments.

Join the Discussion
1 reply
profile
10 Oct 2021

How much package does the company provide for this??

0 upvotes
0 replies
Reply
Similar interview experiences
company logo
Data Engineer-Intern
3 rounds | 6 problems
Interviewed by Fidelity International
884 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 15 problems
Interviewed by Fidelity International
376 views
0 comments
0 upvotes
company logo
SDE - Intern
3 rounds | 4 problems
Interviewed by Fidelity International
0 views
0 comments
0 upvotes
company logo
Technology Consultant - Associate
2 rounds | 4 problems
Interviewed by Fidelity International
141 views
0 comments
0 upvotes