Graviton

Role: Quantitative Analyst (New Grad)

College: BTech in Computer Science from a Tier-I College in India

Interview Date: May 2025

Interview Type: Off-Campus

Result: Rejected

Difficulty: Hard

Rounds: Introductory Call + 3 Technical Rounds

Topics Asked: Problem Solving (Data Structures & Algorithms), Project Discussion, Logical Thinking, Mathematical Puzzles

Experience:

The candidate applied for a Quantitative Analyst position at Graviton Research Capital LLP and was rejected after a rigorous interview process.

Introductory Call: Not detailed, but the first stage of the process.

Technical Round 1 (Problem Solving):

• Q1: Find the maximum value of A[i] + A[j] + A[k] in an array such that A[i] < A[j] < A[k] and i < j < k. (Hard, Data Structures & Algorithms)
• Q2: Leetcode - Domino and Tromino Tiling. (Hard, Data Structures & Algorithms)

Technical Round 2 (Project + Logical Thinking): Involved a discussion on the candidate's Summer Internship Project and logical thinking questions.

Technical Round 3 (Project + Mathematical Puzzles):

• Q1: Given an array of size 200 with whole numbers (≤ 200, possibly with duplicates), Prove: There exists at least one subset whose sum is divisible by 200. (Mathematical Puzzle)
• Q2: A collection initially has numbers from 1 to 50 (1,2,3....,50). In each operation, pick any two numbers a and b, remove them, and insert |a - b|. This is done 49 times until one number remains. Question: What are all possible final states of the collection? (Mathematical Puzzle)

Other mathematical puzzles mentioned in relation to Graviton interviews include "Maximum Non-Attacking Chess Pieces" and "Soldiers Not Being Watched".