From 5102c3307651233058834017d8efff59a8bb980e Mon Sep 17 00:00:00 2001 From: anoushka Date: Tue, 21 May 2024 11:51:20 +0300 Subject: [PATCH] leetcode 700 - 799 --- dsa-problems/leetcode-problems/0700-0799.md | 620 +++++++++++++++++++- 1 file changed, 616 insertions(+), 4 deletions(-) diff --git a/dsa-problems/leetcode-problems/0700-0799.md b/dsa-problems/leetcode-problems/0700-0799.md index a57127448..c82f100e0 100644 --- a/dsa-problems/leetcode-problems/0700-0799.md +++ b/dsa-problems/leetcode-problems/0700-0799.md @@ -4,7 +4,619 @@ title: LeetCode Problems 700 - 799 sidebar_label: 0700 - 0799 keywords: - LeetCode - - LeeCode Problems - - LeeCode Problems 700 - 799 - - dsa problems ---- \ No newline at end of file + - LeetCode Problems + - LeetCode Problems 700 - 799 + - DSA problems +--- + +export const problems = [ + { + "problemName": "700. Search in a Binary Search Tree", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/search-in-a-binary-search-tree", + "solutionLink": "#" + }, + { + "problemName": "701. Insert into a Binary Search Tree", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/insert-into-a-binary-search-tree", + "solutionLink": "#" + }, + { + "problemName": "702. Search in a Sorted Array of Unknown Size", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/search-in-a-sorted-array-of-unknown-size", + "solutionLink": "#" + }, + { + "problemName": "703. Kth Largest Element in a Stream", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/kth-largest-element-in-a-stream", + "solutionLink": "#" + }, + { + "problemName": "704. Binary Search", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/binary-search", + "solutionLink": "#" + }, + { + "problemName": "705. Design HashSet", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/design-hashset", + "solutionLink": "#" + }, + { + "problemName": "706. Design HashMap", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/design-hashmap", + "solutionLink": "#" + }, + { + "problemName": "707. Design Linked List", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/design-linked-list", + "solutionLink": "#" + }, + { + "problemName": "708. Insert into a Sorted Circular Linked List", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/insert-into-a-sorted-circular-linked-list", + "solutionLink": "#" + }, + { + "problemName": "709. To Lower Case", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/to-lower-case", + "solutionLink": "#" + }, + { + "problemName": "710. Random Pick with Blacklist", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/random-pick-with-blacklist", + "solutionLink": "#" + }, + { + "problemName": "711. Number of Distinct Islands II", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/number-of-distinct-islands-ii", + "solutionLink": "#" + }, + { + "problemName": "712. Minimum ASCII Delete Sum for Two Strings", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/minimum-ascii-delete-sum-for-two-strings", + "solutionLink": "#" + }, + { + "problemName": "713. Subarray Product Less Than K", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/subarray-product-less-than-k", + "solutionLink": "#" + }, + { + "problemName": "714. Best Time to Buy and Sell Stock with Transaction Fee", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-transaction-fee", + "solutionLink": "#" + }, + { + "problemName": "715. Range Module", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/range-module", + "solutionLink": "#" + }, + { + "problemName": "716. Max Stack", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/max-stack", + "solutionLink": "#" + }, + { + "problemName": "717. 1-bit and 2-bit Characters", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/1-bit-and-2-bit-characters", + "solutionLink": "#" + }, + { + "problemName": "718. Maximum Length of Repeated Subarray", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/maximum-length-of-repeated-subarray", + "solutionLink": "#" + }, + { + "problemName": "719. Find K-th Smallest Pair Distance", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/find-k-th-smallest-pair-distance", + "solutionLink": "#" + }, + { + "problemName": "720. Longest Word in Dictionary", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/longest-word-in-dictionary", + "solutionLink": "#" + }, + { + "problemName": "721. Accounts Merge", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/accounts-merge", + "solutionLink": "#" + }, + { + "problemName": "722. Remove Comments", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/remove-comments", + "solutionLink": "#" + }, + { + "problemName": "723. Candy Crush", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/candy-crush", + "solutionLink": "#" + }, + { + "problemName": "724. Find Pivot Index", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/find-pivot-index", + "solutionLink": "#" + }, + { + "problemName": "725. Split Linked List in Parts", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/split-linked-list-in-parts", + "solutionLink": "#" + }, + { + "problemName": "726. Number of Atoms", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/number-of-atoms", + "solutionLink": "#" + }, + { + "problemName": "727. Minimum Window Subsequence", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/minimum-window-subsequence", + "solutionLink": "#" + }, + { + "problemName": "728. Self Dividing Numbers", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/self-dividing-numbers", + "solutionLink": "#" + }, + { + "problemName": "729. My Calendar I", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/my-calendar-i", + "solutionLink": "#" + }, + { + "problemName": "730. Count Different Palindromic Subsequences", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/count-different-palindromic-subsequences", + "solutionLink": "#" + }, + { + "problemName": "731. My Calendar II", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/my-calendar-ii", + "solutionLink": "#" + }, + { + "problemName": "732. My Calendar III", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/my-calendar-iii", + "solutionLink": "#" + }, + { + "problemName": "733. Flood Fill", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/flood-fill", + "solutionLink": "#" + }, + { + "problemName": "734. Sentence Similarity", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/sentence-similarity", + "solutionLink": "#" + }, + { + "problemName": "735. Asteroid Collision", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/asteroid-collision", + "solutionLink": "#" + }, + { + "problemName": "736. Parse Lisp Expression", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/parse-lisp-expression", + "solutionLink": "#" + }, + { + "problemName": "737. Sentence Similarity II", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/sentence-similarity-ii", + "solutionLink": "#" + }, + { + "problemName": "738. Monotone Increasing Digits", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/monotone-increasing-digits", + "solutionLink": "#" + }, + { + "problemName": "739. Daily Temperatures", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/daily-temperatures", + "solutionLink": "#" + }, + { + "problemName": "740. Delete and Earn", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/delete-and-earn", + "solutionLink": "#" + }, + { + "problemName": "741. Cherry Pickup", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/cherry-pickup", + "solutionLink": "#" + }, + { + "problemName": "742. Closest Leaf in a Binary Tree", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/closest-leaf-in-a-binary-tree", + "solutionLink": "#" + }, + { + "problemName": "743. Network Delay Time", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/network-delay-time", + "solutionLink": "#" + }, + { + "problemName": "744. Find Smallest Letter Greater Than Target", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/find-smallest-letter-greater-than-target", + "solutionLink": "#" + }, + { + "problemName": "745. Prefix and Suffix Search", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/prefix-and-suffix-search", + "solutionLink": "#" + }, + { + "problemName": "746. Min Cost Climbing Stairs", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/min-cost-climbing-stairs", + "solutionLink": "#" + }, + { + "problemName": "747. Largest Number At Least Twice of Others", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/largest-number-at-least-twice-of-others", + "solutionLink": "#" + }, + { + "problemName": "748. Shortest Completing Word", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/shortest-completing-word", + "solutionLink": "#" + }, + { + "problemName": "749. Contain Virus", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/contain-virus", + "solutionLink": "#" + }, + { + "problemName": "750. Number Of Corner Rectangles", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/number-of-corner-rectangles", + "solutionLink": "#" + }, + { + "problemName": "751. IP to CIDR", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/ip-to-cidr", + "solutionLink": "#" + }, + { + "problemName": "752. Open the Lock", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/open-the-lock", + "solutionLink": "#" + }, + { + "problemName": "753. Cracking the Safe", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/cracking-the-safe", + "solutionLink": "#" + }, + { + "problemName": "754. Reach a Number", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/reach-a-number", + "solutionLink": "#" + }, + { + "problemName": "755. Pour Water", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/pour-water", + "solutionLink": "#" + }, + { + "problemName": "756. Pyramid Transition Matrix", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/pyramid-transition-matrix", + "solutionLink": "#" + }, + { + "problemName": "757. Set Intersection Size At Least Two", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/set-intersection-size-at-least-two", + "solutionLink": "#" + }, + { + "problemName": "758. Bold Words in String", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/bold-words-in-string", + "solutionLink": "#" + }, + { + "problemName": "759. Employee Free Time", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/employee-free-time", + "solutionLink": "#" + }, + { + "problemName": "760. Find Anagram Mappings", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/find-anagram-mappings", + "solutionLink": "#" + }, + { + "problemName": "761. Special Binary String", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/special-binary-string", + "solutionLink": "#" + }, + { + "problemName": "762. Prime Number of Set Bits in Binary Representation", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/prime-number-of-set-bits-in-binary-representation", + "solutionLink": "#" + }, + { + "problemName": "763. Partition Labels", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/partition-labels", + "solutionLink": "#" + }, + { + "problemName": "764. Largest Plus Sign", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/largest-plus-sign", + "solutionLink": "#" + }, + { + "problemName": "765. Couples Holding Hands", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/couples-holding-hands", + "solutionLink": "#" + }, + { + "problemName": "766. Toeplitz Matrix", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/toeplitz-matrix", + "solutionLink": "#" + }, + { + "problemName": "767. Reorganize String", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/reorganize-string", + "solutionLink": "#" + }, + { + "problemName": "768. Max Chunks To Make Sorted II", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/max-chunks-to-make-sorted-ii", + "solutionLink": "#" + }, + { + "problemName": "769. Max Chunks To Make Sorted", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/max-chunks-to-make-sorted", + "solutionLink": "#" + }, + { + "problemName": "770. Basic Calculator IV", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/basic-calculator-iv", + "solutionLink": "#" + }, + { + "problemName": "771. Jewels and Stones", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/jewels-and-stones", + "solutionLink": "#" + }, + { + "problemName": "772. Basic Calculator III", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/basic-calculator-iii", + "solutionLink": "#" + }, + { + "problemName": "773. Sliding Puzzle", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/sliding-puzzle", + "solutionLink": "#" + }, + { + "problemName": "774. Minimize Max Distance to Gas Station", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/minimize-max-distance-to-gas-station", + "solutionLink": "#" + }, + { + "problemName": "775. Global and Local Inversions", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/global-and-local-inversions", + "solutionLink": "#" + }, + { + "problemName": "776. Split BST", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/split-bst", + "solutionLink": "#" + }, + { + "problemName": "777. Swap Adjacent in LR String", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/swap-adjacent-in-lr-string", + "solutionLink": "#" + }, + { + "problemName": "778. Swim in Rising Water", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/swim-in-rising-water", + "solutionLink": "#" + }, + { + "problemName": "779. K-th Symbol in Grammar", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/k-th-symbol-in-grammar", + "solutionLink": "#" + }, + { + "problemName": "780. Reaching Points", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/reaching-points", + "solutionLink": "#" + }, + { + "problemName": "781. Rabbits in Forest", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/rabbits-in-forest", + "solutionLink": "#" + }, + { + "problemName": "782. Transform to Chessboard", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/transform-to-chessboard", + "solutionLink": "#" + }, + { + "problemName": "783. Minimum Distance Between BST Nodes", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/minimum-distance-between-bst-nodes", + "solutionLink": "#" + }, + { + "problemName": "784. Letter Case Permutation", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/letter-case-permutation", + "solutionLink": "#" + }, + { + "problemName": "785. Is Graph Bipartite?", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/is-graph-bipartite", + "solutionLink": "#" + }, + { + "problemName": "786. K-th Smallest Prime Fraction", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/k-th-smallest-prime-fraction", + "solutionLink": "#" + }, + { + "problemName": "787. Cheapest Flights Within K Stops", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/cheapest-flights-within-k-stops", + "solutionLink": "#" + }, + { + "problemName": "788. Rotated Digits", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/rotated-digits", + "solutionLink": "#" + }, + { + "problemName": "789. Escape The Ghosts", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/escape-the-ghosts", + "solutionLink": "#" + }, + { + "problemName": "790. Domino and Tromino Tiling", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/domino-and-tromino-tiling", + "solutionLink": "#" + }, + { + "problemName": "791. Custom Sort String", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/custom-sort-string", + "solutionLink": "#" + }, + { + "problemName": "792. Number of Matching Subsequences", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/number-of-matching-subsequences", + "solutionLink": "#" + }, + { + "problemName": "793. Preimage Size of Factorial Zeroes Function", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/preimage-size-of-factorial-zeroes-function", + "solutionLink": "#" + }, + { + "problemName": "794. Valid Tic-Tac-Toe State", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/valid-tic-tac-toe-state", + "solutionLink": "#" + }, + { + "problemName": "795. Number of Subarrays with Bounded Maximum", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/number-of-subarrays-with-bounded-maximum", + "solutionLink": "#" + }, + { + "problemName": "796. Rotate String", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/rotate-string", + "solutionLink": "#" + }, + { + "problemName": "797. All Paths From Source to Target", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/all-paths-from-source-to-target", + "solutionLink": "#" + }, + { + "problemName": "798. Smallest Rotation with Highest Score", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/smallest-rotation-with-highest-score", + "solutionLink": "#" + }, + { + "problemName": "799. Champagne Tower", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/champagne-tower", + "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