Frontend Algorithms 75 Interview Curriculum

Implement a function that checks whether an array contains any duplicate numbers.

Implement a function that computes the maximum profit obtainable from one buy and one sell of a stock.

Move all zeroes to the end of an array in place while keeping the non-zero elements in their original order.

Implement a function that counts the number of unique paths a robot can take from the top-left to bottom-right of an m by n grid.

Implement a function that decides whether a string can be broken into a sequence of words from a given dictionary.

Return an array where each entry is the product of every element except the one at that index, without division and in O(n).

Implement a function that locates a target integer in a sorted array that has been rotated at an unknown pivot.

Rotate an n×n matrix 90 degrees clockwise and return the result as a new array.

Implement a function that finds the contiguous subarray with the largest product, handling negatives and zeros.

Implement a function that finds the contiguous subarray with the largest sum.

Implement a function that finds the maximum amount of water that can be trapped between two walls.

Implement a function that finds the minimum value in a sorted array that has been rotated at an unknown pivot.

Convert a Roman numeral string to its integer value, handling subtractive pairs like IV and IX.

Implement a function that counts how many ways a digit string can be decoded into letters using a 1 to 26 mapping.

Implement a function that finds the longest substring made of one repeated character allowing up to k swaps.