Jan 27, 2026
You are given an integer n, which indicates that there are n courses labeled from 1 to n. You are also given an array relations where relations[i] = [prevCoursei, nextCoursei],...
leetcodehardgraphtopological-sortdfsdynamic-programming
Jan 26, 2026
Given an array of positive integers nums and a positive integer target, return the minimal length of a subarray whose sum is greater than or equal to target. If there...
leetcodemediumarraysliding-windowbinary-searchprefix-sum
Jan 26, 2026
Given an integer array nums and an integer k, return the length of the shortest non-empty subarray of nums with a sum of at least k. If there is no...
leetcodehardarraysliding-windowdequeprefix-summonotonic-deque
Jan 26, 2026
Given an integer array nums and an integer val, remove all occurrences of val in nums in-place. The order of the elements may be changed. Then return the number of...
leetcodeeasyarraytwo-pointers
Jan 25, 2026
You are given a 2D array of integers envelopes where envelopes[i] = [wi, hi] represents the width and the height of an envelope.
leetcodemediumarraydynamic-programmingbinary-searchsorting
Jan 25, 2026
You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed. All houses at this place are arranged in a...
leetcodemediumarraydynamic-programming
Jan 24, 2026
Design your implementation of the circular queue. The circular queue is a linear data structure in which the operations are performed based on FIFO (First In First Out) principle and...
leetcodemediumarraylinked-listdesignqueue
Jan 23, 2026
Given a list of folders folder, return the folders after removing all sub-folders in those folders. You may return the answer in any order.
leetcodemediumarraystringtriesorting
Jan 22, 2026
You are given a 2D integer array orders, where orders[i] = [price_i, amount_i, orderType_i] denotes that amount_i orders have been placed of type orderType_i at price price_i. The orderType_i is:...
leetcodemediumarrayheappriority-queuesimulation
Jan 21, 2026
You are given an m x n integer array grid. There is a robot initially located at the top-left corner (i.e., grid[0][0]). The robot tries to move to the bottom-right...
leetcodemediumarraydynamic-programmingmatrix