leetcode/solution/3300-3399
..
3300.Minimum Element After Replacement With Digit Sum
3301.Maximize the Total Height of Unique Towers
3302.Find the Lexicographically Smallest Valid Sequence
3303.Find the Occurrence of First Almost Equal Substring
3304.Find the K-th Character in String Game I
3305.Count of Substrings Containing Every Vowel and K Consonants I
3306.Count of Substrings Containing Every Vowel and K Consonants II
3307.Find the K-th Character in String Game II
3308.Find Top Performing Driver
3309.Maximum Possible Number by Binary Concatenation
3310.Remove Methods From Project
3311.Construct 2D Grid Matching Graph Layout
3312.Sorted GCD Pair Queries
3313.Find the Last Marked Nodes in Tree
3314.Construct the Minimum Bitwise Array I
3315.Construct the Minimum Bitwise Array II
3316.Find Maximum Removals From Source String
3317.Find the Number of Possible Ways for an Event
3318.Find X-Sum of All K-Long Subarrays I
3319.K-th Largest Perfect Subtree Size in Binary Tree
3320.Count The Number of Winning Sequences
3321.Find X-Sum of All K-Long Subarrays II
3322.Premier League Table Ranking III
3323.Minimize Connected Groups by Inserting Interval
3324.Find the Sequence of Strings Appeared on the Screen
3325.Count Substrings With K-Frequency Characters I
3326.Minimum Division Operations to Make Array Non Decreasing
3327.Check if DFS Strings Are Palindromes
3328.Find Cities in Each State II
3329.Count Substrings With K-Frequency Characters II
3330.Find the Original Typed String I
3331.Find Subtree Sizes After Changes
3332.Maximum Points Tourist Can Earn
3333.Find the Original Typed String II
3334.Find the Maximum Factor Score of Array
3335.Total Characters in String After Transformations I
3336.Find the Number of Subsequences With Equal GCD
3337.Total Characters in String After Transformations II
3338.Second Highest Salary II
3339.Find the Number of K-Even Arrays
3340.Check Balanced String
3341.Find Minimum Time to Reach Last Room I
3342.Find Minimum Time to Reach Last Room II
3343.Count Number of Balanced Permutations
3344.Maximum Sized Array
3345.Smallest Divisible Digit Product I
3346.Maximum Frequency of an Element After Performing Operations I
3347.Maximum Frequency of an Element After Performing Operations II
3348.Smallest Divisible Digit Product II
3349.Adjacent Increasing Subarrays Detection I
3350.Adjacent Increasing Subarrays Detection II
3351.Sum of Good Subsequences
3352.Count K-Reducible Numbers Less Than N
3353.Minimum Total Operations
3354.Make Array Elements Equal to Zero
3355.Zero Array Transformation I
3356.Zero Array Transformation II
3357.Minimize the Maximum Adjacent Element Difference
3358.Books with NULL Ratings
3359.Find Sorted Submatrices With Maximum Element at Most K
3360.Stone Removal Game
3361.Shift Distance Between Two Strings
3362.Zero Array Transformation III
3363.Find the Maximum Number of Fruits Collected
3364.Minimum Positive Sum Subarray
3365.Rearrange K Substrings to Form Target String
3366.Minimum Array Sum
3367.Maximize Sum of Weights after Edge Removals
3368.First Letter Capitalization
3369.Design an Array Statistics Tracker
3370.Smallest Number With All Set Bits
3371.Identify the Largest Outlier in an Array
3372.Maximize the Number of Target Nodes After Connecting Trees I
3373.Maximize the Number of Target Nodes After Connecting Trees II
3374.First Letter Capitalization II
3375.Minimum Operations to Make Array Values Equal to K
3376.Minimum Time to Break Locks I
3377.Digit Operations to Make Two Integers Equal
3378.Count Connected Components in LCM Graph
3379.Transformed Array
3380.Maximum Area Rectangle With Point Constraints I
3381.Maximum Subarray Sum With Length Divisible by K
3382.Maximum Area Rectangle With Point Constraints II
3383.Minimum Runes to Add to Cast Spell
3384.Team Dominance by Pass Success
3385.Minimum Time to Break Locks II
3386.Button with Longest Push Time
3387.Maximize Amount After Two Days of Conversions
3388.Count Beautiful Splits in an Array
3389.Minimum Operations to Make Character Frequencies Equal
3390.Longest Team Pass Streak
3391.Design a 3D Binary Matrix with Efficient Layer Tracking
3392.Count Subarrays of Length Three With a Condition
3393.Count Paths With the Given XOR Value
3394.Check if Grid can be Cut into Sections
3395.Subsequences with a Unique Middle Mode I
3396.Minimum Number of Operations to Make Elements in Array Distinct
3397.Maximum Number of Distinct Elements After Operations
3398.Smallest Substring With Identical Characters I
3399.Smallest Substring With Identical Characters II