list-17

Question	Free?	Status	Difficulty	Topics	Similar Questions
1601. Maximum Number of Achievable Transfer Requests  🔗  📝	🆓		⭐️⭐️⭐️	Array  🔗 Backtracking  🔗 Bit Manipulation  🔗 Enumeration  🔗
1602. Find Nearest Right Node in Binary Tree  🔗  📝	💰		⭐️⭐️	Tree  🔗 Breadth-First Search  🔗 Binary Tree  🔗
1603. Design Parking System  🔗  📝	🆓	✅	⭐️	Design  🔗 Simulation  🔗 Counting  🔗
1604. Alert Using Same Key-Card Three or More Times in a One Hour Period  🔗  📝	🆓		⭐️⭐️	Array  🔗 Hash Table  🔗 String  🔗 Sorting  🔗
1605. Find Valid Matrix Given Row and Column Sums  🔗  📝	🆓		⭐️⭐️	Array  🔗 Greedy  🔗 Matrix  🔗	1253. Reconstruct a 2-Row Binary Matrix  🔗  📝
1606. Find Servers That Handled Most Number of Requests  🔗  📝	🆓		⭐️⭐️⭐️	Array  🔗 Greedy  🔗 Heap (Priority Queue)  🔗 Ordered Set  🔗
1607. Sellers With No Sales  🔗  📝	💰		⭐️	Database  🔗	1581. Customer Who Visited but Did Not Make Any Transactions  🔗  📝
1608. Special Array With X Elements Greater Than or Equal X  🔗  📝	🆓	✅	⭐️	Array  🔗 Binary Search  🔗 Sorting  🔗
1609. Even Odd Tree  🔗  📝	🆓		⭐️⭐️	Tree  🔗 Breadth-First Search  🔗 Binary Tree  🔗
1610. Maximum Number of Visible Points  🔗  📝	🆓		⭐️⭐️⭐️	Array  🔗 Math  🔗 Geometry  🔗 Sliding Window  🔗 Sorting  🔗
1611. Minimum One Bit Operations to Make Integers Zero  🔗  📝	🆓		⭐️⭐️⭐️	Dynamic Programming  🔗 Bit Manipulation  🔗 Memoization  🔗	2009. Minimum Number of Operations to Make Array Continuous  🔗  📝
1612. Check If Two Expression Trees are Equivalent  🔗  📝	💰		⭐️⭐️	Tree  🔗 Depth-First Search  🔗 Binary Tree  🔗	1597. Build Binary Expression Tree From Infix Expression  🔗  📝 2313. Minimum Flips in Binary Tree to Get Result  🔗  📝 2331. Evaluate Boolean Binary Tree  🔗  📝
1613. Find the Missing IDs  🔗  📝	💰		⭐️⭐️	Database  🔗	1225. Report Contiguous Dates  🔗  📝 1285. Find the Start and End Number of Continuous Ranges  🔗  📝 1336. Number of Transactions per Visit  🔗  📝
1614. Maximum Nesting Depth of the Parentheses  🔗  📝	🆓	✅	⭐️	String  🔗 Stack  🔗	1111. Maximum Nesting Depth of Two Valid Parentheses Strings  🔗  📝
1615. Maximal Network Rank  🔗  📝	🆓		⭐️⭐️	Graph  🔗
1616. Split Two Strings to Make Palindrome  🔗  📝	🆓		⭐️⭐️	Two Pointers  🔗 String  🔗
1617. Count Subtrees With Max Distance Between Cities  🔗  📝	🆓		⭐️⭐️⭐️	Dynamic Programming  🔗 Bit Manipulation  🔗 Tree  🔗 Enumeration  🔗 Bitmask  🔗	1245. Tree Diameter  🔗  📝
1618. Maximum Font to Fit a Sentence in a Screen  🔗  📝	💰		⭐️⭐️	Array  🔗 String  🔗 Binary Search  🔗 Interactive  🔗
1619. Mean of Array After Removing Some Elements  🔗  📝	🆓		⭐️	Array  🔗 Sorting  🔗
1620. Coordinate With Maximum Network Quality  🔗  📝	🆓		⭐️⭐️	Array  🔗 Enumeration  🔗
1621. Number of Sets of K Non-Overlapping Line Segments  🔗  📝	🆓		⭐️⭐️	Math  🔗 Dynamic Programming  🔗
1622. Fancy Sequence  🔗  📝	🆓		⭐️⭐️⭐️	Math  🔗 Design  🔗 Segment Tree  🔗
1623. All Valid Triplets That Can Represent a Country  🔗  📝	💰		⭐️	Database  🔗
1624. Largest Substring Between Two Equal Characters  🔗  📝	🆓	✅	⭐️	Hash Table  🔗 String  🔗
1625. Lexicographically Smallest String After Applying Operations  🔗  📝	🆓		⭐️⭐️	String  🔗 Breadth-First Search  🔗
1626. Best Team With No Conflicts  🔗  📝	🆓		⭐️⭐️	Array  🔗 Dynamic Programming  🔗 Sorting  🔗
1627. Graph Connectivity With Threshold  🔗  📝	🆓		⭐️⭐️⭐️	Array  🔗 Math  🔗 Union Find  🔗
1628. Design an Expression Tree With Evaluate Function  🔗  📝	💰		⭐️⭐️	Math  🔗 Stack  🔗 Tree  🔗 Design  🔗 Binary Tree  🔗	2313. Minimum Flips in Binary Tree to Get Result  🔗  📝 2331. Evaluate Boolean Binary Tree  🔗  📝
1629. Slowest Key  🔗  📝	🆓		⭐️	Array  🔗 String  🔗
1630. Arithmetic Subarrays  🔗  📝	🆓		⭐️⭐️	Array  🔗 Sorting  🔗	413. Arithmetic Slices  🔗  📝 1502. Can Make Arithmetic Progression From Sequence  🔗  📝
1631. Path With Minimum Effort  🔗  📝	🆓		⭐️⭐️	Array  🔗 Binary Search  🔗 Depth-First Search  🔗 Breadth-First Search  🔗 Union Find  🔗 Heap (Priority Queue)  🔗 Matrix  🔗	778. Swim in Rising Water  🔗  📝 1102. Path With Maximum Minimum Value  🔗  📝
1632. Rank Transform of a Matrix  🔗  📝	🆓		⭐️⭐️⭐️	Array  🔗 Greedy  🔗 Union Find  🔗 Graph  🔗 Topological Sort  🔗 Matrix  🔗	1331. Rank Transform of an Array  🔗  📝 1998. GCD Sort of an Array  🔗  📝
1633. Percentage of Users Attended a Contest  🔗  📝	💰		⭐️	Database  🔗	1211. Queries Quality and Percentage  🔗  📝
1634. Add Two Polynomials Represented as Linked Lists  🔗  📝	💰		⭐️⭐️	Linked List  🔗 Math  🔗 Two Pointers  🔗	2. Add Two Numbers  🔗  📝 21. Merge Two Sorted Lists  🔗  📝 445. Add Two Numbers II  🔗  📝
1635. Hopper Company Queries I  🔗  📝	💰		⭐️⭐️⭐️	Database  🔗	262. Trips and Users  🔗  📝 1645. Hopper Company Queries II  🔗  📝 1651. Hopper Company Queries III  🔗  📝 2238. Number of Times a Driver Was a Passenger  🔗  📝
1636. Sort Array by Increasing Frequency  🔗  📝	🆓	✅	⭐️	Array  🔗 Hash Table  🔗 Sorting  🔗	451. Sort Characters By Frequency  🔗  📝 2190. Most Frequent Number Following Key In an Array  🔗  📝 2206. Divide Array Into Equal Pairs  🔗  📝 2341. Maximum Number of Pairs in Array  🔗  📝
1637. Widest Vertical Area Between Two Points Containing No Points  🔗  📝	🆓		⭐️⭐️	Array  🔗 Sorting  🔗
1638. Count Substrings That Differ by One Character  🔗  📝	🆓		⭐️⭐️	Hash Table  🔗 String  🔗 Dynamic Programming  🔗	2135. Count Words Obtained After Adding a Letter  🔗  📝
1639. Number of Ways to Form a Target String Given a Dictionary  🔗  📝	🆓		⭐️⭐️⭐️	Array  🔗 String  🔗 Dynamic Programming  🔗
1640. Check Array Formation Through Concatenation  🔗  📝	🆓		⭐️	Array  🔗 Hash Table  🔗
1641. Count Sorted Vowel Strings  🔗  📝	🆓	✅	⭐️⭐️	Dynamic Programming  🔗
1642. Furthest Building You Can Reach  🔗  📝	🆓		⭐️⭐️	Array  🔗 Greedy  🔗 Heap (Priority Queue)  🔗
1643. Kth Smallest Instructions  🔗  📝	🆓		⭐️⭐️⭐️	Array  🔗 Math  🔗 Dynamic Programming  🔗 Combinatorics  🔗
1644. Lowest Common Ancestor of a Binary Tree II  🔗  📝	💰		⭐️⭐️	Tree  🔗 Depth-First Search  🔗 Binary Tree  🔗	235. Lowest Common Ancestor of a Binary Search Tree  🔗  📝 236. Lowest Common Ancestor of a Binary Tree  🔗  📝 1650. Lowest Common Ancestor of a Binary Tree III  🔗  📝 1676. Lowest Common Ancestor of a Binary Tree IV  🔗  📝
1645. Hopper Company Queries II  🔗  📝	💰		⭐️⭐️⭐️	Database  🔗	262. Trips and Users  🔗  📝 1635. Hopper Company Queries I  🔗  📝 1651. Hopper Company Queries III  🔗  📝 2238. Number of Times a Driver Was a Passenger  🔗  📝
1646. Get Maximum in Generated Array  🔗  📝	🆓	👀	⭐️	Array  🔗 Dynamic Programming  🔗 Simulation  🔗
1647. Minimum Deletions to Make Character Frequencies Unique  🔗  📝	🆓		⭐️⭐️	String  🔗 Greedy  🔗 Sorting  🔗	2091. Removing Minimum and Maximum From Array  🔗  📝 2216. Minimum Deletions to Make Array Beautiful  🔗  📝
1648. Sell Diminishing-Valued Colored Balls  🔗  📝	🆓		⭐️⭐️	Array  🔗 Math  🔗 Binary Search  🔗 Greedy  🔗 Sorting  🔗 Heap (Priority Queue)  🔗	2141. Maximum Running Time of N Computers  🔗  📝
1649. Create Sorted Array through Instructions  🔗  📝	🆓		⭐️⭐️⭐️	Array  🔗 Binary Search  🔗 Divide and Conquer  🔗 Binary Indexed Tree  🔗 Segment Tree  🔗 Merge Sort  🔗 Ordered Set  🔗	2179. Count Good Triplets in an Array  🔗  📝 2213. Longest Substring of One Repeating Character  🔗  📝
1650. Lowest Common Ancestor of a Binary Tree III  🔗  📝	💰		⭐️⭐️	Hash Table  🔗 Tree  🔗 Binary Tree  🔗	235. Lowest Common Ancestor of a Binary Search Tree  🔗  📝 236. Lowest Common Ancestor of a Binary Tree  🔗  📝 1644. Lowest Common Ancestor of a Binary Tree II  🔗  📝 1676. Lowest Common Ancestor of a Binary Tree IV  🔗  📝
1651. Hopper Company Queries III  🔗  📝	💰		⭐️⭐️⭐️	Database  🔗	262. Trips and Users  🔗  📝 1635. Hopper Company Queries I  🔗  📝 1645. Hopper Company Queries II  🔗  📝 2238. Number of Times a Driver Was a Passenger  🔗  📝
1652. Defuse the Bomb  🔗  📝	🆓	✅	⭐️	Array  🔗
1653. Minimum Deletions to Make String Balanced  🔗  📝	🆓		⭐️⭐️	String  🔗 Dynamic Programming  🔗 Stack  🔗	2124. Check if All A's Appears Before All B's  🔗  📝
1654. Minimum Jumps to Reach Home  🔗  📝	🆓		⭐️⭐️	Array  🔗 Dynamic Programming  🔗 Breadth-First Search  🔗	2368. Reachable Nodes With Restrictions  🔗  📝
1655. Distribute Repeating Integers  🔗  📝	🆓		⭐️⭐️⭐️	Array  🔗 Dynamic Programming  🔗 Backtracking  🔗 Bit Manipulation  🔗 Bitmask  🔗
1656. Design an Ordered Stream  🔗  📝	🆓		⭐️	Array  🔗 Hash Table  🔗 Design  🔗 Data Stream  🔗
1657. Determine if Two Strings Are Close  🔗  📝	🆓		⭐️⭐️	Hash Table  🔗 String  🔗 Sorting  🔗	859. Buddy Strings  🔗  📝 1247. Minimum Swaps to Make Strings Equal  🔗  📝 1347. Minimum Number of Steps to Make Two Strings Anagram  🔗  📝
1658. Minimum Operations to Reduce X to Zero  🔗  📝	🆓		⭐️⭐️	Array  🔗 Hash Table  🔗 Binary Search  🔗 Sliding Window  🔗 Prefix Sum  🔗	209. Minimum Size Subarray Sum  🔗  📝 560. Subarray Sum Equals K  🔗  📝 2059. Minimum Operations to Convert Number  🔗  📝 2171. Removing Minimum Number of Magic Beans  🔗  📝
1659. Maximize Grid Happiness  🔗  📝	🆓		⭐️⭐️⭐️	Dynamic Programming  🔗 Bit Manipulation  🔗 Memoization  🔗 Bitmask  🔗
1660. Correct a Binary Tree  🔗  📝	💰		⭐️⭐️	Hash Table  🔗 Tree  🔗 Depth-First Search  🔗 Breadth-First Search  🔗 Binary Tree  🔗	114. Flatten Binary Tree to Linked List  🔗  📝 430. Flatten a Multilevel Doubly Linked List  🔗  📝
1661. Average Time of Process per Machine  🔗  📝	💰		⭐️	Database  🔗
1662. Check If Two String Arrays are Equivalent  🔗  📝	🆓	✅	⭐️	Array  🔗 String  🔗	2060. Check if an Original String Exists Given Two Encoded Strings  🔗  📝
1663. Smallest String With A Given Numeric Value  🔗  📝	🆓	✅	⭐️⭐️	String  🔗 Greedy  🔗
1664. Ways to Make a Fair Array  🔗  📝	🆓		⭐️⭐️	Array  🔗 Dynamic Programming  🔗
1665. Minimum Initial Energy to Finish Tasks  🔗  📝	🆓		⭐️⭐️⭐️	Array  🔗 Greedy  🔗 Sorting  🔗
1666. Change the Root of a Binary Tree  🔗  📝	💰		⭐️⭐️	Tree  🔗 Depth-First Search  🔗 Binary Tree  🔗
1667. Fix Names in a Table  🔗  📝	🆓		⭐️	Database  🔗
1668. Maximum Repeating Substring  🔗  📝	🆓	✅	⭐️	String  🔗 String Matching  🔗	1566. Detect Pattern of Length M Repeated K or More Times  🔗  📝
1669. Merge In Between Linked Lists  🔗  📝	🆓	✅	⭐️⭐️	Linked List  🔗
1670. Design Front Middle Back Queue  🔗  📝	🆓		⭐️⭐️	Array  🔗 Linked List  🔗 Design  🔗 Queue  🔗 Data Stream  🔗	622. Design Circular Queue  🔗  📝 641. Design Circular Deque  🔗  📝
1671. Minimum Number of Removals to Make Mountain Array  🔗  📝	🆓		⭐️⭐️⭐️	Array  🔗 Binary Search  🔗 Dynamic Programming  🔗 Greedy  🔗	300. Longest Increasing Subsequence  🔗  📝 845. Longest Mountain in Array  🔗  📝 852. Peak Index in a Mountain Array  🔗  📝 941. Valid Mountain Array  🔗  📝 1095. Find in Mountain Array  🔗  📝
1672. Richest Customer Wealth  🔗  📝	🆓	✅	⭐️	Array  🔗 Matrix  🔗
1673. Find the Most Competitive Subsequence  🔗  📝	🆓		⭐️⭐️	Array  🔗 Stack  🔗 Greedy  🔗 Monotonic Stack  🔗	402. Remove K Digits  🔗  📝 1081. Smallest Subsequence of Distinct Characters  🔗  📝
1674. Minimum Moves to Make Array Complementary  🔗  📝	🆓		⭐️⭐️	Array  🔗 Hash Table  🔗 Prefix Sum  🔗
1675. Minimize Deviation in Array  🔗  📝	🆓		⭐️⭐️⭐️	Array  🔗 Greedy  🔗 Heap (Priority Queue)  🔗 Ordered Set  🔗
1676. Lowest Common Ancestor of a Binary Tree IV  🔗  📝	💰		⭐️⭐️	Tree  🔗 Depth-First Search  🔗 Binary Tree  🔗	235. Lowest Common Ancestor of a Binary Search Tree  🔗  📝 236. Lowest Common Ancestor of a Binary Tree  🔗  📝 1123. Lowest Common Ancestor of Deepest Leaves  🔗  📝 1644. Lowest Common Ancestor of a Binary Tree II  🔗  📝 1650. Lowest Common Ancestor of a Binary Tree III  🔗  📝 1676. Lowest Common Ancestor of a Binary Tree IV  🔗  📝
1677. Product's Worth Over Invoices  🔗  📝	💰		⭐️	Database  🔗
1678. Goal Parser Interpretation  🔗  📝	🆓	✅	⭐️	String  🔗
1679. Max Number of K-Sum Pairs  🔗  📝	🆓	✅	⭐️⭐️	Array  🔗 Hash Table  🔗 Two Pointers  🔗 Sorting  🔗	1. Two Sum  🔗  📝 1711. Count Good Meals  🔗  📝
1680. Concatenation of Consecutive Binary Numbers  🔗  📝	🆓	✅	⭐️⭐️	Math  🔗 Bit Manipulation  🔗 Simulation  🔗
1681. Minimum Incompatibility  🔗  📝	🆓		⭐️⭐️⭐️	Array  🔗 Dynamic Programming  🔗 Bit Manipulation  🔗 Bitmask  🔗
1682. Longest Palindromic Subsequence II  🔗  📝	💰		⭐️⭐️	String  🔗 Dynamic Programming  🔗	516. Longest Palindromic Subsequence  🔗  📝
1683. Invalid Tweets  🔗  📝	💰		⭐️	Database  🔗
1684. Count the Number of Consistent Strings  🔗  📝	🆓	✅	⭐️	Array  🔗 Hash Table  🔗 String  🔗 Bit Manipulation  🔗
1685. Sum of Absolute Differences in a Sorted Array  🔗  📝	🆓		⭐️⭐️	Array  🔗 Math  🔗 Prefix Sum  🔗
1686. Stone Game VI  🔗  📝	🆓		⭐️⭐️	Array  🔗 Math  🔗 Greedy  🔗 Sorting  🔗 Heap (Priority Queue)  🔗 Game Theory  🔗	877. Stone Game  🔗  📝 1140. Stone Game II  🔗  📝 1406. Stone Game III  🔗  📝 1510. Stone Game IV  🔗  📝 1563. Stone Game V  🔗  📝 1690. Stone Game VII  🔗  📝 1872. Stone Game VIII  🔗  📝 2029. Stone Game IX  🔗  📝
1687. Delivering Boxes from Storage to Ports  🔗  📝	🆓		⭐️⭐️⭐️	Array  🔗 Dynamic Programming  🔗 Segment Tree  🔗 Queue  🔗 Heap (Priority Queue)  🔗 Monotonic Queue  🔗
1688. Count of Matches in Tournament  🔗  📝	🆓	✅	⭐️	Math  🔗 Simulation  🔗
1689. Partitioning Into Minimum Number Of Deci-Binary Numbers  🔗  📝	🆓	✅	⭐️⭐️	String  🔗 Greedy  🔗
1690. Stone Game VII  🔗  📝	🆓		⭐️⭐️	Array  🔗 Math  🔗 Dynamic Programming  🔗 Game Theory  🔗	877. Stone Game  🔗  📝 1140. Stone Game II  🔗  📝 1406. Stone Game III  🔗  📝 1510. Stone Game IV  🔗  📝 1563. Stone Game V  🔗  📝 1686. Stone Game VI  🔗  📝 1770. Maximum Score from Performing Multiplication Operations  🔗  📝 1872. Stone Game VIII  🔗  📝 2029. Stone Game IX  🔗  📝
1691. Maximum Height by Stacking Cuboids   🔗  📝	🆓		⭐️⭐️⭐️	Array  🔗 Dynamic Programming  🔗 Sorting  🔗	1996. The Number of Weak Characters in the Game  🔗  📝 2358. Maximum Number of Groups Entering a Competition  🔗  📝
1692. Count Ways to Distribute Candies  🔗  📝	💰		⭐️⭐️⭐️	Dynamic Programming  🔗
1693. Daily Leads and Partners  🔗  📝	🆓		⭐️	Database  🔗
1694. Reformat Phone Number  🔗  📝	🆓	✅	⭐️	String  🔗
1695. Maximum Erasure Value  🔗  📝	🆓		⭐️⭐️	Array  🔗 Hash Table  🔗 Sliding Window  🔗	3. Longest Substring Without Repeating Characters  🔗  📝
1696. Jump Game VI  🔗  📝	🆓		⭐️⭐️	Array  🔗 Dynamic Programming  🔗 Queue  🔗 Sliding Window  🔗 Heap (Priority Queue)  🔗 Monotonic Queue  🔗	239. Sliding Window Maximum  🔗  📝 1871. Jump Game VII  🔗  📝 2297. Jump Game VIII  🔗  📝
1697. Checking Existence of Edge Length Limited Paths  🔗  📝	🆓		⭐️⭐️⭐️	Array  🔗 Union Find  🔗 Graph  🔗 Sorting  🔗	1724. Checking Existence of Edge Length Limited Paths II  🔗  📝
1698. Number of Distinct Substrings in a String  🔗  📝	💰		⭐️⭐️	String  🔗 Trie  🔗 Rolling Hash  🔗 Suffix Array  🔗 Hash Function  🔗
1699. Number of Calls Between Two Persons  🔗  📝	💰		⭐️⭐️	Database  🔗
1700. Number of Students Unable to Eat Lunch  🔗  📝	🆓		⭐️	Array  🔗 Stack  🔗 Queue  🔗 Simulation  🔗	2073. Time Needed to Buy Tickets  🔗  📝