LeetCode 32xx
LeetCode problems 3200–3299
LeetCode 32xx
| # | Problem | Difficulty | Time | Notes |
|---|---|---|---|---|
| 3200 | Maximum Height of a Triangle | 🟢 Easy | 1m 13s | The problem gives us two integers, red and blue, representing the n… |
| 3201 | Find the Maximum Length of Valid Subsequence I | 🟡 Medium | 1m 41s | The problem asks us to find the longest subsequence in an integer a… |
| 3202 | Find the Maximum Length of Valid Subsequence II | 🟡 Medium | 54s | This problem asks us to find the length of the longest subsequence … |
| 3203 | Find Minimum Diameter After Merging Two Trees | 🔴 Hard | 2m 13s | We are given two separate undirected trees. The first tree contains… |
| 3204 | Bitwise User Permissions Analysis | 🟡 Medium | 55s | The problem is asking us to analyze a table of user permissions whe… |
| 3205 | Maximum Array Hopping Score I | 🟡 Medium | 1m 32s | The problem asks us to calculate the maximum score achievable by ho… |
| 3206 | Alternating Groups I | 🟢 Easy | 1m 9s | The problem gives us a circular array called colors, where each ele… |
| 3207 | Maximum Points After Enemy Battles | 🟡 Medium | 1m 8s | The problem gives us a list of enemies, where each enemy has an ass… |
| 3208 | Alternating Groups II | 🟡 Medium | 1m 12s | The problem gives us a circular array called colors, where each val… |
| 3209 | Number of Subarrays With AND Value of K | 🔴 Hard | 1m 17s | The problem asks us to count how many contiguous subarrays of nums … |
| 3210 | Find the Encrypted String | 🟢 Easy | 51s | The problem asks us to implement a custom string encryption algorit… |
| 3211 | Generate Binary Strings Without Adjacent Zeros | 🟡 Medium | 1m 10s | The problem asks us to generate every binary string of length n suc… |
| 3212 | Count Submatrices With Equal Frequency of X and Y | 🟡 Medium | 50s | The problem asks us to count submatrices within a given 2D characte… |
| 3213 | Construct String with Minimum Cost | 🔴 Hard | 56s | The problem asks us to construct a target string target by repeated… |
| 3214 | Year on Year Growth Rate | 🔴 Hard | 1m 22s | This problem asks us to compute the year-on-year, often abbreviated… |
| 3215 | Count Triplets with Even XOR Set Bits II | 🟡 Medium | 54s | The problem asks us to count the number of triplets (a[i], b[j], c[… |
| 3216 | Lexicographically Smallest String After a Swap | 🟢 Easy | 51s | The problem requires transforming a string of digits into its lexic… |
| 3217 | Delete Nodes From Linked List Present in Array | 🟡 Medium | 57s | This problem asks us to modify a singly linked list by removing all… |
| 3218 | Minimum Cost for Cutting Cake I | 🟡 Medium | 1m 15s | The problem gives us an m x n rectangular cake and asks us to cut i… |
| 3219 | Minimum Cost for Cutting Cake II | 🔴 Hard | 1m 27s | We are given an m x n rectangular cake and need to divide it comple… |
| 3220 | Odd and Even Transactions | 🟡 Medium | 1m 22s | The problem provides a database table named transactions, where eac… |
| 3221 | Maximum Array Hopping Score II | 🟡 Medium | 1m 30s | The problem gives us an integer array nums, where each position rep… |
| 3222 | Find the Winning Player in Coin Game | 🟢 Easy | 1m 17s | The game gives us two types of coins: - x coins worth 75 - y coins … |
| 3223 | Minimum Length of String After Operations | 🟡 Medium | 1m 11s | The problem asks us to repeatedly remove characters from a string b… |
| 3224 | Minimum Array Changes to Make Differences Equal | 🟡 Medium | 45s | The problem gives us an integer array nums of even length n and an … |
| 3225 | Maximum Score From Grid Operations | 🔴 Hard | 1m 2s | This problem presents a 2D square matrix grid of size n x n where e… |
| 3226 | Number of Bit Changes to Make Two Integers Equal | 🟢 Easy | 1m 39s | The problem gives us two positive integers, n and k. We are allowed… |
| 3227 | Vowels Game in a String | 🟡 Medium | 1m | The problem describes a two-player game between Alice and Bob playe… |
| 3228 | Maximum Number of Operations to Move Ones to the End | 🟡 Medium | 1m 28s | The problem gives us a binary string s, consisting only of characte… |
| 3229 | Minimum Operations to Make Array Equal to Target | 🔴 Hard | 1m 43s | The problem gives us two arrays, nums and target, both of the same … |
| 3230 | Customer Purchasing Behavior Analysis | 🟡 Medium | 1m 16s | The problem asks us to analyze customer purchasing behavior using t… |
| 3231 | Minimum Number of Increasing Subsequence to Be Removed | 🔴 Hard | 2m 4s | We are given an integer array nums. In one operation, we may choose… |
| 3232 | Find if Digit Game Can Be Won | 🟢 Easy | 1m 47s | The problem presents a simple two-player game between Alice and Bob… |
| 3233 | Find the Count of Numbers Which Are Not Special | 🟡 Medium | 2m 10s | The problem asks us to count how many integers in the inclusive ran… |
| 3234 | Count the Number of Substrings With Dominant Ones | 🟡 Medium | 2m 56s | We are given a binary string s, containing only '0' and '1'. We mus… |
| 3235 | Check if the Rectangle Corner Is Reachable | 🔴 Hard | 2m 28s | The problem asks whether there is a clear, unobstructed path from t… |
| 3236 | CEO Subordinate Hierarchy | 🔴 Hard | 47s | This problem requires building a hierarchical view of a company's e… |
| 3237 | Alt and Tab Simulation | 🟡 Medium | 2m 18s | The problem asks us to simulate the behavior of switching between o… |
| 3238 | Find the Number of Winning Players | 🟢 Easy | 2m 9s | The problem gives us n players and a list called pick, where each e… |
| 3239 | Minimum Number of Flips to Make Binary Grid Palindromic I | 🟡 Medium | 1m 26s | You are given a binary matrix grid with m rows and n columns. Every… |
| 3240 | Minimum Number of Flips to Make Binary Grid Palindromic II | 🟡 Medium | 1m 59s | We are given a binary matrix grid with m rows and n columns. Every … |
| 3241 | Time Taken to Mark All Nodes | 🔴 Hard | 1m 41s | We are given an undirected tree with n nodes. A tree is a connected… |
| 3242 | Design Neighbor Sum Service | 🟢 Easy | 3m 28s | The problem asks us to design a service that works on a square matr… |
| 3243 | Shortest Distance After Road Addition Queries I | 🟡 Medium | 1m 15s | We are given n cities labeled from 0 to n - 1. Initially, the graph… |
| 3244 | Shortest Distance After Road Addition Queries II | 🔴 Hard | 59s | The problem presents a sequence of n cities numbered from 0 to n - … |
| 3245 | Alternating Groups III | 🔴 Hard | 1m 45s | We are given a circular array called colors, where each element is … |
| 3246 | Premier League Table Ranking | 🟢 Easy | 1m 32s | This problem asks us to generate a league standings table from a da… |
| 3247 | Number of Subsequences with Odd Sum | 🟡 Medium | 1m 49s | The problem asks us to count how many subsequences of the given arr… |
| 3248 | Snake in Matrix | 🟢 Easy | 1m 3s | The problem describes a snake moving inside an n x n grid. Every ce… |
| 3249 | Count the Number of Good Nodes | 🟡 Medium | 2m 13s | We are given an undirected tree with n nodes labeled from 0 to n - … |
| 3250 | Find the Count of Monotonic Pairs I | 🔴 Hard | 1m 29s | The problem asks us to count the number of valid pairs of arrays (a… |
| 3251 | Find the Count of Monotonic Pairs II | 🔴 Hard | 58s | The problem asks us to count the number of ways we can split an arr… |
| 3252 | Premier League Table Ranking II | 🟡 Medium | 53s | The problem asks us to compute a Premier League-style ranking table… |
| 3253 | Construct String with Minimum Cost (Easy) | 🟡 Medium | 40s | === 1996-N5 === Origin: ROM Let denote the set of nonnegative integ… |
| 3254 | Find the Power of K-Size Subarrays I | 🟡 Medium | 1m 14s | The problem asks us to examine every contiguous subarray of length … |
| 3255 | Find the Power of K-Size Subarrays II | 🟡 Medium | 1m 10s | The problem asks us to evaluate every contiguous subarray of length… |
| 3256 | Maximum Value Sum by Placing Three Rooks I | 🔴 Hard | 1m 24s | We are given an m x n matrix called board, where each cell contains… |
| 3257 | Maximum Value Sum by Placing Three Rooks II | 🔴 Hard | 1m 18s | We are given an m x n matrix called board, where each cell contains… |
| 3258 | Count Substrings That Satisfy K-Constraint I | 🟢 Easy | 1m 9s | The problem gives us a binary string s, meaning the string contains… |
| 3259 | Maximum Energy Boost From Two Drinks | 🟡 Medium | 54s | This problem is asking you to plan the consumption of two energy dr… |
| 3260 | Find the Largest Palindrome Divisible by K | 🔴 Hard | 1m 27s | The problem asks us to construct the largest possible palindrome wi… |
| 3261 | Count Substrings That Satisfy K-Constraint II | 🔴 Hard | 1m 34s | We are given a binary string s, an integer k, and many range querie… |
| 3262 | Find Overlapping Shifts | 🟡 Medium | 1m 43s | The problem requires counting overlapping shifts for each employee … |
| 3263 | Convert Doubly Linked List to Array I | 🟢 Easy | 51s | The problem asks us to convert a doubly linked list into a standard… |
| 3264 | Final Array State After K Multiplication Operations I | 🟢 Easy | 1m 14s | This problem asks us to repeatedly modify an array according to a v… |
| 3265 | Count Almost Equal Pairs I | 🟡 Medium | 52s | The problem asks us to find the number of index pairs (i, j) in an … |
| 3266 | Final Array State After K Multiplication Operations II | 🔴 Hard | 1m 35s | The problem gives us an integer array nums, an integer k, and an in… |
| 3267 | Count Almost Equal Pairs II | 🔴 Hard | 1m 23s | We are given an array nums containing positive integers. We need to… |
| 3268 | Find Overlapping Shifts II | 🔴 Hard | 49s | The problem asks us to analyze shift overlaps for employees. We are… |
| 3269 | Constructing Two Increasing Arrays | 🔴 Hard | 1m 29s | We are given two binary arrays, nums1 and nums2. Each element is ei… |
| 3270 | Find the Key of the Numbers | 🟢 Easy | 1m 6s | The problem gives us three positive integers, num1, num2, and num3.… |
| 3271 | Hash Divided String | 🟡 Medium | 52s | The problem asks us to compute a hashed string from an input string… |
| 3272 | Find the Count of Good Integers | 🔴 Hard | 1m 15s | The problem asks us to count n-digit integers that are "good" with … |
| 3273 | Minimum Amount of Damage Dealt to Bob | 🔴 Hard | 1m 33s | This problem asks us to determine the minimum total damage Bob will… |
| 3274 | Check if Two Chessboard Squares Have the Same Color | 🟢 Easy | 1m 27s | The problem gives us two chessboard coordinates, such as "a1" or "h… |
| 3275 | K-th Nearest Obstacle Queries | 🟡 Medium | 1m 19s | The problem requires tracking obstacles on an infinite 2D plane and… |
| 3276 | Select Cells in Grid With Maximum Score | 🔴 Hard | 59s | The problem requires us to select cells from a 2D matrix grid such … |
| 3277 | Maximum XOR Score Subarray Queries | 🔴 Hard | 1m 35s | The problem gives us an integer array nums and several range querie… |
| 3278 | Find Candidates for Data Scientist Position II | 🟡 Medium | 2m 1s | This problem asks us to determine the best candidate for every proj… |
| 3279 | Maximum Total Area Occupied by Pistons | 🔴 Hard | 1m 10s | This problem is about simulating the motion of pistons in a car eng… |
| 3280 | Convert Date to Binary | 🟢 Easy | 1m 13s | The problem gives us a date string in the format yyyy-mm-dd. The ye… |
| 3281 | Maximize Score of Numbers in Ranges | 🟡 Medium | 50s | The problem presents a list of intervals derived from the start arr… |
| 3282 | Reach End of Array With Max Score | 🟡 Medium | 1m 12s | We are given an integer array nums, where each position represents … |
| 3283 | Maximum Number of Moves to Kill All Pawns | 🔴 Hard | 1m 43s | The problem gives us a 50 x 50 chessboard containing exactly one kn… |
| 3284 | Sum of Consecutive Subarrays | 🟡 Medium | 59s | The problem asks us to compute the sum of all consecutive subarrays… |
| 3285 | Find Indices of Stable Mountains | 🟢 Easy | 46s | The problem asks us to find indices of "stable" mountains from a gi… |
| 3286 | Find a Safe Walk Through a Grid | 🟡 Medium | 51s | The problem requires determining whether there exists a path from t… |
| 3287 | Find the Maximum Sequence Value of Array | 🔴 Hard | 1m 34s | We are given an array nums and an integer k. We must choose a subse… |
| 3288 | Length of the Longest Increasing Path | 🔴 Hard | 1m 37s | We are given a collection of distinct points on a 2D plane. Each po… |
| 3289 | The Two Sneaky Numbers of Digitville | 🟢 Easy | 1m 13s | The problem is asking us to identify two numbers that appear twice … |
| 3290 | Maximum Multiplication Score | 🟡 Medium | 1m 31s | This problem gives us two integer arrays: - a, which always has exa… |
| 3291 | Minimum Number of Valid Strings to Form Target I | 🟡 Medium | 1m 32s | We are given a list of strings called words and another string call… |
| 3292 | Minimum Number of Valid Strings to Form Target II | 🔴 Hard | 1m 43s | We are given a collection of strings words and a target string targ… |
| 3293 | Calculate Product Final Price | 🟡 Medium | 1m 10s | The problem asks us to calculate the final price for each product i… |
| 3294 | Convert Doubly Linked List to Array II | 🟡 Medium | 1m 53s | This problem gives us a pointer to an arbitrary node inside a doubl… |
| 3295 | Report Spam Message | 🟡 Medium | 1m 29s | This problem asks us to determine whether a given message should be… |
| 3296 | Minimum Number of Seconds to Make Mountain Height Zero | 🟡 Medium | 1m 15s | The problem asks us to calculate the minimum amount of time require… |
| 3297 | Count Substrings That Can Be Rearranged to Contain a String I | 🟡 Medium | 1m 47s | We are given two lowercase strings, word1 and word2. A substring of… |
| 3298 | Count Substrings That Can Be Rearranged to Contain a String II | 🔴 Hard | 1m 32s | We are given two strings, word1 and word2. We need to count how man… |
| 3299 | Sum of Consecutive Subsequences | 🔴 Hard | 1m 44s | We are given an array nums, and we must consider all non-empty subs… |
| 3206 | Alternating Groups I | 🟢 Easy | 1m 13s | The problem describes a circular arrangement of tiles, where each t… |
| 3224 | Minimum Array Changes to Make Differences Equal | 🟡 Medium | 1m 18s | The problem gives an even-length integer array nums and an integer … |
| 3260 | Find the Largest Palindrome Divisible by K | 🔴 Hard | 1m 42s | The problem asks us to find the largest n-digit integer that is a p… |
| 3270 | Find the Key of the Numbers | 🟢 Easy | 2m 7s | The problem is asking us to find a “key” for three positive integer… |