Citadel Interview Question: 1. Prefix sum + hashing Why? O(1) lookups under heavy data flow. Examples: Subarray sum divisible by k Longest equal 0/1 subarray Detect arbitrage-like patterns What they care about: Do you understand why equal remainders imply divisible differences?

Skip to content Skip to footer

Community
Jobs
Companies
Salaries
For Employers

Notifications

Citadel

Citadel SWE New Grad interview

Citadel Interview Question

SWE New Grad Interview

1. Prefix sum + hashing Why? O(1) lookups under heavy data flow. Examples: Subarray sum divisible by k Longest equal 0/1 subarray Detect arbitrage-like patterns What they care about: Do you understand why equal remainders imply divisible differences?

Citadel interviews

Citadel

Citadel Interview Question

Want the inside scoop on your own company?

Bowls

Followed companies

Job searches