ppagesxyzPlatform
JobsStudy GuidesFreeInterview Vault2.8k+Research & BlogCompaniesResume Review
Post a Job
ppagesxyzInstitutional Platform

The independent career intelligence, university-grade curriculum, and interview preparation resource for quantitative researchers, algorithmic traders, and high-performance software engineers.

Editorial BoardContact SupportExplore Free Curriculums →

Career Preparation

  • Interview Question Vault (2.8k+)
  • Probability Puzzles & Proofs
  • Market & Financial Engineering
  • Trading Brain Teasers
  • Quant Resume Review Service

Study Curriculums

  • Quantitative Finance Guide
  • Artificial Intelligence Track
  • Machine Learning Track
  • Data Science Curriculum
  • Low-Latency Software Engineering

Technical Research

  • Rust vs C++ in HFT Systems
  • Alternative Data & ML Alpha
  • RL Execution & Liquidity
  • Garden Leave & Non-Competes
  • Quant Salary & Bonus Guide
  • All Technical Articles & Guides

Firm Directory

  • Company Directory (450+)
  • Proprietary Trading Desks
  • Technology Organizations
  • Quant Startups & Market Makers
  • Post a Verified Opening

Trust & Legal

  • About & Technical Editorial Board
  • Editorial & Sourcing Policy
  • Privacy Policy (GDPR)
  • Terms of Use
  • Contact, Corrections & Privacy

Publisher & Editorial Standards

pagesxyz Media operates from Helsinki, Finland in compliance with European Union digital services standards. All curriculum tracks and worked solutions are authored and vetted by credentialed quantitative researchers and low-latency systems engineers.

Responsible Advertising & Disclosures

Advertising served through Google AdSense adheres strictly to Google Publisher Policies and EU GDPR consent frameworks. Display advertisements are clearly identified and do not influence curriculum recommendations or editorial rankings.

© 2026 pagesxyz Media. All rights reserved. Registered in Helsinki, Finland (EU).

Privacy Policy•Terms of Use•Editorial Guidelines•Contact

Quantitative Finance

Software EngineeringData ScienceMachine LearningArtificial Intelligence

Quantitative Finance

