Filter interviews by
I applied via Naukri.com and was interviewed before Jul 2021. There were 3 interview rounds.
RPA stands for Robotic Process Automation.
RPA is a technology that uses software robots to automate repetitive tasks.
It can be used to automate tasks such as data entry, invoice processing, and customer service.
RPA can help increase efficiency, reduce errors, and free up employees to focus on more complex tasks.
Popular RPA tools include UiPath, Automation Anywhere, and Blue Prism.
Project timeline can be decided based on project scope, resources, team size, complexity, and risk factors.
Define project scope and deliverables
Assess available resources and team size
Consider project complexity and risk factors
Create a detailed project plan with milestones and deadlines
Regularly review and adjust the timeline as needed
Jira Story is a feature or functionality that needs to be developed and delivered in an Agile project using Jira software.
Jira Story is a user story that describes a feature or functionality from the user's perspective.
It is written in a specific format, including a title, description, acceptance criteria, and estimation points.
Jira Story is used to track the progress of the development team and ensure that the project...
I appeared for an interview in Jul 2024.
Static function is a function that can only be accessed within the same file, while a static variable is a variable that retains its value between function calls.
Static function is declared using the 'static' keyword before the return type, limiting its scope to the file it is defined in.
Static variable is declared using the 'static' keyword before the variable type, retaining its value between function calls.
Example o...
Synchronization technique is a method used to control access to shared resources in a multi-threaded environment.
Synchronization techniques prevent race conditions and ensure data consistency
Common synchronization techniques include locks, semaphores, and monitors
Examples include using synchronized keyword in Java or mutex in C++
Add an element to a linked list.
Not done yet ,test on tomorrow
The connect the rope problem involves connecting ropes of different lengths to minimize the cost.
Sort the ropes by length
Connect the two shortest ropes at a time
Repeat the process until all ropes are connected
I applied via Campus Placement and was interviewed in Apr 2024. There were 2 interview rounds.
Basic Arithmetic Aptitude , Computer Application and SQL
A fitness tracking application to monitor and track user's physical activities and progress.
Include features like tracking steps, calories burned, distance traveled, and workout sessions.
Allow users to set goals, view progress charts, and receive notifications for reminders.
Integrate with wearable devices like Fitbit or Apple Watch for real-time data syncing.
Provide social sharing options to motivate users and compete ...
The test consisted of mcqs and coding questions
A linked list is a data structure where each element points to the next element in the sequence.
Consists of nodes connected by pointers
Can be singly linked (each node points to the next) or doubly linked (each node points to the next and previous)
Allows for dynamic size and efficient insertion/deletion operations
Hacker earth problem
I appeared for an interview in Feb 2025.
Duration 3 hours topics medium level coding from hackerearth
Aptitude and 3 coding questions were aksed
Asked us to draw use case diagrams
I appeared for an interview before Dec 2020.
Round duration - 90 minutes
Round difficulty - Medium
The round consisted of 3 coding Questions and 20 Technical MCQs.
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...
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
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
The first line cont...
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.
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) + ....
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
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.
Given an integer array arr
of size 'N' containing only 0s, 1s, and 2s, write an algorithm to sort the array.
The first line contains an integer 'T' representing the n...
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.
Round duration - 20 Minutes
Round difficulty - Easy
Tip 1 : Do Atleast 2 Projects
Tip 2 : Be Strong in what you have in your resume
Tip 3 : Be Confident and Polite
Tip 1 : Keep it Short to one or two pages
Tip 2 : Keep it standout..as it is what projects you uniquely.
posted on 14 Feb 2024
Some of the top questions asked at the Fidelity International Software Developer interview -
based on 5 reviews
Rating in categories
Senior Programmer Analyst
460
salaries
| ₹9 L/yr - ₹30 L/yr |
Programmer Analyst
317
salaries
| ₹7 L/yr - ₹19 L/yr |
Technical Specialist
219
salaries
| ₹16.8 L/yr - ₹45 L/yr |
Associate
187
salaries
| ₹3 L/yr - ₹7 L/yr |
Senior Associate
167
salaries
| ₹4.8 L/yr - ₹12 L/yr |
Fidelity Investments
Apex Group
Morningstar
Kroll