Data Structures & Algorithms

Compute the product of array elements except self using left and right product arrays.

Sort 0, 1, and 2 in place using quicksort, bucket sort, or the move-zeroes idea.

Search a matrix whose rows and columns are both sorted, starting from the top-right corner.

Use the Fibonacci recurrence to calculate the number of ways a frog can climb the stairs.

Derive the number of ways to climb stairs when each jump may cover any number of steps using a recurrence and a pattern.

Record three implementations of the Fibonacci sequence: recursion, memoization, and dynamic programming.

Count the number of 1 bits in a 32-bit binary representation by shifting through each bit.

Calculate a floating-point number raised to an integer power using repeated multiplication, including negative exponents.

Enumerate integers and use modulo operations to count occurrences of digit 1 in decimal representations from 1 to n.

LeetCode notes on the Maximum Product Subarray problem.