My website

Prompt: Five silent philosophers sit at a round table with bowls of spaghetti. Forks are placed between each pair of adjacent philosophers. [Read More]

Prompt: You are climbing a staircase. It takes n steps to reach the top. Each time you can either climb 1 or 2 steps at a time. How many ways can you climb to the top? [Read More]

Prompt: Given a list of integers, we want to find a subarray of integers where the product of all integers in the subarray is the max product compared to all other products from other subarrays. [Read More]

Prompt: Given a list of integers, [a0 , a1 , a2 , … , an ], we want to sort the list such that it satisfies a0 < a1 > a2 < a3 > a4 < … , an . [Read More]

Prompt: Given an integer n, return the least number of perfect squares that sum up to n. [Read More]