Software EngineeringData ScienceMachine LearningArtificial Intelligence
Advertisementpagesxyz Sponsor Network
346 questions
346 questions
You have a 3-litre jug and a 5-litre jug with unlimited water. How do you measure exactly 4 litres?Easy
You have a 3-litre jug and a 5-litre jug with unlimited water. How do you measure exactly 4 litres?
Easy·
Why are manhole covers round rather than square?Easy
Why are manhole covers round rather than square?
Easy·
A single lily pad doubles in size every day. It takes 48 days to cover the entire lake. On which day was the lake half-covered?Easy
A single lily pad doubles in size every day. It takes 48 days to cover the entire lake. On which day was the lake half-covered?
Easy·
A blind man has 10 black socks and 10 navy blue socks in a drawer. How many must he pull out to guarantee a matching pair?Easy
A blind man has 10 black socks and 10 navy blue socks in a drawer. How many must he pull out to guarantee a matching pair?
Easy·
You have two ropes, each burns for exactly 1 hour but not uniformly. How do you measure exactly 45 minutes?Easy
You have two ropes, each burns for exactly 1 hour but not uniformly. How do you measure exactly 45 minutes?
Easy·
You have 10 people in a room. How many total handshakes if they all shake hands?Easy
You have 10 people in a room. How many total handshakes if they all shake hands?
Easy·
You have a 3 gallon jug and 5 gallon jug, how do you measure out exactly 4 gallons?Easy
You have a 3 gallon jug and 5 gallon jug, how do you measure out exactly 4 gallons?
Easy·
You're in a room with three light switches, each controls one of three bulbs in the next room. All lights are off. You can only inspect the other room once. How do you determine which switch controls which bulb?Easy
You're in a room with three light switches, each controls one of three bulbs in the next room. All lights are off. You can only inspect the other room once. How do you determine which switch controls which bulb?
Easy·
Determine the angle (in degrees) between the minute and hour hands at 9:45 PM on a standard clock.EasyVirtu
Determine the angle (in degrees) between the minute and hour hands at 9:45 PM on a standard clock.
Easy·Virtu
Given a conventional clock with an hour and a minute hand that align perfectly at 12:00 midnight, when will they coincide next? How many times a day will they overlap?EasyVirtu, Jane Street, Akuna Capital, Citadel Securities, DRW, Da Vinci Trading, Flow Traders, IMC, Maven Securities, SIG
Given a conventional clock with an hour and a minute hand that align perfectly at 12:00 midnight, when will they coincide next? How many times a day will they overlap?
Easy·Virtu, Jane Street, Akuna Capital, Citadel Securities, DRW, Da Vinci Trading, Flow Traders, IMC, Maven Securities, SIG
How many times does the digit 999 appear when counting from 111 to 100010001000?EasyAkuna Capital
How many times does the digit 999 appear when counting from 111 to 100010001000?
Easy·Akuna Capital
In a secret alphabet system, each letter of a word changed. When the word MAKO is encrypted using this system, it becomes NZLN.
What is the encrypted form of the word OFFER?
EasyMako Trading
In a secret alphabet system, each letter of a word changed. When the word MAKO is encrypted using this system, it becomes NZLN.
What is the encrypted form of the word OFFER?
Easy·Mako Trading
Real Madrid and Barcelona face off in the El Clasico. You decide to sports bet on this game. The site you're using offers you 2:12:12:1 odds for Real Madrid to win (i.e. you receive $2\$2$2 profit per dollar you bet), 3:13:13:1 odds for Barcelona to win, and 10:110:110:1 odds for a tie. The site only allows you to bet in full dollar increments. As an astute trader, you realize there is an arbitrage here. Your goal is to make the same amount of money, regardless of the outcome of the game. All profits that you can obtain are integer multiples of some positive constant ccc . Find ccc .Easy
Real Madrid and Barcelona face off in the El Clasico. You decide to sports bet on this game. The site you're using offers you 2:12:12:1 odds for Real Madrid to win (i.e. you receive $2\$2$2 profit per dollar you bet), 3:13:13:1 odds for Barcelona to win, and 10:110:110:1 odds for a tie. The site only allows you to bet in full dollar increments. As an astute trader, you realize there is an arbitrage here. Your goal is to make the same amount of money, regardless of the outcome of the game. All profits that you can obtain are integer multiples of some positive constant ccc . Find ccc .
Easy·
Tupac sees two banks: BofA and LigmA. BofA and LigmA offer annual interest rates of r1r_1r1​ and r2r_2r2​ , respectively, where 0<r1<r20 < r_1 < r_20<r1​<r2​ . Assuming Tupac starts with $0\$0$0 , has a borrowing limit of $1\$1$1 , and interest compounds continuously, find the most amount of money he is guaranteed to make in 111 year when ri=0.03ir_i = 0.03iri​=0.03i , i=1,2i = 1,2i=1,2 . Round to the nearest cent. If there is no strategy that guarantees Tupac to make money, answer −1-1−1 .Easy
Tupac sees two banks: BofA and LigmA. BofA and LigmA offer annual interest rates of r1r_1r1​ and r2r_2r2​ , respectively, where 0<r1<r20 < r_1 < r_20<r1​<r2​ . Assuming Tupac starts with $0\$0$0 , has a borrowing limit of $1\$1$1 , and interest compounds continuously, find the most amount of money he is guaranteed to make in 111 year when ri=0.03ir_i = 0.03iri​=0.03i , i=1,2i = 1,2i=1,2 . Round to the nearest cent. If there is no strategy that guarantees Tupac to make money, answer −1-1−1 .
Easy·
In a room filled with 100 politicians, you know two things for certain:
At least one politician is honest.
In any given pair of politicians, at least one is dishonest.
Question: How many honest politicians can there be in the room, assuming every politician is either honest or dishonest?
Easy
In a room filled with 100 politicians, you know two things for certain:
At least one politician is honest.
In any given pair of politicians, at least one is dishonest.
Question: How many honest politicians can there be in the room, assuming every politician is either honest or dishonest?
Easy·
Find the smallest multiple of 666666 that is at least 60,00060,00060,000 .Easy
Find the smallest multiple of 666666 that is at least 60,00060,00060,000 .
Easy·
Find the smallest multiple of 666666 that is at least 600,000600,000600,000 .Easy
Find the smallest multiple of 666666 that is at least 600,000600,000600,000 .
Easy·
Fix integers m<nm < nm<n . Compute ∑i=m+1ni\displaystyle \sum_{i=m+1}^n ii=m+1∑n​i when m=40m = 40m=40 and n=100n = 100n=100 .Easy
Fix integers m<nm < nm<n . Compute ∑i=m+1ni\displaystyle \sum_{i=m+1}^n ii=m+1∑n​i when m=40m = 40m=40 and n=100n = 100n=100 .
Easy·
Claire and Jeff play 101010 rounds of Rock (R) Paper (P) Scissors (S). It is known that each round had a winner. Jeff played R, P, and S, respectively, 3,1,3,1,3,1, and 666 times, while Claire played R, P, and S, respectively, 2,4,2,4,2,4, and 444 times. How many wins did Jeff have? If it is not possible to know the answer for sure, answer −1-1−1 .Easy
Claire and Jeff play 101010 rounds of Rock (R) Paper (P) Scissors (S). It is known that each round had a winner. Jeff played R, P, and S, respectively, 3,1,3,1,3,1, and 666 times, while Claire played R, P, and S, respectively, 2,4,2,4,2,4, and 444 times. How many wins did Jeff have? If it is not possible to know the answer for sure, answer −1-1−1 .
Easy·
A lily pad in a lake doubles in area each day. Assume that the initial area of a lily pad is one square foot. If a lake initially has 555 lily pads in it, how many days must pass for the lily pads to cover a 512051205120 square foot lake? Assume that the regions each lily pad covers are disjoint and fit to the shape of the pond.Easy
A lily pad in a lake doubles in area each day. Assume that the initial area of a lily pad is one square foot. If a lake initially has 555 lily pads in it, how many days must pass for the lily pads to cover a 512051205120 square foot lake? Assume that the regions each lily pad covers are disjoint and fit to the shape of the pond.
Easy·
Let FnF_nFn​ be the nnn th Fibonacci number, where F0=0,F1=1,F_0 = 0, F_1 = 1,F0​=0,F1​=1, and Fn=Fn−1+Fn−2F_{n} = F_{n-1} + F_{n-2}Fn​=Fn−1​+Fn−2​ for n≥2n \geq 2n≥2 . If it exists, find lim⁡n→∞Fn+1Fn\displaystyle \lim_{n \rightarrow \infty} \frac{F_{n+1}}{F_n}n→∞lim​Fn​Fn+1​​ to the nearest thousandth. Otherwise, report −1-1−1 .Easy
Let FnF_nFn​ be the nnn th Fibonacci number, where F0=0,F1=1,F_0 = 0, F_1 = 1,F0​=0,F1​=1, and Fn=Fn−1+Fn−2F_{n} = F_{n-1} + F_{n-2}Fn​=Fn−1​+Fn−2​ for n≥2n \geq 2n≥2 . If it exists, find lim⁡n→∞Fn+1Fn\displaystyle \lim_{n \rightarrow \infty} \frac{F_{n+1}}{F_n}n→∞lim​Fn​Fn+1​​ to the nearest thousandth. Otherwise, report −1-1−1 .
Easy·
You have nnn bags. If bags can't be placed inside one another, what is the minimum number of marbles needed to ensure there are a different number of marbles in each bag? Report the answer when n=15n = 15n=15 .Easy
You have nnn bags. If bags can't be placed inside one another, what is the minimum number of marbles needed to ensure there are a different number of marbles in each bag? Report the answer when n=15n = 15n=15 .
Easy·
There exists a magical savanna with an odd number nnn lions and 111 gazelles. The lions are hungry and want to eat the gazelles. However, if a lion consumes a gazelle, it will transform into a gazelle itself. While the lions are hungry, they do not want to be eaten by other lions. How many times are gazelles consumed when n=15n = 15n=15 ?Easy
There exists a magical savanna with an odd number nnn lions and 111 gazelles. The lions are hungry and want to eat the gazelles. However, if a lion consumes a gazelle, it will transform into a gazelle itself. While the lions are hungry, they do not want to be eaten by other lions. How many times are gazelles consumed when n=15n = 15n=15 ?
Easy·
There exists a magical savanna with an even number nnn lions and a nonzero number mmm gazelles. The lions are hungry and want to eat the gazelles. However, if a lion consumes a gazelle, it will transform into a gazelle itself. While the lions are hungry, they do not want to be eaten by other lions. Out of these mmm gazelles, how many are consumed?Easy
There exists a magical savanna with an even number nnn lions and a nonzero number mmm gazelles. The lions are hungry and want to eat the gazelles. However, if a lion consumes a gazelle, it will transform into a gazelle itself. While the lions are hungry, they do not want to be eaten by other lions. Out of these mmm gazelles, how many are consumed?
Easy·
What is the (clockwise directional) angle from the hour hand to the minute hand of an analog clock when the time is 12:3512:3512:35 ? Provide your answer in degrees.Easy
What is the (clockwise directional) angle from the hour hand to the minute hand of an analog clock when the time is 12:3512:3512:35 ? Provide your answer in degrees.
Easy·
What is the angle between the minute and hour hands of an analog clock when the time is 3:253:253:25 ? Provide your answer in degreesEasy
What is the angle between the minute and hour hands of an analog clock when the time is 3:253:253:25 ? Provide your answer in degrees
Easy·
How many degrees from the vertical do the minute and hour hands overlap for the first time on the face of an analog clock? Enter your answer as a fraction.Easy
How many degrees from the vertical do the minute and hour hands overlap for the first time on the face of an analog clock? Enter your answer as a fraction.
Easy·
Consider a cube with side length nnn that's cut into n3n^3n3 1×1×11 \times 1 \times 11×1×1 cubes. How many m×m×mm \times m \times mm×m×m cubes, where 1≤m≤n1 \leq m \leq n1≤m≤n , can be selected completely inside the larger cube? Report the answer when n=6n = 6n=6 and m=3m = 3m=3 .Easy
Consider a cube with side length nnn that's cut into n3n^3n3 1×1×11 \times 1 \times 11×1×1 cubes. How many m×m×mm \times m \times mm×m×m cubes, where 1≤m≤n1 \leq m \leq n1≤m≤n , can be selected completely inside the larger cube? Report the answer when n=6n = 6n=6 and m=3m = 3m=3 .
Easy·
You have two candles of the same length, but the candles contain wax that melts at different rates. Assume the wax is uniform throughout the candle so that the length decreases at a constant rate. One of the candles melts in nnn hours, while the other candle melts in m=anm=anm=an hours, where a>1a > 1a>1 . After how many hours will the second candle be kkk times the length of the first candle, where k≥1k \geq 1k≥1 ? Report the answer when n=30,k=2,n = 30, k = 2,n=30,k=2, and a=2a = 2a=2 .Easy
You have two candles of the same length, but the candles contain wax that melts at different rates. Assume the wax is uniform throughout the candle so that the length decreases at a constant rate. One of the candles melts in nnn hours, while the other candle melts in m=anm=anm=an hours, where a>1a > 1a>1 . After how many hours will the second candle be kkk times the length of the first candle, where k≥1k \geq 1k≥1 ? Report the answer when n=30,k=2,n = 30, k = 2,n=30,k=2, and a=2a = 2a=2 .
Easy·
A man went on a trip to see Niagara Falls. He got double-dared to swim horizontally from one side of the falls to the other, spanning zzz meters. He knows that he can swim horizontally at a rate of x msx ~ \frac{m}{s}x sm​ . The current, which moves directly downstream, carries him down the falls at a rate of y msy~\frac{m}{s}y sm​ . How far away must the cliff of the falls be in order for him to make it to the other side? Provide your answer in the case where x=5 msx=5 ~\frac{m}{s}x=5 sm​ , y=20 msy=20 ~\frac{m}{s}y=20 sm​ , and z=500 mz=500~mz=500 mEasy
A man went on a trip to see Niagara Falls. He got double-dared to swim horizontally from one side of the falls to the other, spanning zzz meters. He knows that he can swim horizontally at a rate of x msx ~ \frac{m}{s}x sm​ . The current, which moves directly downstream, carries him down the falls at a rate of y msy~\frac{m}{s}y sm​ . How far away must the cliff of the falls be in order for him to make it to the other side? Provide your answer in the case where x=5 msx=5 ~\frac{m}{s}x=5 sm​ , y=20 msy=20 ~\frac{m}{s}y=20 sm​ , and z=500 mz=500~mz=500 m
Easy·
Loading more...