[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 #array #java #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
[LeetCode] 2181. Merge Nodes in Between Zeros You are given the head of a linked list, which contains a series of integers separated by 0’s. The beginning and end of the linked list will have Node.val == 0. For every two consecutive 0’s 2024-09-08 #leetcode #java #linked list #simulation
[LeetCode] 3142. Check if Grid Satisfies Conditions You are given a 2D matrix grid of size m x n. You need to check if each cell grid[i][j] is:Equal to the cell below it, i.e. grid[i][j] == grid[i + 1][j] (if it exists).Different from the cel 2024-08-28 #leetcode #array #java #matrix
[LeetCode] 2053. Kth Distinct String in an Array A distinct string is a string that is present only once in an array. Given an array of strings arr, and an integer k, return the kth distinct string present in arr. If there are fewer than k distinct 2024-08-04 #leetcode #array #hashmap #java #string
[LeetCode] 2134. Minimum Swaps to Group All 1s Together II A swap is defined as taking two distinct positions in an array and swapping the values in them. A circular array is defined as an array where we consider the first element and the last element to be a 2024-08-03 #leetcode #array #java #sliding window #sliding window with fixed size #prefix sum
[LeetCode] 1380. Lucky Numbers in a Matrix Given an m x n matrix of distinct numbers, return all lucky numbers in the matrix in any order. A lucky number is an element of the matrix such that it is the minimum element in its row and maximum in 2024-07-18 #leetcode #array #java #matrix
[LeetCode] 3096. Minimum Levels to Gain More Points You are given a binary array possible of length n. Alice and Bob are playing a game that consists of n levels. Some of the levels in the game are impossible to clear while others can always be cleared 2024-07-18 #leetcode #array #java #prefix sum
[LeetCode] 2196. Create Binary Tree From Descriptions You are given a 2D integer array descriptions where descriptions[i] = [parenti, childi, isLefti] indicates that parenti is the parent of childi in a binary tree of unique values. Furthermore,If i 2024-07-16 #leetcode #array #hashmap #java #tree
[LeetCode] 2938. Separate Black and White Balls There are n balls on a table, each ball has a color black or white. You are given a 0-indexed binary string s of length n, where 1 and 0 represent black and white balls, respectively. In each step, yo 2024-06-05 #leetcode #two pointer #java #greedy #string