[LeetCode] 962. Maximum Width Ramp A ramp in an integer array nums is a pair (i, j) for which i < j and nums[i] <= nums[j]. The width of such a ramp is j - i. Given an integer array nums, return the maximum width of a ramp i 2024-10-10 #leetcode #java #array #stack #monotonic stack
[LeetCode] 2491. Divide Players Into Teams of Equal Skill You are given a positive integer array skill of even length n where skill[i] denotes the skill of the ith player. Divide the players into n / 2 teams of size 2 such that the total skill of each t 2024-10-04 #leetcode #java #array #two pointer
[LeetCode] 1497. Check If Array Pairs Are Divisible by k Given an array of integers arr of even length n and an integer k. We want to divide the array into exactly n / 2 pairs such that the sum of each pair is divisible by k. Return true If you can fin 2024-10-01 #leetcode #java #array #hashmap #math
[LeetCode] 641. Design Circular Deque Design your implementation of the circular double-ended queue (deque). Implement the MyCircularDeque class:MyCircularDeque(int k) Initializes the deque with a maximum size of k.boolean insertFront() A 2024-09-28 #leetcode #java #linked list #design #queue
[LeetCode] 2414. Length of the Longest Alphabetical Continuous Substring An alphabetical continuous string is a string consisting of consecutive letters in the alphabet. In other words, it is any substring of the string “abcdefghijklmnopqrstuvwxyz”. For example, “abc” is a 2024-09-19 #leetcode #java #two pointer #string
[LeetCode] 884. Uncommon Words from Two Sentences A sentence is a string of single-space separated words where each word consists only of lowercase letters. A word is uncommon if it appears exactly once in one of the sentences, and does not appear in 2024-09-17 #leetcode #java #hashmap #string
[LeetCode] 2419. Longest Subarray With Maximum Bitwise AND You are given an integer array nums of size n. Consider a non-empty subarray from nums that has the maximum possible bitwise AND. In other words, let k be the maximum value of the bitwise AND of any s 2024-09-14 #leetcode #java #array #bit manipulation
[LeetCode] 2326. Spiral Matrix IV You are given two integers m and n, which represent the dimensions of a matrix. You are also given the head of a linked list of integers. Generate an m x n matrix that contains the integers in the lin 2024-09-14 #leetcode #java #array #matrix #linked list #simulation
[LeetCode] 885. Spiral Matrix III You start at the cell (rStart, cStart) of an rows x cols grid facing east. The northwest corner is at the first row and column in the grid, and the southeast corner is at the last row and column. You 2024-09-13 #leetcode #java #array #matrix #simulation
[LeetCode] 2390. Removing Stars From a String You are given a string s, which contains stars *. In one operation, you can:Choose a star in s.Remove the closest non-star character to its left, as well as remove the star itself.Return the string af 2024-09-13 #leetcode #java #string #stack #simulation