Fidelity Technical Intern(On Campus, India)
Summary
I cleared the OA and technical interview rounds for a Technical Intern position at Fidelity in India, but was rejected after the HR round.
Full Experience
OA: Aptitude, Core CS MCQ, DSA question on prefix + hashmap pattern: Count distinct pairs summing to (0 mod 60) in an array. -Verdict: Cleared
Technical Interview: Core Java: what is super class of all classes and what are their methods, Internal working of HashMap(overriding equals and hashcode), difference between Thread.sleep() and wait(), what is a spring bean and how to create one. Scopes of spring beans and one example for a prototype bean. DSA: Minimum Path Sum. -Verdict: Cleared
HR Round: Standard tell me about yourself, would i prefer mentor or i would prefer to work without one. Why would i want to work in fidelity etc. -Verdict: Rejected
Interview Questions (2)
Count Pairs with Sum Divisible by 60
Given an array of integers, count the number of distinct pairs (i, j) such that i < j and (arr[i] + arr[j]) % 60 == 0.
Minimum Path Sum
Given a 2D grid of non‑negative integers, find a path from the top‑left corner to the bottom‑right corner that minimizes the sum of all numbers along its path. You may only move either down or right at any point in time.