From b247ee2ff28d6a6dc205029a82505959e3976ac6 Mon Sep 17 00:00:00 2001 From: anoushka Date: Tue, 28 May 2024 12:23:23 +0300 Subject: [PATCH] leetcode 1700 - 1799 --- dsa-problems/leetcode-problems/1700-1799.md | 622 ++++++++++++++++++++ 1 file changed, 622 insertions(+) diff --git a/dsa-problems/leetcode-problems/1700-1799.md b/dsa-problems/leetcode-problems/1700-1799.md index e69de29bb..7ad4657ed 100644 --- a/dsa-problems/leetcode-problems/1700-1799.md +++ b/dsa-problems/leetcode-problems/1700-1799.md @@ -0,0 +1,622 @@ +--- +id: 1700-1799 +title: LeetCode Problems 1700 - 1799 +sidebar_label: 1700 - 1799 +keywords: + - LeetCode + - LeetCode Problems + - LeetCode Problems 1700 - 1799 + - DSA problems +--- + +export const problems = [ + { + "problemName": "1700. Number of Students Unable to Eat Lunch", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/number-of-students-unable-to-eat-lunch", + "solutionLink": "#" + }, + { + "problemName": "1701. Average Waiting Time", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/average-waiting-time", + "solutionLink": "#" + }, + { + "problemName": "1702. Maximum Binary String After Change", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/maximum-binary-string-after-change", + "solutionLink": "#" + }, + { + "problemName": "1703. Minimum Adjacent Swaps for K Consecutive Ones", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/minimum-adjacent-swaps-for-k-consecutive-ones", + "solutionLink": "#" + }, + { + "problemName": "1704. Determine if String Halves Are Alike", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/determine-if-string-halves-are-alike", + "solutionLink": "#" + }, + { + "problemName": "1705. Maximum Number of Eaten Apples", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/maximum-number-of-eaten-apples", + "solutionLink": "#" + }, + { + "problemName": "1706. Where Will the Ball Fall", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/where-will-the-ball-fall", + "solutionLink": "#" + }, + { + "problemName": "1707. Maximum XOR With an Element From Array", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/maximum-xor-with-an-element-from-array", + "solutionLink": "#" + }, + { + "problemName": "1708. Largest Subarray Length K", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/largest-subarray-length-k", + "solutionLink": "#" + }, + { + "problemName": "1709. Biggest Window Between Visits", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/biggest-window-between-visits", + "solutionLink": "#" + }, + { + "problemName": "1710. Maximum Units on a Truck", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/maximum-units-on-a-truck", + "solutionLink": "#" + }, + { + "problemName": "1711. Count Good Meals", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/count-good-meals", + "solutionLink": "#" + }, + { + "problemName": "1712. Ways to Split Array Into Three Subarrays", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/ways-to-split-array-into-three-subarrays", + "solutionLink": "#" + }, + { + "problemName": "1713. Minimum Operations to Make a Subsequence", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/minimum-operations-to-make-a-subsequence", + "solutionLink": "#" + }, + { + "problemName": "1714. Sum Of Special Evenly-Spaced Elements In Array", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/sum-of-special-evenly-spaced-elements-in-array", + "solutionLink": "#" + }, + { + "problemName": "1715. Count Apples and Oranges", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/count-apples-and-oranges", + "solutionLink": "#" + }, + { + "problemName": "1716. Calculate Money in Leetcode Bank", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/calculate-money-in-leetcode-bank", + "solutionLink": "#" + }, + { + "problemName": "1717. Maximum Score From Removing Substrings", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/maximum-score-from-removing-substrings", + "solutionLink": "#" + }, + { + "problemName": "1718. Construct the Lexicographically Largest Valid Sequence", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/construct-the-lexicographically-largest-valid-sequence", + "solutionLink": "#" + }, + { + "problemName": "1719. Number Of Ways To Reconstruct A Tree", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/number-of-ways-to-reconstruct-a-tree", + "solutionLink": "#" + }, + { + "problemName": "1720. Decode XORed Array", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/decode-xored-array", + "solutionLink": "#" + }, + { + "problemName": "1721. Swapping Nodes in a Linked List", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/swapping-nodes-in-a-linked-list", + "solutionLink": "#" + }, + { + "problemName": "1722. Minimize Hamming Distance After Swap Operations", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/minimize-hamming-distance-after-swap-operations", + "solutionLink": "#" + }, + { + "problemName": "1723. Find Minimum Time to Finish All Jobs", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/find-minimum-time-to-finish-all-jobs", + "solutionLink": "#" + }, + { + "problemName": "1724. Checking Existence of Edge Length Limited Paths II", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/checking-existence-of-edge-length-limited-paths-ii", + "solutionLink": "#" + }, + { + "problemName": "1725. Number Of Rectangles That Can Form The Largest Square", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/number-of-rectangles-that-can-form-the-largest-square", + "solutionLink": "#" + }, + { + "problemName": "1726. Tuple with Same Product", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/tuple-with-same-product", + "solutionLink": "#" + }, + { + "problemName": "1727. Largest Submatrix With Rearrangements", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/largest-submatrix-with-rearrangements", + "solutionLink": "#" + }, + { + "problemName": "1728. Cat and Mouse II", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/cat-and-mouse-ii", + "solutionLink": "#" + }, + { + "problemName": "1729. Find Followers Count", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/find-followers-count", + "solutionLink": "#" + }, + { + "problemName": "1730. Shortest Path to Get Food", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/shortest-path-to-get-food", + "solutionLink": "#" + }, + { + "problemName": "1731. The Number of Employees Which Report to Each Employee", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/the-number-of-employees-which-report-to-each-employee", + "solutionLink": "#" + }, + { + "problemName": "1732. Find the Highest Altitude", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/find-the-highest-altitude", + "solutionLink": "#" + }, + { + "problemName": "1733. Minimum Number of People to Teach", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/minimum-number-of-people-to-teach", + "solutionLink": "#" + }, + { + "problemName": "1734. Decode XORed Permutation", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/decode-xored-permutation", + "solutionLink": "#" + }, + { + "problemName": "1735. Count Ways to Make Array With Product", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/count-ways-to-make-array-with-product", + "solutionLink": "#" + }, + { + "problemName": "1736. Latest Time by Replacing Hidden Digits", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/latest-time-by-replacing-hidden-digits", + "solutionLink": "#" + }, + { + "problemName": "1737. Change Minimum Characters to Satisfy One of Three Conditions", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/change-minimum-characters-to-satisfy-one-of-three-conditions", + "solutionLink": "#" + }, + { + "problemName": "1738. Find Kth Largest XOR Coordinate Value", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/find-kth-largest-xor-coordinate-value", + "solutionLink": "#" + }, + { + "problemName": "1739. Building Boxes", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/building-boxes", + "solutionLink": "#" + }, + { + "problemName": "1740. Find Distance in a Binary Tree", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/find-distance-in-a-binary-tree", + "solutionLink": "#" + }, + { + "problemName": "1741. Find Total Time Spent by Each Employee", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/find-total-time-spent-by-each-employee", + "solutionLink": "#" + }, + { + "problemName": "1742. Maximum Number of Balls in a Box", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/maximum-number-of-balls-in-a-box", + "solutionLink": "#" + }, + { + "problemName": "1743. Restore the Array From Adjacent Pairs", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/restore-the-array-from-adjacent-pairs", + "solutionLink": "#" + }, + { + "problemName": "1744. Can You Eat Your Favorite Candy on Your Favorite Day?", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/can-you-eat-your-favorite-candy-on-your-favorite-day", + "solutionLink": "#" + }, + { + "problemName": "1745. Palindrome Partitioning IV", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/palindrome-partitioning-iv", + "solutionLink": "#" + }, + { + "problemName": "1746. Maximum Subarray Sum After One Operation", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/maximum-subarray-sum-after-one-operation", + "solutionLink": "#" + }, + { + "problemName": "1747. Leetflex Banned Accounts", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/leetflex-banned-accounts", + "solutionLink": "#" + }, + { + "problemName": "1748. Sum of Unique Elements", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/sum-of-unique-elements", + "solutionLink": "#" + }, + { + "problemName": "1749. Maximum Absolute Sum of Any Subarray", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/maximum-absolute-sum-of-any-subarray", + "solutionLink": "#" + }, + { + "problemName": "1750. Minimum Length of String After Deleting Similar Ends", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/minimum-length-of-string-after-deleting-similar-ends", + "solutionLink": "#" + }, + { + "problemName": "1751. Maximum Number of Events That Can Be Attended II", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/maximum-number-of-events-that-can-be-attended-ii", + "solutionLink": "#" + }, + { + "problemName": "1752. Check if Array Is Sorted and Rotated", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/check-if-array-is-sorted-and-rotated", + "solutionLink": "#" + }, + { + "problemName": "1753. Maximum Score From Removing Stones", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/maximum-score-from-removing-stones", + "solutionLink": "#" + }, + { + "problemName": "1754. Largest Merge Of Two Strings", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/largest-merge-of-two-strings", + "solutionLink": "#" + }, + { + "problemName": "1755. Closest Subsequence Sum", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/closest-subsequence-sum", + "solutionLink": "#" + }, + { + "problemName": "1756. Design Most Recently Used Queue", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/design-most-recently-used-queue", + "solutionLink": "#" + }, + { + "problemName": "1757. Recyclable and Low Fat Products", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/recyclable-and-low-fat-products", + "solutionLink": "#" + }, + { + "problemName": "1758. Minimum Changes To Make Alternating Binary String", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/minimum-changes-to-make-alternating-binary-string", + "solutionLink": "#" + }, + { + "problemName": "1759. Count Number of Homogenous Substrings", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/count-number-of-homogenous-substrings", + "solutionLink": "#" + }, + { + "problemName": "1760. Minimum Limit of Balls in a Bag", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/minimum-limit-of-balls-in-a-bag", + "solutionLink": "#" + }, + { + "problemName": "1761. Minimum Degree of a Connected Trio in a Graph", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/minimum-degree-of-a-connected-trio-in-a-graph", + "solutionLink": "#" + }, + { + "problemName": "1762. Buildings With an Ocean View", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/buildings-with-an-ocean-view", + "solutionLink": "#" + }, + { + "problemName": "1763. Longest Nice Substring", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/longest-nice-substring", + "solutionLink": "#" + }, + { + "problemName": "1764. Form Array by Concatenating Subarrays of Another Array", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/form-array-by-concatenating-subarrays-of-another-array", + "solutionLink": "#" + }, + { + "problemName": "1765. Map of Highest Peak", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/map-of-highest-peak", + "solutionLink": "#" + }, + { + "problemName": "1766. Tree of Coprimes", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/tree-of-coprimes", + "solutionLink": "#" + }, + { + "problemName": "1767. Find the Subtasks That Did Not Execute", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/find-the-subtasks-that-did-not-execute", + "solutionLink": "#" + }, + { + "problemName": "1768. Merge Strings Alternately", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/merge-strings-alternately", + "solutionLink": "#" + }, + { + "problemName": "1769. Minimum Number of Operations to Move All Balls to Each Box", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/minimum-number-of-operations-to-move-all-balls-to-each-box", + "solutionLink": "#" + }, + { + "problemName": "1770. Maximum Score from Performing Multiplication Operations", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/maximum-score-from-performing-multiplication-operations", + "solutionLink": "#" + }, + { + "problemName": "1771. Maximize Palindrome Length From Subsequences", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/maximize-palindrome-length-from-subsequences", + "solutionLink": "#" + }, + { + "problemName": "1772. Sort Features by Popularity", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/sort-features-by-popularity", + "solutionLink": "#" + }, + { + "problemName": "1773. Count Items Matching a Rule", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/count-items-matching-a-rule", + "solutionLink": "#" + }, + { + "problemName": "1774. Closest Dessert Cost", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/closest-dessert-cost", + "solutionLink": "#" + }, + { + "problemName": "1775. Equal Sum Arrays With Minimum Number of Operations", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/equal-sum-arrays-with-minimum-number-of-operations", + "solutionLink": "#" + }, + { + "problemName": "1776. Car Fleet II", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/car-fleet-ii", + "solutionLink": "#" + }, + { + "problemName": "1777. Product's Price for Each Store", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/products-price-for-each-store", + "solutionLink": "#" + }, + { + "problemName": "1778. Shortest Path in a Hidden Grid", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/shortest-path-in-a-hidden-grid", + "solutionLink": "#" + }, + { + "problemName": "1779. Find Nearest Point That Has the Same X or Y Coordinate", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/find-nearest-point-that-has-the-same-x-or-y-coordinate", + "solutionLink": "#" + }, + { + "problemName": "1780. Check if Number is a Sum of Powers of Three", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/check-if-number-is-a-sum-of-powers-of-three", + "solutionLink": "#" + }, + { + "problemName": "1781. Sum of Beauty of All Substrings", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/sum-of-beauty-of-all-substrings", + "solutionLink": "#" + }, + { + "problemName": "1782. Count Pairs Of Nodes", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/count-pairs-of-nodes", + "solutionLink": "#" + }, + { + "problemName": "1783. Grand Slam Titles", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/grand-slam-titles", + "solutionLink": "#" + }, + { + "problemName": "1784. Check if Binary String Has at Most One Segment of Ones", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/check-if-binary-string-has-at-most-one-segment-of-ones", + "solutionLink": "#" + }, + { + "problemName": "1785. Minimum Elements to Add to Form a Given Sum", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/minimum-elements-to-add-to-form-a-given-sum", + "solutionLink": "#" + }, + { + "problemName": "1786. Number of Restricted Paths From First to Last Node", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/number-of-restricted-paths-from-first-to-last-node", + "solutionLink": "#" + }, + { + "problemName": "1787. Make the XOR of All Segments Equal to Zero", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/make-the-xor-of-all-segments-equal-to-zero", + "solutionLink": "#" + }, + { + "problemName": "1788. Maximize the Beauty of the Garden", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/maximize-the-beauty-of-the-garden", + "solutionLink": "#" + }, + { + "problemName": "1789. Primary Department for Each Employee", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/primary-department-for-each-employee", + "solutionLink": "#" + }, + { + "problemName": "1790. Check if One String Swap Can Make Strings Equal", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/check-if-one-string-swap-can-make-strings-equal", + "solutionLink": "#" + }, + { + "problemName": "1791. Find Center of Star Graph", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/find-center-of-star-graph", + "solutionLink": "#" + }, + { + "problemName": "1792. Maximum Average Pass Ratio", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/maximum-average-pass-ratio", + "solutionLink": "#" + }, + { + "problemName": "1793. Maximum Score of a Good Subarray", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/maximum-score-of-a-good-subarray", + "solutionLink": "#" + }, + { + "problemName": "1794. Count Pairs of Equal Substrings With Minimum Difference", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/count-pairs-of-equal-substrings-with-minimum-difference", + "solutionLink": "#" + }, + { + "problemName": "1795. Rearrange Products Table", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/rearrange-products-table", + "solutionLink": "#" + }, + { + "problemName": "1796. Second Largest Digit in a String", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/second-largest-digit-in-a-string", + "solutionLink": "#" + }, + { + "problemName": "1797. Design Authentication Manager", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/design-authentication-manager", + "solutionLink": "#" + }, + { + "problemName": "1798. Maximum Number of Consecutive Values You Can Make", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/maximum-number-of-consecutive-values-you-can-make", + "solutionLink": "#" + }, + { + "problemName": "1799. Maximize Score After N Operations", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/maximize-score-after-n-operations", + "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