diff --git a/dsa-problems/leetcode-problems/3000-3099.md b/dsa-problems/leetcode-problems/3000-3099.md index e69de29bb..f109b8d3d 100644 --- a/dsa-problems/leetcode-problems/3000-3099.md +++ b/dsa-problems/leetcode-problems/3000-3099.md @@ -0,0 +1,622 @@ +--- +id: 3000-3099 +title: LeetCode Problems 3000 - 3099 +sidebar_label: 3000 - 3099 +keywords: + - LeetCode + - LeetCode Problems + - LeetCode Problems 3000 - 3099 + - DSA problems +--- + +export const problems = [ + { + "problemName": "3000. Maximum Area of Longest Diagonal Rectangle", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/maximum-area-of-longest-diagonal-rectangle", + "solutionLink": "#" + }, + { + "problemName": "3001. Minimum Moves to Capture The Queen", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/minimum-moves-to-capture-the-queen", + "solutionLink": "#" + }, + { + "problemName": "3002. Maximum Size of a Set After Removals", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/maximum-size-of-a-set-after-removals", + "solutionLink": "#" + }, + { + "problemName": "3003. Maximize the Number of Partitions After Operations", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/maximize-the-number-of-partitions-after-operations", + "solutionLink": "#" + }, + { + "problemName": "3004. Maximum Subtree of the Same Color", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/maximum-subtree-of-the-same-color", + "solutionLink": "#" + }, + { + "problemName": "3005. Count Elements With Maximum Frequency", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/count-elements-with-maximum-frequency", + "solutionLink": "#" + }, + { + "problemName": "3006. Find Beautiful Indices in the Given Array I", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/find-beautiful-indices-in-the-given-array-i", + "solutionLink": "#" + }, + { + "problemName": "3007. Maximum Number That Sum of the Prices Is Less Than or Equal to K", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/maximum-number-that-sum-of-the-prices-is-less-than-or-equal-to-k", + "solutionLink": "#" + }, + { + "problemName": "3008. Find Beautiful Indices in the Given Array II", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/find-beautiful-indices-in-the-given-array-ii", + "solutionLink": "#" + }, + { + "problemName": "3009. Maximum Number of Intersections on the Chart", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/maximum-number-of-intersections-on-the-chart", + "solutionLink": "#" + }, + { + "problemName": "3010. Divide an Array Into Subarrays With Minimum Cost I", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/divide-an-array-into-subarrays-with-minimum-cost-i", + "solutionLink": "#" + }, + { + "problemName": "3011. Find if Array Can Be Sorted", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/find-if-array-can-be-sorted", + "solutionLink": "#" + }, + { + "problemName": "3012. Minimize Length of Array Using Operations", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/minimize-length-of-array-using-operations", + "solutionLink": "#" + }, + { + "problemName": "3013. Divide an Array Into Subarrays With Minimum Cost II", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/divide-an-array-into-subarrays-with-minimum-cost-ii", + "solutionLink": "#" + }, + { + "problemName": "3014. Minimum Number of Pushes to Type Word I", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/minimum-number-of-pushes-to-type-word-i", + "solutionLink": "#" + }, + { + "problemName": "3015. Count the Number of Houses at a Certain Distance I", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/count-the-number-of-houses-at-a-certain-distance-i", + "solutionLink": "#" + }, + { + "problemName": "3016. Minimum Number of Pushes to Type Word II", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/minimum-number-of-pushes-to-type-word-ii", + "solutionLink": "#" + }, + { + "problemName": "3017. Count the Number of Houses at a Certain Distance II", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/count-the-number-of-houses-at-a-certain-distance-ii", + "solutionLink": "#" + }, + { + "problemName": "3018. Maximum Number of Removal Queries That Can Be Processed I", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/maximum-number-of-removal-queries-that-can-be-processed-i", + "solutionLink": "#" + }, + { + "problemName": "3019. Number of Changing Keys", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/number-of-changing-keys", + "solutionLink": "#" + }, + { + "problemName": "3020. Find the Maximum Number of Elements in Subset", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/find-the-maximum-number-of-elements-in-subset", + "solutionLink": "#" + }, + { + "problemName": "3021. Alice and Bob Playing Flower Game", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/alice-and-bob-playing-flower-game", + "solutionLink": "#" + }, + { + "problemName": "3022. Minimize OR of Remaining Elements Using Operations", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/minimize-or-of-remaining-elements-using-operations", + "solutionLink": "#" + }, + { + "problemName": "3023. Find Pattern in Infinite Stream I", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/find-pattern-in-infinite-stream-i", + "solutionLink": "#" + }, + { + "problemName": "3024. Type of Triangle", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/type-of-triangle", + "solutionLink": "#" + }, + { + "problemName": "3025. Find the Number of Ways to Place People I", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/find-the-number-of-ways-to-place-people-i", + "solutionLink": "#" + }, + { + "problemName": "3026. Maximum Good Subarray Sum", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/maximum-good-subarray-sum", + "solutionLink": "#" + }, + { + "problemName": "3027. Find the Number of Ways to Place People II", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/find-the-number-of-ways-to-place-people-ii", + "solutionLink": "#" + }, + { + "problemName": "3028. Ant on the Boundary", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/ant-on-the-boundary", + "solutionLink": "#" + }, + { + "problemName": "3029. Minimum Time to Revert Word to Initial State I", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/minimum-time-to-revert-word-to-initial-state-i", + "solutionLink": "#" + }, + { + "problemName": "3030. Find the Grid of Region Average", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/find-the-grid-of-region-average", + "solutionLink": "#" + }, + { + "problemName": "3031. Minimum Time to Revert Word to Initial State II", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/minimum-time-to-revert-word-to-initial-state-ii", + "solutionLink": "#" + }, + { + "problemName": "3032. Count Numbers With Unique Digits II", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/count-numbers-with-unique-digits-ii", + "solutionLink": "#" + }, + { + "problemName": "3033. Modify the Matrix", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/modify-the-matrix", + "solutionLink": "#" + }, + { + "problemName": "3034. Number of Subarrays That Match a Pattern I", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/number-of-subarrays-that-match-a-pattern-i", + "solutionLink": "#" + }, + { + "problemName": "3035. Maximum Palindromes After Operations", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/maximum-palindromes-after-operations", + "solutionLink": "#" + }, + { + "problemName": "3036. Number of Subarrays That Match a Pattern II", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/number-of-subarrays-that-match-a-pattern-ii", + "solutionLink": "#" + }, + { + "problemName": "3037. Find Pattern in Infinite Stream II", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/find-pattern-in-infinite-stream-ii", + "solutionLink": "#" + }, + { + "problemName": "3038. Maximum Number of Operations With the Same Score I", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/maximum-number-of-operations-with-the-same-score-i", + "solutionLink": "#" + }, + { + "problemName": "3039. Apply Operations to Make String Empty", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/apply-operations-to-make-string-empty", + "solutionLink": "#" + }, + { + "problemName": "3040. Maximum Number of Operations With the Same Score II", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/maximum-number-of-operations-with-the-same-score-ii", + "solutionLink": "#" + }, + { + "problemName": "3041. Maximize Consecutive Elements in an Array After Modification", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/maximize-consecutive-elements-in-an-array-after-modification", + "solutionLink": "#" + }, + { + "problemName": "3042. Count Prefix and Suffix Pairs I", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/count-prefix-and-suffix-pairs-i", + "solutionLink": "#" + }, + { + "problemName": "3043. Find the Length of the Longest Common Prefix", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/find-the-length-of-the-longest-common-prefix", + "solutionLink": "#" + }, + { + "problemName": "3044. Most Frequent Prime", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/most-frequent-prime", + "solutionLink": "#" + }, + { + "problemName": "3045. Count Prefix and Suffix Pairs II", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/count-prefix-and-suffix-pairs-ii", + "solutionLink": "#" + }, + { + "problemName": "3046. Split the Array", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/split-the-array", + "solutionLink": "#" + }, + { + "problemName": "3047. Find the Largest Area of Square Inside Two Rectangles", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/find-the-largest-area-of-square-inside-two-rectangles", + "solutionLink": "#" + }, + { + "problemName": "3048. Earliest Second to Mark Indices I", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/earliest-second-to-mark-indices-i", + "solutionLink": "#" + }, + { + "problemName": "3049. Earliest Second to Mark Indices II", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/earliest-second-to-mark-indices-ii", + "solutionLink": "#" + }, + { + "problemName": "3050. Pizza Toppings Cost Analysis", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/pizza-toppings-cost-analysis", + "solutionLink": "#" + }, + { + "problemName": "3051. Find Candidates for Data Scientist Position", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/find-candidates-for-data-scientist-position", + "solutionLink": "#" + }, + { + "problemName": "3052. Maximize Items", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/maximize-items", + "solutionLink": "#" + }, + { + "problemName": "3053. Classifying Triangles by Lengths", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/classifying-triangles-by-lengths", + "solutionLink": "#" + }, + { + "problemName": "3054. Binary Tree Nodes", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/binary-tree-nodes", + "solutionLink": "#" + }, + { + "problemName": "3055. Top Percentile Fraud", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/top-percentile-fraud", + "solutionLink": "#" + }, + { + "problemName": "3056. Snaps Analysis", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/snaps-analysis", + "solutionLink": "#" + }, + { + "problemName": "3057. Employees Project Allocation", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/employees-project-allocation", + "solutionLink": "#" + }, + { + "problemName": "3058. Friends With No Mutual Friends", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/friends-with-no-mutual-friends", + "solutionLink": "#" + }, + { + "problemName": "3059. Find All Unique Email Domains", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/find-all-unique-email-domains", + "solutionLink": "#" + }, + { + "problemName": "3060. User Activities within Time Bounds", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/user-activities-within-time-bounds", + "solutionLink": "#" + }, + { + "problemName": "3061. Calculate Trapping Rain Water", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/calculate-trapping-rain-water", + "solutionLink": "#" + }, + { + "problemName": "3062. Winner of the Linked List Game", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/winner-of-the-linked-list-game", + "solutionLink": "#" + }, + { + "problemName": "3063. Linked List Frequency", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/linked-list-frequency", + "solutionLink": "#" + }, + { + "problemName": "3064. Guess the Number Using Bitwise Questions I", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/guess-the-number-using-bitwise-questions-i", + "solutionLink": "#" + }, + { + "problemName": "3065. Minimum Operations to Exceed Threshold Value I", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/minimum-operations-to-exceed-threshold-value-i", + "solutionLink": "#" + }, + { + "problemName": "3066. Minimum Operations to Exceed Threshold Value II", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/minimum-operations-to-exceed-threshold-value-ii", + "solutionLink": "#" + }, + { + "problemName": "3067. Count Pairs of Connectable Servers in a Weighted Tree Network", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/count-pairs-of-connectable-servers-in-a-weighted-tree-network", + "solutionLink": "#" + }, + { + "problemName": "3068. Find the Maximum Sum of Node Values", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/find-the-maximum-sum-of-node-values", + "solutionLink": "#" + }, + { + "problemName": "3069. Distribute Elements Into Two Arrays I", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/distribute-elements-into-two-arrays-i", + "solutionLink": "#" + }, + { + "problemName": "3070. Count Submatrices with Top-Left Element and Sum Less Than k", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/count-submatrices-with-top-left-element-and-sum-less-than-k", + "solutionLink": "#" + }, + { + "problemName": "3071. Minimum Operations to Write the Letter Y on a Grid", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/minimum-operations-to-write-the-letter-y-on-a-grid", + "solutionLink": "#" + }, + { + "problemName": "3072. Distribute Elements Into Two Arrays II", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/distribute-elements-into-two-arrays-ii", + "solutionLink": "#" + }, + { + "problemName": "3073. Maximum Increasing Triplet Value", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/maximum-increasing-triplet-value", + "solutionLink": "#" + }, + { + "problemName": "3074. Apple Redistribution into Boxes", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/apple-redistribution-into-boxes", + "solutionLink": "#" + }, + { + "problemName": "3075. Maximize Happiness of Selected Children", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/maximize-happiness-of-selected-children", + "solutionLink": "#" + }, + { + "problemName": "3076. Shortest Uncommon Substring in an Array", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/shortest-uncommon-substring-in-an-array", + "solutionLink": "#" + }, + { + "problemName": "3077. Maximum Strength of K Disjoint Subarrays", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/maximum-strength-of-k-disjoint-subarrays", + "solutionLink": "#" + }, + { + "problemName": "3078. Match Alphanumerical Pattern in Matrix I", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/match-alphanumerical-pattern-in-matrix-i", + "solutionLink": "#" + }, + { + "problemName": "3079. Find the Sum of Encrypted Integers", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/find-the-sum-of-encrypted-integers", + "solutionLink": "#" + }, + { + "problemName": "3080. Mark Elements on Array by Performing Queries", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/mark-elements-on-array-by-performing-queries", + "solutionLink": "#" + }, + { + "problemName": "3081. Replace Question Marks in String to Minimize Its Value", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/replace-question-marks-in-string-to-minimize-its-value", + "solutionLink": "#" + }, + { + "problemName": "3082. Find the Sum of the Power of All Subsequences", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/find-the-sum-of-the-power-of-all-subsequences", + "solutionLink": "#" + }, + { + "problemName": "3083. Existence of a Substring in a String and Its Reverse", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/existence-of-a-substring-in-a-string-and-its-reverse", + "solutionLink": "#" + }, + { + "problemName": "3084. Count Substrings Starting and Ending with Given Character", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/count-substrings-starting-and-ending-with-given-character", + "solutionLink": "#" + }, + { + "problemName": "3085. Minimum Deletions to Make String K-Special", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/minimum-deletions-to-make-string-k-special", + "solutionLink": "#" + }, + { + "problemName": "3086. Minimum Moves to Pick K Ones", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/minimum-moves-to-pick-k-ones", + "solutionLink": "#" + }, + { + "problemName": "3087. Find Trending Hashtags", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/find-trending-hashtags", + "solutionLink": "#" + }, + { + "problemName": "3088. Make String Anti-palindrome", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/make-string-anti-palindrome", + "solutionLink": "#" + }, + { + "problemName": "3089. Find Bursty Behavior", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/find-bursty-behavior", + "solutionLink": "#" + }, + { + "problemName": "3090. Maximum Length Substring With Two Occurrences", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/maximum-length-substring-with-two-occurrences", + "solutionLink": "#" + }, + { + "problemName": "3091. Apply Operations to Make Sum of Array Greater Than or Equal to k", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/apply-operations-to-make-sum-of-array-greater-than-or-equal-to-k", + "solutionLink": "#" + }, + { + "problemName": "3092. Most Frequent IDs", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/most-frequent-ids", + "solutionLink": "#" + }, + { + "problemName": "3093. Longest Common Suffix Queries", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/longest-common-suffix-queries", + "solutionLink": "#" + }, + { + "problemName": "3094. Guess the Number Using Bitwise Questions II", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/guess-the-number-using-bitwise-questions-ii", + "solutionLink": "#" + }, + { + "problemName": "3095. Shortest Subarray With OR at Least K I", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/shortest-subarray-with-or-at-least-k-i", + "solutionLink": "#" + }, + { + "problemName": "3096. Minimum Levels to Gain More Points", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/minimum-levels-to-gain-more-points", + "solutionLink": "#" + }, + { + "problemName": "3097. Shortest Subarray With OR at Least K II", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/shortest-subarray-with-or-at-least-k-ii", + "solutionLink": "#" + }, + { + "problemName": "3098. Find the Sum of Subsequence Powers", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/find-the-sum-of-subsequence-powers", + "solutionLink": "#" + }, + { + "problemName": "3099. Harshad Number", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/harshad-number", + "solutionLink": "#" + } +]; + + + +Now, you can see the list of problems in a table format. You can click on the problem link to view the problem on the LeetCode website. You can also click on the solution link to view the solution of the problem. \ No newline at end of file