Odd Even Jump (Hard)You are given an integer array arr. From some starting index, you can make a series of jumps. The (1st, 3rd, 5th, ...) jumps in the series are called odd-numbered jumps, and the (2nd, 4th, 6th, ...) jumps in the series are called even-numbered jumps....Apr 13, 2025·6 min read
Online Stock SpanDesign an algorithm that collects daily price quotes for some stock and returns the span of that stock's price for the current day. The span of the stock's price in one day is the maximum number of consecutive days (starting from that day and going b...Apr 12, 2025·4 min read
Maximum Number of Accepted InvitationsThere are m boys and n girls in a class attending an upcoming party. You are given an m x n integer matrix grid, where grid[i][j] equals 0 or 1. If grid[i][j] == 1, then that means the i<sup>th</sup> boy can invite the j<sup>th</sup> girl to the part...Apr 12, 2025·4 min read
Minimum Knight MovesIn an infinite chess board with coordinates from -infinity to +infinity, you have a knight at square [0, 0]. A knight has 8 possible moves it can make, as illustrated below. Each move is two squares in a cardinal direction, then one square in an orth...Apr 12, 2025·3 min read
Longest Word In DictionaryGiven an array of strings words representing an English Dictionary, return the longest word in words that can be built one character at a time by other words in words. If there is more than one possible answer, return the longest word with the smalle...Apr 12, 2025·3 min read
Maximum Total Explosion RadiiYou're given an array bombs where bombs[i] is the explosion radius of the i-th bomb. You can perform the following operation any number of times: Pick two indices i and j such that their explosion ranges don't overlap. Detonate both bombs at once. ...Apr 12, 2025·4 min read
Longest String ChainYou are given an array of words where each word consists of lowercase English letters. word<sub>A</sub> is a predecessor of word<sub>B</sub> if and only if we can insert exactly one letter anywhere in word<sub>A</sub> without changing the order of th...Apr 12, 2025·8 min read
