314. Binary Tree Vertical Order Traversal
314. Binary Tree Vertical Order Traversal
Description
Given the root of a binary tree, return the vertical order traversal of its nodes’ values. (i.e., from top to bottom, column by column).
408. Valid Word Abbreviation
680. Valid Palindrome II
1249. Minimum Remove to Make Valid Parentheses
1249. Minimum Remove to Make Valid Parentheses
Description
Given a string s of '(' , ')' and lowercase English characters.
3413. Maximum Coins From K Consecutive Bags
3413. Maximum Coins From K Consecutive Bags
Description
There are an infinite amount of bags on a number line, one bag for each coordinate. Some of these bags contain coins.
2271. Maximum White Tiles Covered by a Carpet
2271. Maximum White Tiles Covered by a Carpet
Description
You are given a 2D integer array tiles where tiles[i] = [li, ri] represents that every tile j in the range li <= j <= ri is colored white.
3411. Maximum Subarray With Equal Products
3411. Maximum Subarray With Equal Products
Description
You are given an array of positive integers nums.
3409. Longest Subsequence With Decreasing Adjacent Difference
3409. Longest Subsequence With Decreasing Adjacent Difference
Description
You are given an array of integers nums.