- 1701. Average Waiting Time π π
|
π |
β
|
βοΈβοΈ |
- Array π
- Simulation π
|
- 2015. Average Height of Buildings in Each Segment π π
|
- 1702. Maximum Binary String After Change π π
|
π |
|
βοΈβοΈ |
- String π
- Greedy π
|
- 2311. Longest Binary Subsequence Less Than or Equal to K π π
|
- 1703. Minimum Adjacent Swaps for K Consecutive Ones π π
|
π |
|
βοΈβοΈβοΈ |
- Array π
- Greedy π
- Sliding Window π
- Prefix Sum π
|
- 1151. Minimum Swaps to Group All 1's Together π π
- 2009. Minimum Number of Operations to Make Array Continuous π π
- 2340. Minimum Adjacent Swaps to Make a Valid Array π π
|
- 1704. Determine if String Halves Are Alike π π
|
π |
β
|
βοΈ |
- String π
- Counting π
|
|
- 1705. Maximum Number of Eaten Apples π π
|
π |
|
βοΈβοΈ |
- Array π
- Greedy π
- Heap (Priority Queue) π
|
|
- 1706. Where Will the Ball Fall π π
|
π |
|
βοΈβοΈ |
- Array π
- Dynamic Programming π
- Depth-First Search π
- Matrix π
- Simulation π
|
|
- 1707. Maximum XOR With an Element From Array π π
|
π |
|
βοΈβοΈβοΈ |
- Array π
- Bit Manipulation π
- Trie π
|
- 421. Maximum XOR of Two Numbers in an Array π π
- 1938. Maximum Genetic Difference Query π π
|
- 1708. Largest Subarray Length K π π
|
π° |
|
βοΈ |
- Array π
- Greedy π
|
|
- 1709. Biggest Window Between Visits π π
|
π° |
|
βοΈβοΈ |
- Database π
|
- 2228. Users With Two Purchases Within Seven Days π π
|
- 1710. Maximum Units on a Truck π π
|
π |
β
|
βοΈ |
- Array π
- Greedy π
- Sorting π
|
- 2279. Maximum Bags With Full Capacity of Rocks π π
|
- 1711. Count Good Meals π π
|
π |
|
βοΈβοΈ |
- Array π
- Hash Table π
|
- 1. Two Sum π π
- 1679. Max Number of K-Sum Pairs π π
- 2115. Find All Possible Recipes from Given Supplies π π
|
- 1712. Ways to Split Array Into Three Subarrays π π
|
π |
|
βοΈβοΈ |
- Array π
- Two Pointers π
- Binary Search π
- Prefix Sum π
|
- 2147. Number of Ways to Divide a Long Corridor π π
- 2270. Number of Ways to Split Array π π
|
- 1713. Minimum Operations to Make a Subsequence π π
|
π |
|
βοΈβοΈβοΈ |
- Array π
- Hash Table π
- Binary Search π
- Greedy π
|
|
- 1714. Sum Of Special Evenly-Spaced Elements In Array π π
|
π° |
|
βοΈβοΈβοΈ |
- Array π
- Dynamic Programming π
|
|
- 1715. Count Apples and Oranges π π
|
π° |
|
βοΈβοΈ |
- Database π
|
|
- 1716. Calculate Money in Leetcode Bank π π
|
π |
β
|
βοΈ |
- Math π
|
|
- 1717. Maximum Score From Removing Substrings π π
|
π |
|
βοΈβοΈ |
- String π
- Stack π
- Greedy π
|
- 2135. Count Words Obtained After Adding a Letter π π
|
- 1718. Construct the Lexicographically Largest Valid Sequence π π
|
π |
|
βοΈβοΈ |
- Array π
- Backtracking π
|
|
- 1719. Number Of Ways To Reconstruct A Tree π π
|
π |
|
βοΈβοΈβοΈ |
- Tree π
- Graph π
- Topological Sort π
|
- 2196. Create Binary Tree From Descriptions π π
|
- 1720. Decode XORed Array π π
|
π |
β
|
βοΈ |
- Array π
- Bit Manipulation π
|
|
- 1721. Swapping Nodes in a Linked List π π
|
π |
β
|
βοΈβοΈ |
- Linked List π
- Two Pointers π
|
- 19. Remove Nth Node From End of List π π
- 24. Swap Nodes in Pairs π π
- 25. Reverse Nodes in k-Group π π
|
- 1722. Minimize Hamming Distance After Swap Operations π π
|
π |
|
βοΈβοΈ |
- Array π
- Depth-First Search π
- Union Find π
|
- 1202. Smallest String With Swaps π π
|
- 1723. Find Minimum Time to Finish All Jobs π π
|
π |
|
βοΈβοΈβοΈ |
- Array π
- Dynamic Programming π
- Backtracking π
- Bit Manipulation π
- Bitmask π
|
- 1986. Minimum Number of Work Sessions to Finish the Tasks π π
- 2323. Find Minimum Time to Finish All Jobs II π π
|
- 1724. Checking Existence of Edge Length Limited Paths II π π
|
π° |
|
βοΈβοΈβοΈ |
- Union Find π
- Graph π
- Minimum Spanning Tree π
|
- 1697. Checking Existence of Edge Length Limited Paths π π
|
- 1725. Number Of Rectangles That Can Form The Largest Square π π
|
π |
β
|
βοΈ |
- Array π
|
|
- 1726. Tuple with Same Product π π
|
π |
β
|
βοΈβοΈ |
- Array π
- Hash Table π
|
|
- 1727. Largest Submatrix With Rearrangements π π
|
π |
|
βοΈβοΈ |
- Array π
- Greedy π
- Sorting π
- Matrix π
|
- 695. Max Area of Island π π
|
- 1728. Cat and Mouse II π π
|
π |
|
βοΈβοΈβοΈ |
- Array π
- Math π
- Dynamic Programming π
- Graph π
- Topological Sort π
- Memoization π
- Matrix π
- Game Theory π
|
- 789. Escape The Ghosts π π
- 913. Cat and Mouse π π
|
- 1729. Find Followers Count π π
|
π |
|
βοΈ |
- Database π
|
|
- 1730. Shortest Path to Get Food π π
|
π° |
|
βοΈβοΈ |
- Array π
- Breadth-First Search π
- Matrix π
|
- 542. 01 Matrix π π
- 1293. Shortest Path in a Grid with Obstacles Elimination π π
|
- 1731. The Number of Employees Which Report to Each Employee π π
|
π° |
|
βοΈ |
- Database π
|
|
- 1732. Find the Highest Altitude π π
|
π |
β
|
βοΈ |
- Array π
- Prefix Sum π
|
|
- 1733. Minimum Number of People to Teach π π
|
π |
|
βοΈβοΈ |
- Array π
- Greedy π
|
|
- 1734. Decode XORed Permutation π π
|
π |
|
βοΈβοΈ |
- Array π
- Bit Manipulation π
|
|
- 1735. Count Ways to Make Array With Product π π
|
π |
|
βοΈβοΈβοΈ |
- Array π
- Math π
- Dynamic Programming π
- Combinatorics π
- Number Theory π
|
- 2338. Count the Number of Ideal Arrays π π
|
- 1736. Latest Time by Replacing Hidden Digits π π
|
π |
β
|
βοΈ |
- String π
- Greedy π
|
|
- 1737. Change Minimum Characters to Satisfy One of Three Conditions π π
|
π |
|
βοΈβοΈ |
- Hash Table π
- String π
- Counting π
- Prefix Sum π
|
|
- 1738. Find Kth Largest XOR Coordinate Value π π
|
π |
|
βοΈβοΈ |
- Array π
- Divide and Conquer π
- Bit Manipulation π
- Heap (Priority Queue) π
- Matrix π
- Prefix Sum π
- Quickselect π
|
|
- 1739. Building Boxes π π
|
π |
|
βοΈβοΈβοΈ |
- Math π
- Binary Search π
- Greedy π
|
|
- 1740. Find Distance in a Binary Tree π π
|
π° |
|
βοΈβοΈ |
- Hash Table π
- Tree π
- Depth-First Search π
- Breadth-First Search π
- Binary Tree π
|
- 2096. Step-By-Step Directions From a Binary Tree Node to Another π π
|
- 1741. Find Total Time Spent by Each Employee π π
|
π |
|
βοΈ |
- Database π
|
|
- 1742. Maximum Number of Balls in a Box π π
|
π |
β
|
βοΈ |
- Hash Table π
- Math π
- Counting π
|
|
- 1743. Restore the Array From Adjacent Pairs π π
|
π |
|
βοΈβοΈ |
- Array π
- Hash Table π
|
|
- 1744. Can You Eat Your Favorite Candy on Your Favorite Day? π π
|
π |
|
βοΈβοΈ |
- Array π
- Prefix Sum π
|
|
- 1745. Palindrome Partitioning IV π π
|
π |
|
βοΈβοΈβοΈ |
- String π
- Dynamic Programming π
|
- 131. Palindrome Partitioning π π
- 132. Palindrome Partitioning II π π
- 1278. Palindrome Partitioning III π π
|
- 1746. Maximum Subarray Sum After One Operation π π
|
π° |
|
βοΈβοΈ |
- Array π
- Dynamic Programming π
|
- 53. Maximum Subarray π π
|
- 1747. Leetflex Banned Accounts π π
|
π° |
|
βοΈβοΈ |
- Database π
|
|
- 1748. Sum of Unique Elements π π
|
π |
β
|
βοΈ |
- Array π
- Hash Table π
- Counting π
|
|
- 1749. Maximum Absolute Sum of Any Subarray π π
|
π |
|
βοΈβοΈ |
- Array π
- Dynamic Programming π
|
- 53. Maximum Subarray π π
|
- 1750. Minimum Length of String After Deleting Similar Ends π π
|
π |
|
βοΈβοΈ |
- Two Pointers π
- String π
|
|
- 1751. Maximum Number of Events That Can Be Attended II π π
|
π |
|
βοΈβοΈβοΈ |
- Array π
- Binary Search π
- Dynamic Programming π
|
- 1353. Maximum Number of Events That Can Be Attended π π
- 2008. Maximum Earnings From Taxi π π
- 2054. Two Best Non-Overlapping Events π π
|
- 1752. Check if Array Is Sorted and Rotated π π
|
π |
β
|
βοΈ |
- Array π
|
- 2124. Check if All A's Appears Before All B's π π
|
- 1753. Maximum Score From Removing Stones π π
|
π |
|
βοΈβοΈ |
- Math π
- Greedy π
- Heap (Priority Queue) π
|
- 2335. Minimum Amount of Time to Fill Cups π π
|
- 1754. Largest Merge Of Two Strings π π
|
π |
|
βοΈβοΈ |
- Two Pointers π
- String π
- Greedy π
|
|
- 1755. Closest Subsequence Sum π π
|
π |
|
βοΈβοΈβοΈ |
- Array π
- Two Pointers π
- Dynamic Programming π
- Bit Manipulation π
- Bitmask π
|
- 1981. Minimize the Difference Between Target and Chosen Elements π π
- 2035. Partition Array Into Two Arrays to Minimize Sum Difference π π
|
- 1756. Design Most Recently Used Queue π π
|
π° |
|
βοΈβοΈ |
- Array π
- Hash Table π
- Stack π
- Design π
- Binary Indexed Tree π
- Ordered Set π
|
- 146. LRU Cache π π
|
- 1757. Recyclable and Low Fat Products π π
|
π |
|
βοΈ |
- Database π
|
|
- 1758. Minimum Changes To Make Alternating Binary String π π
|
π |
β
|
βοΈ |
- String π
|
|
- 1759. Count Number of Homogenous Substrings π π
|
π |
|
βοΈβοΈ |
- Math π
- String π
|
- 1446. Consecutive Characters π π
- 1513. Number of Substrings With Only 1s π π
- 2104. Sum of Subarray Ranges π π
|
- 1760. Minimum Limit of Balls in a Bag π π
|
π |
|
βοΈβοΈ |
- Array π
- Binary Search π
|
- 2064. Minimized Maximum of Products Distributed to Any Store π π
- 2226. Maximum Candies Allocated to K Children π π
|
- 1761. Minimum Degree of a Connected Trio in a Graph π π
|
π |
|
βοΈβοΈβοΈ |
- Graph π
|
|
- 1762. Buildings With an Ocean View π π
|
π° |
|
βοΈβοΈ |
- Array π
- Stack π
- Monotonic Stack π
|
- 1944. Number of Visible People in a Queue π π
- 2345. Finding the Number of Visible Mountains π π
|
- 1763. Longest Nice Substring π π
|
π |
|
βοΈ |
- Hash Table π
- String π
- Divide and Conquer π
- Bit Manipulation π
- Sliding Window π
|
|
- 1764. Form Array by Concatenating Subarrays of Another Array π π
|
π |
|
βοΈβοΈ |
- Array π
- Greedy π
- String Matching π
|
|
- 1765. Map of Highest Peak π π
|
π |
|
βοΈβοΈ |
- Array π
- Breadth-First Search π
- Matrix π
|
|
- 1766. Tree of Coprimes π π
|
π |
|
βοΈβοΈβοΈ |
- Math π
- Tree π
- Depth-First Search π
- Breadth-First Search π
|
|
- 1767. Find the Subtasks That Did Not Execute π π
|
π° |
|
βοΈβοΈβοΈ |
- Database π
|
|
- 1768. Merge Strings Alternately π π
|
π |
β
|
βοΈ |
- Two Pointers π
- String π
|
- 281. Zigzag Iterator π π
|
- 1769. Minimum Number of Operations to Move All Balls to Each Box π π
|
π |
|
βοΈβοΈ |
- Array π
- String π
|
- 1217. Minimum Cost to Move Chips to The Same Position π π
|
- 1770. Maximum Score from Performing Multiplication Operations π π
|
π |
|
βοΈβοΈ |
- Array π
- Dynamic Programming π
|
- 1423. Maximum Points You Can Obtain from Cards π π
- 1690. Stone Game VII π π
|
- 1771. Maximize Palindrome Length From Subsequences π π
|
π |
|
βοΈβοΈβοΈ |
- String π
- Dynamic Programming π
|
- 516. Longest Palindromic Subsequence π π
|
- 1772. Sort Features by Popularity π π
|
π° |
|
βοΈβοΈ |
- Array π
- Hash Table π
- String π
- Sorting π
|
- 347. Top K Frequent Elements π π
- 692. Top K Frequent Words π π
|
- 1773. Count Items Matching a Rule π π
|
π |
β
|
βοΈ |
- Array π
- String π
|
|
- 1774. Closest Dessert Cost π π
|
π |
|
βοΈβοΈ |
- Array π
- Dynamic Programming π
- Backtracking π
|
|
- 1775. Equal Sum Arrays With Minimum Number of Operations π π
|
π |
|
βοΈβοΈ |
- Array π
- Hash Table π
- Greedy π
- Counting π
|
- 1155. Number of Dice Rolls With Target Sum π π
|
- 1776. Car Fleet II π π
|
π |
|
βοΈβοΈβοΈ |
- Array π
- Math π
- Stack π
- Heap (Priority Queue) π
- Monotonic Stack π
|
- 853. Car Fleet π π
- 2211. Count Collisions on a Road π π
|
- 1777. Product's Price for Each Store π π
|
π° |
|
βοΈ |
- Database π
|
- 1795. Rearrange Products Table π π
- 2252. Dynamic Pivoting of a Table π π
|
- 1778. Shortest Path in a Hidden Grid π π
|
π° |
|
βοΈβοΈ |
- Depth-First Search π
- Breadth-First Search π
- Graph π
- Interactive π
|
- 489. Robot Room Cleaner π π
- 1810. Minimum Path Cost in a Hidden Grid π π
|
- 1779. Find Nearest Point That Has the Same X or Y Coordinate π π
|
π |
β
|
βοΈ |
- Array π
|
- 973. K Closest Points to Origin π π
|
- 1780. Check if Number is a Sum of Powers of Three π π
|
π |
|
βοΈβοΈ |
- Math π
|
- 326. Power of Three π π
|
- 1781. Sum of Beauty of All Substrings π π
|
π |
|
βοΈβοΈ |
- Hash Table π
- String π
- Counting π
|
- 2083. Substrings That Begin and End With the Same Letter π π
|
- 1782. Count Pairs Of Nodes π π
|
π |
|
βοΈβοΈβοΈ |
- Two Pointers π
- Binary Search π
- Graph π
|
|
- 1783. Grand Slam Titles π π
|
π° |
|
βοΈβοΈ |
- Database π
|
|
- 1784. Check if Binary String Has at Most One Segment of Ones π π
|
π |
π |
βοΈ |
- String π
|
- 1869. Longer Contiguous Segments of Ones than Zeros π π
|
- 1785. Minimum Elements to Add to Form a Given Sum π π
|
π |
|
βοΈβοΈ |
- Array π
- Greedy π
|
|
- 1786. Number of Restricted Paths From First to Last Node π π
|
π |
|
βοΈβοΈ |
- Dynamic Programming π
- Graph π
- Topological Sort π
- Heap (Priority Queue) π
- Shortest Path π
|
- 2192. All Ancestors of a Node in a Directed Acyclic Graph π π
|
- 1787. Make the XOR of All Segments Equal to Zero π π
|
π |
|
βοΈβοΈβοΈ |
- Array π
- Dynamic Programming π
- Bit Manipulation π
|
|
- 1788. Maximize the Beauty of the Garden π π
|
π° |
|
βοΈβοΈβοΈ |
- Array π
- Greedy π
- Prefix Sum π
|
|
- 1789. Primary Department for Each Employee π π
|
π° |
|
βοΈ |
- Database π
|
|
- 1790. Check if One String Swap Can Make Strings Equal π π
|
π |
β
|
βοΈ |
- Hash Table π
- String π
- Counting π
|
- 859. Buddy Strings π π
|
- 1791. Find Center of Star Graph π π
|
π |
β
|
βοΈ |
- Graph π
|
|
- 1792. Maximum Average Pass Ratio π π
|
π |
|
βοΈβοΈ |
- Array π
- Greedy π
- Heap (Priority Queue) π
|
|
- 1793. Maximum Score of a Good Subarray π π
|
π |
|
βοΈβοΈβοΈ |
- Array π
- Two Pointers π
- Binary Search π
- Stack π
- Monotonic Stack π
|
- 84. Largest Rectangle in Histogram π π
|
- 1794. Count Pairs of Equal Substrings With Minimum Difference π π
|
π° |
|
βοΈβοΈ |
- Hash Table π
- String π
- Greedy π
|
|
- 1795. Rearrange Products Table π π
|
π |
|
βοΈ |
- Database π
|
- 1777. Product's Price for Each Store π π
- 2253. Dynamic Unpivoting of a Table π π
|
- 1796. Second Largest Digit in a String π π
|
π |
β
|
βοΈ |
- Hash Table π
- String π
|
- 2259. Remove Digit From Number to Maximize Result π π
|
- 1797. Design Authentication Manager π π
|
π |
|
βοΈβοΈ |
- Hash Table π
- Design π
|
|
- 1798. Maximum Number of Consecutive Values You Can Make π π
|
π |
|
βοΈβοΈ |
- Array π
- Greedy π
|
- 330. Patching Array π π
|
- 1799. Maximize Score After N Operations π π
|
π |
|
βοΈβοΈβοΈ |
- Array π
- Math π
- Dynamic Programming π
- Backtracking π
- Bit Manipulation π
- Number Theory π
- Bitmask π
|
|
- 1800. Maximum Ascending Subarray Sum π π
|
π |
|
βοΈ |
- Array π
|
- 2100. Find Good Days to Rob the Bank π π
- 2355. Maximum Number of Books You Can Take π π
|