Skip to main content

LeetCode Problems 1600 - 1699

Start Practicing: https://leetcode.com/study-plan/programming-skills

Problem NameDifficultySolution Link
1600. Throne InheritanceMediumView Solutions
1601. Maximum Number of Achievable Transfer RequestsHardView Solutions
1602. Find Nearest Right Node in Binary TreeMediumView Solutions
1603. Design Parking SystemEasyView Solutions
1604. Alert Using Same Key-Card Three or More Times in a One Hour PeriodMediumView Solutions
1605. Find Valid Matrix Given Row and Column SumsMediumView Solutions
1606. Find Servers That Handled Most Number of RequestsHardView Solutions
1607. Sellers With No SalesEasyView Solutions
1608. Special Array With X Elements Greater Than or Equal XEasyView Solutions
1609. Even Odd TreeMediumView Solutions
1610. Maximum Number of Visible PointsHardView Solutions
1611. Minimum One Bit Operations to Make Integers ZeroHardView Solutions
1612. Check If Two Expression Trees are EquivalentMediumView Solutions
1613. Find the Missing IDsMediumView Solutions
1614. Maximum Nesting Depth of the ParenthesesEasyView Solutions
1615. Maximal Network RankMediumView Solutions
1616. Split Two Strings to Make PalindromeMediumView Solutions
1617. Count Subtrees With Max Distance Between CitiesHardView Solutions
1618. Maximum Font to Fit a Sentence in a ScreenMediumView Solutions
1619. Mean of Array After Removing Some ElementsEasyView Solutions
1620. Coordinate With Maximum Network QualityMediumView Solutions
1621. Number of Sets of K Non-Overlapping Line SegmentsMediumView Solutions
1622. Fancy SequenceHardView Solutions
1623. All Valid Triplets That Can Represent a CountryEasyView Solutions
1624. Largest Substring Between Two Equal CharactersEasyView Solutions
1625. Lexicographically Smallest String After Applying OperationsMediumView Solutions
1626. Best Team With No ConflictsMediumView Solutions
1627. Graph Connectivity With ThresholdHardView Solutions
1628. Design an Expression Tree With Evaluate FunctionMediumView Solutions
1629. Slowest KeyEasyView Solutions
1630. Arithmetic SubarraysMediumView Solutions
1631. Path With Minimum EffortMediumView Solutions
1632. Rank Transform of a MatrixHardView Solutions
1633. Percentage of Users Attended a ContestEasyView Solutions
1634. Add Two Polynomials Represented as Linked ListsMediumView Solutions
1635. Hopper Company Queries IHardView Solutions
1636. Sort Array by Increasing FrequencyEasyView Solutions
1637. Widest Vertical Area Between Two Points Containing No PointsEasyView Solutions
1638. Count Substrings That Differ by One CharacterMediumView Solutions
1639. Number of Ways to Form a Target String Given a DictionaryHardView Solutions
1640. Check Array Formation Through ConcatenationEasyView Solutions
1641. Count Sorted Vowel StringsMediumView Solutions
1642. Furthest Building You Can ReachMediumView Solutions
1643. Kth Smallest InstructionsHardView Solutions
1644. Lowest Common Ancestor of a Binary Tree IIMediumView Solutions
1645. Hopper Company Queries IIHardView Solutions
1646. Get Maximum in Generated ArrayEasyView Solutions
1647. Minimum Deletions to Make Character Frequencies UniqueMediumView Solutions
1648. Sell Diminishing-Valued Colored BallsMediumView Solutions
1649. Create Sorted Array through InstructionsHardView Solutions
1650. Lowest Common Ancestor of a Binary Tree IIIMediumView Solutions
1651. Hopper Company Queries IIIHardView Solutions
1652. Defuse the BombEasyView Solutions
1653. Minimum Deletions to Make String BalancedMediumView Solutions
1654. Minimum Jumps to Reach HomeMediumView Solutions
1655. Distribute Repeating IntegersHardView Solutions
1656. Design an Ordered StreamEasyView Solutions
1657. Determine if Two Strings Are CloseMediumView Solutions
1658. Minimum Operations to Reduce X to ZeroMediumView Solutions
1659. Maximize Grid HappinessHardView Solutions
1660. Correct a Binary TreeMediumView Solutions
1661. Average Time of Process per MachineEasyView Solutions
1662. Check If Two String Arrays are EquivalentEasyView Solutions
1663. Smallest String With A Given Numeric ValueMediumView Solutions
1664. Ways to Make a Fair ArrayMediumView Solutions
1665. Minimum Initial Energy to Finish TasksHardView Solutions
1666. Change the Root of a Binary TreeMediumView Solutions
1667. Fix Names in a TableEasyView Solutions
1668. Maximum Repeating SubstringEasyView Solutions
1669. Merge In Between Linked ListsMediumView Solutions
1670. Design Front Middle Back QueueMediumView Solutions
1671. Minimum Number of Removals to Make Mountain ArrayHardView Solutions
1672. Richest Customer WealthEasyView Solutions
1673. Find the Most Competitive SubsequenceMediumView Solutions
1674. Minimum Moves to Make Array ComplementaryMediumView Solutions
1675. Minimize Deviation in ArrayHardView Solutions
1676. Lowest Common Ancestor of a Binary Tree IVMediumView Solutions
1677. Product's Worth Over InvoicesEasyView Solutions
1678. Goal Parser InterpretationEasyView Solutions
1679. Max Number of K-Sum PairsMediumView Solutions
1680. Concatenation of Consecutive Binary NumbersMediumView Solutions
1681. Minimum IncompatibilityHardView Solutions
1682. Longest Palindromic Subsequence IIMediumView Solutions
1683. Invalid TweetsEasyView Solutions
1684. Count the Number of Consistent StringsEasyView Solutions
1685. Sum of Absolute Differences in a Sorted ArrayMediumView Solutions
1686. Stone Game VIMediumView Solutions
1687. Delivering Boxes from Storage to PortsHardView Solutions
1688. Count of Matches in TournamentEasyView Solutions
1689. Partitioning Into Minimum Number Of Deci-Binary NumbersMediumView Solutions
1690. Stone Game VIIMediumView Solutions
1691. Maximum Height by Stacking CuboidsHardView Solutions
1692. Count Ways to Distribute CandiesHardView Solutions
1693. Daily Leads and PartnersEasyView Solutions
1694. Reformat Phone NumberEasyView Solutions
1695. Maximum Erasure ValueMediumView Solutions
1696. Jump Game VIMediumView Solutions
1697. Checking Existence of Edge Length Limited PathsHardView Solutions
1698. Number of Distinct Substrings in a StringMediumView Solutions
1699. Number of Calls Between Two PersonsMediumView Solutions

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.