From 7909f1e9579fd6b99c173ef7591d68c2db0c7947 Mon Sep 17 00:00:00 2001
From: anoushka <theolivequeen.xyz@gmail.com>
Date: Fri, 31 May 2024 11:41:53 +0300
Subject: [PATCH] leetcode 2600 - 2699

---
 dsa-problems/leetcode-problems/2600-2699.md | 622 ++++++++++++++++++++
 1 file changed, 622 insertions(+)

diff --git a/dsa-problems/leetcode-problems/2600-2699.md b/dsa-problems/leetcode-problems/2600-2699.md
index e69de29bb..8813ca75b 100644
--- a/dsa-problems/leetcode-problems/2600-2699.md
+++ b/dsa-problems/leetcode-problems/2600-2699.md
@@ -0,0 +1,622 @@
+---
+id: 2600-2699
+title: LeetCode Problems 2600 - 2699
+sidebar_label: 2600 - 2699
+keywords:
+  - LeetCode
+  - LeetCode Problems
+  - LeetCode Problems 2600 - 2699
+  - DSA problems
+---
+
+export const problems = [
+  {
+    "problemName": "2600. K Items With the Maximum Sum",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/k-items-with-the-maximum-sum",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2601. Prime Subtraction Operation",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/prime-subtraction-operation",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2602. Minimum Operations to Make All Array Elements Equal",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-operations-to-make-all-array-elements-equal",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2603. Collect Coins in a Tree",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/collect-coins-in-a-tree",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2604. Minimum Time to Eat All Grains",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-time-to-eat-all-grains",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2605. Form Smallest Number From Two Digit Arrays",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/form-smallest-number-from-two-digit-arrays",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2606. Find the Substring With Maximum Cost",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/find-the-substring-with-maximum-cost",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2607. Make K-Subarray Sums Equal",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/make-k-subarray-sums-equal",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2608. Shortest Cycle in a Graph",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/shortest-cycle-in-a-graph",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2609. Find the Longest Balanced Substring of a Binary String",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/find-the-longest-balanced-substring-of-a-binary-string",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2610. Convert an Array Into a 2D Array With Conditions",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/convert-an-array-into-a-2d-array-with-conditions",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2611. Mice and Cheese",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/mice-and-cheese",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2612. Minimum Reverse Operations",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-reverse-operations",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2613. Beautiful Pairs",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/beautiful-pairs",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2614. Prime In Diagonal",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/prime-in-diagonal",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2615. Sum of Distances",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/sum-of-distances",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2616. Minimize the Maximum Difference of Pairs",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/minimize-the-maximum-difference-of-pairs",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2617. Minimum Number of Visited Cells in a Grid",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-number-of-visited-cells-in-a-grid",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2618. Check if Object Instance of Class",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/check-if-object-instance-of-class",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2619. Array Prototype Last",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/array-prototype-last",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2620. Counter",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/counter",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2621. Sleep",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/sleep",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2622. Cache With Time Limit",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/cache-with-time-limit",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2623. Memoize",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/memoize",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2624. Snail Traversal",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/snail-traversal",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2625. Flatten Deeply Nested Array",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/flatten-deeply-nested-array",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2626. Array Reduce Transformation",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/array-reduce-transformation",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2627. Debounce",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/debounce",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2628. JSON Deep Equal",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/json-deep-equal",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2629. Function Composition",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/function-composition",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2630. Memoize II",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/memoize-ii",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2631. Group By",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/group-by",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2632. Curry",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/curry",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2633. Convert Object to JSON String",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/convert-object-to-json-string",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2634. Filter Elements from Array",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/filter-elements-from-array",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2635. Apply Transform Over Each Element in Array",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/apply-transform-over-each-element-in-array",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2636. Promise Pool",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/promise-pool",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2637. Promise Time Limit",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/promise-time-limit",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2638. Count the Number of K-Free Subsets",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/count-the-number-of-k-free-subsets",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2639. Find the Width of Columns of a Grid",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/find-the-width-of-columns-of-a-grid",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2640. Find the Score of All Prefixes of an Array",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/find-the-score-of-all-prefixes-of-an-array",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2641. Cousins in Binary Tree II",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/cousins-in-binary-tree-ii",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2642. Design Graph With Shortest Path Calculator",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/design-graph-with-shortest-path-calculator",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2643. Row With Maximum Ones",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/row-with-maximum-ones",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2644. Find the Maximum Divisibility Score",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/find-the-maximum-divisibility-score",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2645. Minimum Additions to Make Valid String",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-additions-to-make-valid-string",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2646. Minimize the Total Price of the Trips",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/minimize-the-total-price-of-the-trips",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2647. Color the Triangle Red",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/color-the-triangle-red",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2648. Generate Fibonacci Sequence",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/generate-fibonacci-sequence",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2649. Nested Array Generator",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/nested-array-generator",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2650. Design Cancellable Function",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/design-cancellable-function",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2651. Calculate Delayed Arrival Time",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/calculate-delayed-arrival-time",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2652. Sum Multiples",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/sum-multiples",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2653. Sliding Subarray Beauty",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/sliding-subarray-beauty",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2654. Minimum Number of Operations to Make All Array Elements Equal to 1",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-number-of-operations-to-make-all-array-elements-equal-to-1",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2655. Find Maximal Uncovered Ranges",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/find-maximal-uncovered-ranges",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2656. Maximum Sum With Exactly K Elements",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-sum-with-exactly-k-elements",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2657. Find the Prefix Common Array of Two Arrays",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/find-the-prefix-common-array-of-two-arrays",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2658. Maximum Number of Fish in a Grid",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-number-of-fish-in-a-grid",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2659. Make Array Empty",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/make-array-empty",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2660. Determine the Winner of a Bowling Game",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/determine-the-winner-of-a-bowling-game",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2661. First Completely Painted Row or Column",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/first-completely-painted-row-or-column",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2662. Minimum Cost of a Path With Special Roads",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-cost-of-a-path-with-special-roads",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2663. Lexicographically Smallest Beautiful String",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/lexicographically-smallest-beautiful-string",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2664. The Knight�s Tour",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/the-knights-tour",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2665. Counter II",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/counter-ii",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2666. Allow One Function Call",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/allow-one-function-call",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2667. Create Hello World Function",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/create-hello-world-function",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2668. Find Latest Salaries",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/find-latest-salaries",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2669. Count Artist Occurrences On Spotify Ranking List",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/count-artist-occurrences-on-spotify-ranking-list",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2670. Find the Distinct Difference Array",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/find-the-distinct-difference-array",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2671. Frequency Tracker",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/frequency-tracker",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2672. Number of Adjacent Elements With the Same Color",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/number-of-adjacent-elements-with-the-same-color",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2673. Make Costs of Paths Equal in a Binary Tree",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/make-costs-of-paths-equal-in-a-binary-tree",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2674. Split a Circular Linked List",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/split-a-circular-linked-list",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2675. Array of Objects to Matrix",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/array-of-objects-to-matrix",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2676. Throttle",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/throttle",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2677. Chunk Array",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/chunk-array",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2678. Number of Senior Citizens",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/number-of-senior-citizens",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2679. Sum in a Matrix",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/sum-in-a-matrix",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2680. Maximum OR",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-or",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2681. Power of Heroes",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/power-of-heroes",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2682. Find the Losers of the Circular Game",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/find-the-losers-of-the-circular-game",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2683. Neighboring Bitwise XOR",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/neighboring-bitwise-xor",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2684. Maximum Number of Moves in a Grid",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-number-of-moves-in-a-grid",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2685. Count the Number of Complete Components",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/count-the-number-of-complete-components",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2686. Immediate Food Delivery III",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/immediate-food-delivery-iii",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2687. Bikes Last Time Used",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/bikes-last-time-used",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2688. Find Active Users",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/find-active-users",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2689. Extract Kth Character From The Rope Tree",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/extract-kth-character-from-the-rope-tree",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2690. Infinite Method Object",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/infinite-method-object",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2691. Immutability Helper",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/immutability-helper",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2692. Make Object Immutable",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/make-object-immutable",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2693. Call Function with Custom Context",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/call-function-with-custom-context",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2694. Event Emitter",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/event-emitter",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2695. Array Wrapper",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/array-wrapper",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2696. Minimum String Length After Removing Substrings",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-string-length-after-removing-substrings",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2697. Lexicographically Smallest Palindrome",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/lexicographically-smallest-palindrome",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2698. Find the Punishment Number of an Integer",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/find-the-punishment-number-of-an-integer",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "2699. Modify Graph Edge Weights",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/modify-graph-edge-weights",
+    "solutionLink": "#"
+  }
+];
+
+<Table 
+    title=""
+    data={problems}
+    isSorted={false}
+    collectionLink="https://leetcode.com/study-plan/programming-skills"
+/>
+
+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