Files

 swift-impl-lcof-55-I

/

2900-2999

/

Copy path

Directory actions

More options

Directory actions

More options

Latest commit

yanglbme

feat: add solutions to lc problems: No.3162,3164,3166 (doocs#2918)

May 27, 2024

63da6ef · May 27, 2024

History

History

This branch is 1 commit ahead of, 1210 commits behind doocs/leetcode:main.

/

2900-2999

/

Top

Folders and files

Name		Name	Last commit message	Last commit date
parent directory ..
2900.Longest Unequal Adjacent Groups Subsequence I		2900.Longest Unequal Adjacent Groups Subsequence I
2901.Longest Unequal Adjacent Groups Subsequence II		2901.Longest Unequal Adjacent Groups Subsequence II
2902.Count of Sub-Multisets With Bounded Sum		2902.Count of Sub-Multisets With Bounded Sum
2903.Find Indices With Index and Value Difference I		2903.Find Indices With Index and Value Difference I
2904.Shortest and Lexicographically Smallest Beautiful String		2904.Shortest and Lexicographically Smallest Beautiful String
2905.Find Indices With Index and Value Difference II		2905.Find Indices With Index and Value Difference II
2906.Construct Product Matrix		2906.Construct Product Matrix
2907.Maximum Profitable Triplets With Increasing Prices I		2907.Maximum Profitable Triplets With Increasing Prices I
2908.Minimum Sum of Mountain Triplets I		2908.Minimum Sum of Mountain Triplets I
2909.Minimum Sum of Mountain Triplets II		2909.Minimum Sum of Mountain Triplets II
2910.Minimum Number of Groups to Create a Valid Assignment		2910.Minimum Number of Groups to Create a Valid Assignment
2911.Minimum Changes to Make K Semi-palindromes		2911.Minimum Changes to Make K Semi-palindromes
2912.Number of Ways to Reach Destination in the Grid		2912.Number of Ways to Reach Destination in the Grid
2913.Subarrays Distinct Element Sum of Squares I		2913.Subarrays Distinct Element Sum of Squares I
2914.Minimum Number of Changes to Make Binary String Beautiful		2914.Minimum Number of Changes to Make Binary String Beautiful
2915.Length of the Longest Subsequence That Sums to Target		2915.Length of the Longest Subsequence That Sums to Target
2916.Subarrays Distinct Element Sum of Squares II		2916.Subarrays Distinct Element Sum of Squares II
2917.Find the K-or of an Array		2917.Find the K-or of an Array
2918.Minimum Equal Sum of Two Arrays After Replacing Zeros		2918.Minimum Equal Sum of Two Arrays After Replacing Zeros
2919.Minimum Increment Operations to Make Array Beautiful		2919.Minimum Increment Operations to Make Array Beautiful
2920.Maximum Points After Collecting Coins From All Nodes		2920.Maximum Points After Collecting Coins From All Nodes
2921.Maximum Profitable Triplets With Increasing Prices II		2921.Maximum Profitable Triplets With Increasing Prices II
2922.Market Analysis III		2922.Market Analysis III
2923.Find Champion I		2923.Find Champion I
2924.Find Champion II		2924.Find Champion II
2925.Maximum Score After Applying Operations on a Tree		2925.Maximum Score After Applying Operations on a Tree
2926.Maximum Balanced Subsequence Sum		2926.Maximum Balanced Subsequence Sum
2927.Distribute Candies Among Children III		2927.Distribute Candies Among Children III
2928.Distribute Candies Among Children I		2928.Distribute Candies Among Children I
2929.Distribute Candies Among Children II		2929.Distribute Candies Among Children II
2930.Number of Strings Which Can Be Rearranged to Contain Substring		2930.Number of Strings Which Can Be Rearranged to Contain Substring
2931.Maximum Spending After Buying Items		2931.Maximum Spending After Buying Items
2932.Maximum Strong Pair XOR I		2932.Maximum Strong Pair XOR I
2933.High-Access Employees		2933.High-Access Employees
2934.Minimum Operations to Maximize Last Elements in Arrays		2934.Minimum Operations to Maximize Last Elements in Arrays
2935.Maximum Strong Pair XOR II		2935.Maximum Strong Pair XOR II
2936.Number of Equal Numbers Blocks		2936.Number of Equal Numbers Blocks
2937.Make Three Strings Equal		2937.Make Three Strings Equal
2938.Separate Black and White Balls		2938.Separate Black and White Balls
2939.Maximum Xor Product		2939.Maximum Xor Product
2940.Find Building Where Alice and Bob Can Meet		2940.Find Building Where Alice and Bob Can Meet
2941.Maximum GCD-Sum of a Subarray		2941.Maximum GCD-Sum of a Subarray
2942.Find Words Containing Character		2942.Find Words Containing Character
2943.Maximize Area of Square Hole in Grid		2943.Maximize Area of Square Hole in Grid
2944.Minimum Number of Coins for Fruits		2944.Minimum Number of Coins for Fruits
2945.Find Maximum Non-decreasing Array Length		2945.Find Maximum Non-decreasing Array Length
2946.Matrix Similarity After Cyclic Shifts		2946.Matrix Similarity After Cyclic Shifts
2947.Count Beautiful Substrings I		2947.Count Beautiful Substrings I
2948.Make Lexicographically Smallest Array by Swapping Elements		2948.Make Lexicographically Smallest Array by Swapping Elements
2949.Count Beautiful Substrings II		2949.Count Beautiful Substrings II
2950.Number of Divisible Substrings		2950.Number of Divisible Substrings
2951.Find the Peaks		2951.Find the Peaks
2952.Minimum Number of Coins to be Added		2952.Minimum Number of Coins to be Added
2953.Count Complete Substrings		2953.Count Complete Substrings
2954.Count the Number of Infection Sequences		2954.Count the Number of Infection Sequences
2955.Number of Same-End Substrings		2955.Number of Same-End Substrings
2956.Find Common Elements Between Two Arrays		2956.Find Common Elements Between Two Arrays
2957.Remove Adjacent Almost-Equal Characters		2957.Remove Adjacent Almost-Equal Characters
2958.Length of Longest Subarray With at Most K Frequency		2958.Length of Longest Subarray With at Most K Frequency
2959.Number of Possible Sets of Closing Branches		2959.Number of Possible Sets of Closing Branches
2960.Count Tested Devices After Test Operations		2960.Count Tested Devices After Test Operations
2961.Double Modular Exponentiation		2961.Double Modular Exponentiation
2962.Count Subarrays Where Max Element Appears at Least K Times		2962.Count Subarrays Where Max Element Appears at Least K Times
2963.Count the Number of Good Partitions		2963.Count the Number of Good Partitions
2964.Number of Divisible Triplet Sums		2964.Number of Divisible Triplet Sums
2965.Find Missing and Repeated Values		2965.Find Missing and Repeated Values
2966.Divide Array Into Arrays With Max Difference		2966.Divide Array Into Arrays With Max Difference
2967.Minimum Cost to Make Array Equalindromic		2967.Minimum Cost to Make Array Equalindromic
2968.Apply Operations to Maximize Frequency Score		2968.Apply Operations to Maximize Frequency Score
2969.Minimum Number of Coins for Fruits II		2969.Minimum Number of Coins for Fruits II
2970.Count the Number of Incremovable Subarrays I		2970.Count the Number of Incremovable Subarrays I
2971.Find Polygon With the Largest Perimeter		2971.Find Polygon With the Largest Perimeter
2972.Count the Number of Incremovable Subarrays II		2972.Count the Number of Incremovable Subarrays II
2973.Find Number of Coins to Place in Tree Nodes		2973.Find Number of Coins to Place in Tree Nodes
2974.Minimum Number Game		2974.Minimum Number Game
2975.Maximum Square Area by Removing Fences From a Field		2975.Maximum Square Area by Removing Fences From a Field
2976.Minimum Cost to Convert String I		2976.Minimum Cost to Convert String I
2977.Minimum Cost to Convert String II		2977.Minimum Cost to Convert String II
2978.Symmetric Coordinates		2978.Symmetric Coordinates
2979.Most Expensive Item That Can Not Be Bought		2979.Most Expensive Item That Can Not Be Bought
2980.Check if Bitwise OR Has Trailing Zeros		2980.Check if Bitwise OR Has Trailing Zeros
2981.Find Longest Special Substring That Occurs Thrice I		2981.Find Longest Special Substring That Occurs Thrice I
2982.Find Longest Special Substring That Occurs Thrice II		2982.Find Longest Special Substring That Occurs Thrice II
2983.Palindrome Rearrangement Queries		2983.Palindrome Rearrangement Queries
2984.Find Peak Calling Hours for Each City		2984.Find Peak Calling Hours for Each City
2985.Calculate Compressed Mean		2985.Calculate Compressed Mean
2986.Find Third Transaction		2986.Find Third Transaction
2987.Find Expensive Cities		2987.Find Expensive Cities
2988.Manager of the Largest Department		2988.Manager of the Largest Department
2989.Class Performance		2989.Class Performance
2990.Loan Types		2990.Loan Types
2991.Top Three Wineries		2991.Top Three Wineries
2992.Number of Self-Divisible Permutations		2992.Number of Self-Divisible Permutations
2993.Friday Purchases I		2993.Friday Purchases I
2994.Friday Purchases II		2994.Friday Purchases II
2995.Viewers Turned Streamers		2995.Viewers Turned Streamers
2996.Smallest Missing Integer Greater Than Sequential Prefix Sum		2996.Smallest Missing Integer Greater Than Sequential Prefix Sum
2997.Minimum Number of Operations to Make Array XOR Equal to K		2997.Minimum Number of Operations to Make Array XOR Equal to K
2998.Minimum Number of Operations to Make X and Y Equal		2998.Minimum Number of Operations to Make X and Y Equal
2999.Count the Number of Powerful Integers		2999.Count the Number of Powerful Integers
View all files