LeetCode 38xx
LeetCode problems 3800–3899
LeetCode 38xx
| # | Problem | Difficulty | Time | Notes |
|---|---|---|---|---|
| 3800 | Minimum Cost to Make Two Binary Strings Equal | 🟡 Medium | 37s | Exercise 4.3.1.9 asks for a generalization of Algorithm A to add tw… |
| 3801 | Minimum Cost to Merge Sorted Lists | 🔴 Hard | 1m 34s | We are given between 2 and 12 sorted lists. At any moment we may ch… |
| 3802 | Number of Ways to Paint Sheets | 🔴 Hard | 43s | The problem asks us to compute the number of ways to paint n sheets… |
| 3803 | Count Residue Prefixes | 🟢 Easy | 19m 49s | The problem asks us to analyze prefixes of a string s and count how… |
| 3804 | Number of Centered Subarrays | 🟡 Medium | 50s | The problem asks us to count the number of centered subarrays in a … |
| 3805 | Count Caesar Cipher Pairs | 🟡 Medium | 1m 39s | We are given an array words containing n lowercase strings. Every s… |
| 3806 | Maximum Bitwise AND After Increment Operations | 🔴 Hard | 1m 14s | The problem asks us to find the maximum possible bitwise AND of any… |
| 3807 | Minimum Cost to Repair Edges to Traverse a Graph | 🟡 Medium | 54s | The problem presents an undirected graph with n nodes labeled from … |
| 3808 | Find Emotionally Consistent Users | 🟡 Medium | 1m 30s | This problem asks us to analyze user reactions and determine which … |
| 3809 | Best Reachable Tower | 🟡 Medium | 58s | This problem asks us to identify the "best reachable tower" from a … |
| 3810 | Minimum Operations to Reach Target Array | 🟡 Medium | 58s | We are given two arrays, nums and target, of equal length. The arra… |
| 3811 | Number of Alternating XOR Partitions | 🟡 Medium | 2m 6s | We are given an array nums and two distinct target XOR values, targ… |
| 3812 | Minimum Edge Toggles on a Tree | 🔴 Hard | 1m 58s | We are given a tree with n nodes and n - 1 edges. Every node has a … |
| 3813 | Vowel-Consonant Score | 🟢 Easy | 1m 34s | The problem asks us to compute a score for a given string s. The st… |
| 3814 | Maximum Capacity Within Budget | 🟡 Medium | 53s | Exercise 4.3.1.9 asks for a generalization of Algorithm A to add tw… |
| 3815 | Design Auction System | 🟡 Medium | 1m 47s | This problem asks us to design a real time auction system that supp… |
| 3816 | Lexicographically Smallest String After Deleting Duplicate Characters | 🔴 Hard | 1m 31s | We are given a string s consisting only of lowercase English letter… |
| 3817 | Good Indices in a Digit String | 🟡 Medium | 1m 37s | We are given a string s consisting only of decimal digits. The stri… |
| 3818 | Minimum Prefix Removal to Make Array Strictly Increasing | 🟡 Medium | 46s | The problem asks us to process an integer array nums and determine … |
| 3819 | Rotate Non Negative Elements | 🟡 Medium | 47s | The problem asks us to rotate only the non-negative elements of an … |
| 3820 | Pythagorean Distance Nodes in a Tree | 🟡 Medium | 1m 12s | The problem requires identifying special nodes in a tree based on d… |
| 3821 | Find Nth Smallest Integer With K One Bits | 🔴 Hard | 37s | This problem asks us to find the nth smallest positive integer whos… |
| 3822 | Design Order Management System | 🟡 Medium | 1m 42s | This problem asks us to implement a small in-memory order managemen… |
| 3823 | Reverse Letters Then Special Characters in a String | 🟢 Easy | 1m 32s | This problem gives us a string s that contains two types of charact… |
| 3824 | Minimum K to Reduce Array Within Limit | 🟡 Medium | 1m 18s | This problem asks us to determine the minimum positive integer k su… |
| 3825 | Longest Strictly Increasing Subsequence With Non-Zero Bitwise AND | 🟡 Medium | 47s | This problem asks us to find the longest strictly increasing subseq… |
| 3826 | Minimum Partition Score | 🔴 Hard | 2m 10s | We are given an array nums and must divide it into exactly k contig… |
| 3827 | Count Monobit Integers | 🟢 Easy | 47s | The problem asks us to count Monobit integers from 0 to n. A Monobi… |
| 3828 | Final Element After Subarray Deletions | 🟡 Medium | 3m 38s | We are given an integer array nums. Two players, Alice and Bob, rep… |
| 3829 | Design Ride Sharing System | 🟡 Medium | 4m 5s | The problem asks us to design a ride sharing system that manages bo… |
| 3830 | Longest Alternating Subarray After Removing At Most One Element | 🔴 Hard | 2m 26s | The problem asks us to find the longest alternating subarray in a g… |
| 3831 | Median of a Binary Search Tree Level | 🟡 Medium | 51s | Exercise 4.3.1.9 asks for a generalization of Algorithm A to add tw… |
| 3832 | Find Users with Persistent Behavior Patterns | 🔴 Hard | 1m 14s | The activity table records user actions. Each row contains a userid… |
| 3833 | Count Dominant Indices | 🟢 Easy | 1m 30s | The problem gives us an integer array nums of length n. For every i… |
| 3834 | Merge Adjacent Equal Elements | 🟡 Medium | 2m 19s | The problem asks us to repeatedly merge adjacent equal elements in … |
| 3835 | Count Subarrays With Cost Less Than or Equal to K | 🟡 Medium | 2m 19s | We are given an array nums and an integer k. For every subarray num… |
| 3836 | Maximum Score Using Exactly K Pairs | 🔴 Hard | 2m 20s | We are given two arrays, nums1 of length n and nums2 of length m, a… |
| 3837 | Delayed Count of Equal Elements | 🟡 Medium | 46s | The problem requires computing a delayed count for each element in … |
| 3838 | Weighted Word Mapping | 🟢 Easy | 1m 33s | The problem provides two inputs: - words, an array of lowercase Eng… |
| 3839 | Number of Prefix Connected Groups | 🟡 Medium | 1m 29s | The problem gives us an array of strings words and an integer k. Tw… |
| 3840 | House Robber V | 🟡 Medium | 52s | The problem is a variation of the classic House Robber problem, but… |
| 3841 | Palindromic Path Queries in a Tree | 🔴 Hard | 1m 32s | We are given a tree with n nodes. Each node stores a lowercase Engl… |
| 3842 | Toggle Light Bulbs | 🟢 Easy | 1m 26s | The problem gives us an array bulbs, where each value represents a … |
| 3843 | First Element with Unique Frequency | 🟡 Medium | 2m | The proposed solution does not answer the question that Exercise 4.… |
| 3844 | Longest Almost-Palindromic Substring | 🟡 Medium | 2m 6s | We are given a string s consisting of lowercase English letters. We… |
| 3845 | Maximum Subarray XOR with Bounded Range | 🔴 Hard | 40s | The problem asks us to find a subarray of a given non-negative inte… |
| 3846 | Total Distance to Type a String Using One Finger | 🟡 Medium | 1m 27s | This problem asks us to calculate the total finger movement require… |
| 3847 | Find the Score Difference in a Game | 🟡 Medium | 1m 4s | This problem describes a game played over a sequence of rounds. The… |
| 3848 | Check Digitorial Permutation | 🟡 Medium | 43s | The problem asks us to determine whether any permutation of the dig… |
| 3849 | Maximum Bitwise XOR After Rearrangement | 🟡 Medium | 1m 59s | Exercise 4.3.1.9 asks for a generalization of Algorithm A to add tw… |
| 3850 | Count Sequences to K | 🔴 Hard | 2m | We start with a value val = 1 and process the array from left to ri… |
| 3851 | Maximum Requests Without Violating the Limit | 🟡 Medium | 1m 25s | We are given a list of requests, where each request consists of a u… |
| 3852 | Smallest Pair With Different Frequencies | 🟢 Easy | 1m 29s | This problem gives us an integer array nums and asks us to find a p… |
| 3853 | Merge Close Characters | 🟡 Medium | 55s | The problem asks us to repeatedly merge close, equal characters in … |
| 3854 | Minimum Operations to Make Array Parity Alternating | 🟡 Medium | 2m 18s | We are given an integer array nums. An array is called parity alter… |
| 3855 | Sum of K-Digit Numbers in a Range | 🔴 Hard | 1m 12s | We are given three integers l, r, and k. For every digit position, … |
| 3856 | Trim Trailing Vowels | 🟢 Easy | 1m 24s | This problem asks us to remove all vowels that appear at the end of… |
| 3857 | Minimum Cost to Split into Ones | 🟡 Medium | 1m 14s | We are given a single integer n. Starting with this integer, we rep… |
| 3858 | Minimum Bitwise OR From Grid | 🟡 Medium | 1m 52s | We are given an m x n grid of positive integers. From each row, we … |
| 3859 | Count Subarrays With K Distinct Integers | 🔴 Hard | 55s | This problem asks us to count subarrays of a given integer array nu… |
| 3860 | Unique Email Groups | 🟡 Medium | 1m 17s | This problem asks us to determine how many distinct email groups ex… |
| 3861 | Minimum Capacity Box | 🟢 Easy | 1m 16s | The problem presents a straightforward search scenario. You are giv… |
| 3862 | Find the Smallest Balanced Index | 🟡 Medium | 1m 33s | We are given an integer array nums, and we need to find the smalles… |
| 3863 | Minimum Operations to Sort a String | 🟡 Medium | 57s | This problem is asking us to determine the minimum number of substr… |
| 3864 | Minimum Cost to Partition a Binary String | 🔴 Hard | 1m 26s | We are given a binary string s, where each character represents whe… |
| 3865 | Reverse K Subarrays | 🟡 Medium | 57s | The problem asks us to take an integer array nums of length n and d… |
| 3866 | First Unique Even Element | 🟢 Easy | 56s | The problem asks us to find the first even integer in an array that… |
| 3867 | Sum of GCD of Formed Pairs | 🟡 Medium | 1m 28s | We are given an integer array nums of length n. For every index i, … |
| 3868 | Minimum Cost to Equalize Arrays Using Swaps | 🟡 Medium | 55s | The problem requires us to make two integer arrays nums1 and nums2 … |
| 3869 | Count Fancy Numbers in a Range | 🔴 Hard | 2m 40s | We are given two integers l and r, and we must count how many integ… |
| 3870 | Count Commas in Range | 🟢 Easy | 1m 15s | The problem asks us to count how many commas appear when writing ev… |
| 3871 | Count Commas in Range II | 🟡 Medium | 1m 3s | The problem asks us to count the total number of commas that appear… |
| 3872 | Longest Arithmetic Sequence After Changing At Most One Element | 🟡 Medium | 43s | The problem requires us to find the longest arithmetic subarray fro… |
| 3873 | Maximum Points Activated with One Addition | 🔴 Hard | 44s | The problem is asking us to simulate a chain reaction of activation… |
| 3874 | Valid Subarrays With Exactly One Peak | 🟡 Medium | 53s | The problem asks us to count the number of contiguous subarrays of … |
| 3875 | Construct Uniform Parity Array I | 🟢 Easy | 39s | The problem asks us to determine if it is possible to construct a n… |
| 3876 | Construct Uniform Parity Array II | 🟡 Medium | 51s | The problem asks us to determine whether we can construct a new arr… |
| 3877 | Minimum Removals to Achieve Target XOR | 🟡 Medium | 2m 3s | We are given an array nums and a target value target. We may remove… |
| 3878 | Count Good Subarrays | 🔴 Hard | 2m 39s | We are given an integer array nums, and we must count how many suba… |
| 3879 | Maximum Distinct Path Sum in a Binary Tree | 🟡 Medium | 47s | The problem asks us to find the maximum sum of node values along a … |
| 3880 | Minimum Absolute Difference Between Two Values | 🟢 Easy | 1m 37s | The problem gives us an integer array nums where every element is g… |
| 3881 | Direction Assignments with Exactly K Visible People | 🟡 Medium | 1m 11s | We are given n people standing in a line, indexed from 0 to n - 1. … |
| 3882 | Minimum XOR Path in a Grid | 🟡 Medium | 1m 33s | We are given an m × n grid of integers. Starting from the top-left … |
| 3883 | Count Non Decreasing Arrays With Given Digit Sums | 🔴 Hard | 39s | The problem asks us to compute the number of non-decreasing arrays … |
| 3884 | First Matching Character From Both Ends | 🟢 Easy | 1m 23s | This problem gives us a string s of length n consisting of lowercas… |
| 3885 | Design Event Manager | 🟡 Medium | 1m 10s | The problem asks us to design an EventManager class that manages a … |
| 3886 | Sum of Sortable Integers | 🔴 Hard | 59s | The problem asks us to find all integers k that divide the length o… |
| 3887 | Incremental Even-Weighted Cycle Queries | 🔴 Hard | 1m 29s | This problem describes a dynamic process of building an undirected … |
| 3889 | Mirror Frequency Distance | 🟡 Medium | 1m 12s | We are given a string s containing only lowercase English letters (… |
| 3890 | Integers With Multiple Sum of Two Cubes | 🟡 Medium | 55s | The problem asks us to find all integers x less than or equal to a … |
| 3891 | Minimum Increase to Maximize Special Indices | 🟡 Medium | 1m 30s | This problem asks us to modify an integer array to create as many s… |
| 3892 | Minimum Operations to Achieve At Least K Peaks | 🔴 Hard | 1m 58s | We are given a circular array nums. An index is considered a peak i… |
| 3894 | Traffic Signal Color | 🟢 Easy | 2m 19s | This problem asks us to determine the current state of a traffic si… |
| 3895 | Count Digit Appearances | 🟡 Medium | 2m 24s | The problem asks us to count how many times a specific decimal digi… |
| 3896 | Minimum Operations to Transform Array into Alternating Prime | 🟡 Medium | 58s | The problem asks us to transform an integer array nums into an alte… |
| 3897 | Maximum Value of Concatenated Binary Segments | 🔴 Hard | 1m 18s | The problem presents two integer arrays nums1 and nums0, each of si… |
| 3898 | Find the Degree of Each Vertex | 🟢 Easy | 1m 37s | The problem asks us to calculate the degree of each vertex in an un… |
| 3899 | Angles of a Triangle | 🟡 Medium | 1m 1s | We are given an array sides containing exactly three positive integ… |