2076 |
Process Restricted Friend Requests |
Go |
Hard |
2075 |
Decode the Slanted Ciphertext |
Go |
Medium |
2074 |
Reverse Nodes in Even Length Groups |
Go |
Medium |
2073 |
Time Needed to Buy Tickets |
Go |
Easy |
2072 |
The Winner University 🔒 |
MySQL |
Easy |
2071 |
Maximum Number of Tasks You Can Assign |
Go |
Hard |
2070 |
Most Beautiful Item for Each Query |
Go |
Medium |
2069 |
Walking Robot Simulation II |
Go |
Medium |
2068 |
Check Whether Two Strings are Almost Equivalent |
Go |
Easy |
2067 |
Number of Equal Count Substrings 🔒 |
Go |
Medium |
2066 |
Account Balance 🔒 |
MySQL |
Medium |
2065 |
Maximum Path Quality of a Graph |
Go |
Hard |
2064 |
Minimized Maximum of Products Distributed to Any Store |
Go |
Medium |
2063 |
Vowels of All Substrings |
Go |
Medium |
2062 |
Count Vowel Substrings of a String |
Go |
Easy |
2061 |
Number of Spaces Cleaning Robot Cleaned 🔒 |
Go |
Medium |
2060 |
Check if an Original String Exists Given Two Encoded Strings |
Go |
Hard |
2059 |
Minimum Operations to Convert Number |
Go |
Medium |
2058 |
Find the Minimum and Maximum Number of Nodes Between Critical Points |
Go |
Medium |
2057 |
Smallest Index With Equal Value |
Go |
Easy |
2056 |
Number of Valid Move Combinations On Chessboard |
Go |
Hard |
2055 |
Plates Between Candles |
Go |
Medium |
2054 |
Two Best Non-Overlapping Events |
Go |
Medium |
2053 |
Kth Distinct String in an Array |
Go |
Easy |
2052 |
Minimum Cost to Separate Sentence Into Rows 🔒 |
Go |
Medium |
2051 |
The Category of Each Member in the Store 🔒 |
MySQL |
Medium |
2050 |
Parallel Courses III |
Go |
Hard |
2049 |
Count Nodes With the Highest Score |
Go |
Medium |
2048 |
Next Greater Numerically Balanced Number |
Go |
Medium |
2047 |
Number of Valid Words in a Sentence |
Go |
Easy |
2046 |
Sort Linked List Already Sorted Using Absolute Values 🔒 |
Go |
Medium |
2045 |
Second Minimum Time to Reach Destination |
Go |
Hard |
2044 |
Count Number of Maximum Bitwise-OR Subsets |
Go |
Medium |
2043 |
Simple Bank System |
Go |
Medium |
2042 |
Check if Numbers Are Ascending in a Sentence |
Go |
Easy |
2041 |
Accepted Candidates From the Interviews 🔒 |
MySQL |
Medium |
2040 |
Kth Smallest Product of Two Sorted Arrays |
Go |
Hard |
2039 |
The Time When the Network Becomes Idle |
Go |
Medium |
2038 |
Remove Colored Pieces if Both Neighbors are the Same Color |
Go |
Medium |
2037 |
Minimum Number of Moves to Seat Everyone |
Go |
Easy |
2036 |
Maximum Alternating Subarray Sum 🔒 |
Go |
Medium |
2035 |
Partition Array Into Two Arrays to Minimize Sum Difference |
Go |
Hard |
2034 |
Stock Price Fluctuation |
Go |
Medium |
2033 |
Minimum Operations to Make a Uni-Value Grid |
Go |
Medium |
2032 |
Two Out of Three |
Go |
Easy |
2031 |
Count Subarrays With More Ones Than Zeros 🔒 |
Go |
Medium |
2030 |
Smallest K-Length Subsequence With Occurrences of a Letter |
Go |
Hard |
2029 |
Stone Game IX |
Go |
Medium |
2028 |
Find Missing Observations |
Go |
Medium |
2027 |
Minimum Moves to Convert String |
Go |
Easy |
2026 |
Low-Quality Problems 🔒 |
MySQL |
Easy |
2025 |
Maximum Number of Ways to Partition an Array |
Go |
Hard |
2024 |
Maximize the Confusion of an Exam |
Go |
Medium |
2023 |
Number of Pairs of Strings With Concatenation Equal to Target |
Go |
Medium |
2022 |
Convert 1D Array Into 2D Array |
Go |
Easy |
2021 |
Brightest Position on Street 🔒 |
Go |
Medium |
2020 |
Number of Accounts That Did Not Stream 🔒 |
MySQL |
Medium |
2019 |
The Score of Students Solving Math Expression |
Go |
Hard |
2018 |
Check if Word Can Be Placed In Crossword |
Go |
Medium |
2017 |
Grid Game |
Go |
Medium |
2016 |
Maximum Difference Between Increasing Elements |
Go |
Easy |
2015 |
Average Height of Buildings in Each Segment 🔒 |
Go |
Medium |
2014 |
Longest Subsequence Repeated k Times |
Go |
Hard |
2013 |
Detect Squares |
Go |
Medium |
2012 |
Sum of Beauty in the Array |
Go |
Medium |
2011 |
Final Value of Variable After Performing Operations |
Go |
Easy |
2010 |
The Number of Seniors and Juniors to Join the Company II 🔒 |
MySQL |
Hard |
2009 |
Minimum Number of Operations to Make Array Continuous |
Go |
Hard |
2008 |
Maximum Earnings From Taxi |
Go |
Medium |
2007 |
Find Original Array From Doubled Array |
Go |
Medium |
2006 |
Count Number of Pairs With Absolute Difference K |
Go |
Easy |
2005 |
Subtree Removal Game with Fibonacci Tree 🔒 |
Go |
Hard |
2004 |
The Number of Seniors and Juniors to Join the Company 🔒 |
MySQL |
Hard |
2003 |
Smallest Missing Genetic Value in Each Subtree |
Go |
Hard |
2002 |
Maximum Product of the Length of Two Palindromic Subsequences |
Go |
Medium |
2001 |
Number of Pairs of Interchangeable Rectangles |
Go |
Medium |
2000 |
Reverse Prefix of Word |
Go |
Easy |
1999 |
Smallest Greater Multiple Made of Two Digits 🔒 |
Go |
Medium |
1998 |
GCD Sort of an Array |
Go |
Hard |
1997 |
First Day Where You Have Been in All the Rooms |
Go |
Medium |
1996 |
The Number of Weak Characters in the Game |
Go |
Medium |
1995 |
Count Special Quadruplets |
Go |
Easy |
1994 |
The Number of Good Subsets |
Go |
Hard |
1993 |
Operations on Tree |
Go |
Medium |
1992 |
Find All Groups of Farmland |
Go |
Medium |
1991 |
Find the Middle Index in Array |
Go |
Easy |
1990 |
Count the Number of Experiments 🔒 |
MySQL |
Medium |
1989 |
Maximum Number of People That Can Be Caught in Tag 🔒 |
Go |
Medium |
1988 |
Find Cutoff Score for Each School 🔒 |
MySQL |
Medium |
1987 |
Number of Unique Good Subsequences |
Go |
Hard |
1986 |
Minimum Number of Work Sessions to Finish the Tasks |
Go |
Medium |
1985 |
Find the Kth Largest Integer in the Array |
Go |
Medium |
1984 |
Minimum Difference Between Highest and Lowest of K Scores |
Go |
Easy |
1983 |
Widest Pair of Indices With Equal Range Sum 🔒 |
Go |
Medium |
1982 |
Find Array Given Subset Sums |
Go |
Hard |
1981 |
Minimize the Difference Between Target and Chosen Elements |
Go |
Medium |
1980 |
Find Unique Binary String |
Go |
Medium |
1979 |
Find Greatest Common Divisor of Array |
Go |
Easy |
1978 |
Employees Whose Manager Left the Company 🔒 |
MySQL |
Easy |
1977 |
Number of Ways to Separate Numbers |
Go |
Hard |
1976 |
Number of Ways to Arrive at Destination |
Go |
Medium |
1975 |
Maximum Matrix Sum |
Go |
Medium |
1974 |
Minimum Time to Type Word Using Special Typewriter |
Go |
Easy |
1973 |
Count Nodes Equal to Sum of Descendants 🔒 |
Go |
Medium |
1972 |
First and Last Call On the Same Day 🔒 |
MySQL |
Hard |
1971 |
Find if Path Exists in Graph |
Go |
Easy |
1970 |
Last Day Where You Can Still Cross |
Go |
Hard |
1969 |
Minimum Non-Zero Product of the Array Elements |
Go |
Medium |
1968 |
Array With Elements Not Equal to Average of Neighbors |
Go |
Medium |
1967 |
Number of Strings That Appear as Substrings in Word |
Go |
Easy |
1966 |
Binary Searchable Numbers in an Unsorted Array 🔒 |
Go |
Medium |
1965 |
Employees With Missing Information 🔒 |
MySQL |
Easy |
1964 |
Find the Longest Valid Obstacle Course at Each Position |
Go |
Hard |
1963 |
Minimum Number of Swaps to Make the String Balanced |
Go |
Medium |
1962 |
Remove Stones to Minimize the Total |
Go |
Medium |
1961 |
Check If String Is a Prefix of Array |
Go |
Easy |
1960 |
Maximum Product of the Length of Two Palindromic Substrings |
Go |
Hard |
1959 |
Minimum Total Space Wasted With K Resizing Operations |
Go |
Medium |
1958 |
Check if Move is Legal |
Go |
Medium |
1957 |
Delete Characters to Make Fancy String |
Go |
Easy |
1956 |
Minimum Time For K Virus Variants to Spread 🔒 |
Go |
Hard |
1955 |
Count Number of Special Subsequences |
Go |
Hard |
1954 |
Minimum Garden Perimeter to Collect Enough Apples |
Go |
Medium |
1953 |
Maximum Number of Weeks for Which You Can Work |
Go |
Medium |
1952 |
Three Divisors |
Go |
Easy |
1951 |
All the Pairs With the Maximum Number of Common Followers 🔒 |
MySQL |
Medium |
1950 |
Maximum of Minimum Values in All Subarrays 🔒 |
Go |
Medium |
1949 |
Strong Friendship 🔒 |
MySQL |
Medium |
1948 |
Delete Duplicate Folders in System |
Go |
Hard |
1947 |
Maximum Compatibility Score Sum |
Go |
Medium |
1946 |
Largest Number After Mutating Substring |
Go |
Medium |
1945 |
Sum of Digits of String After Convert |
Go |
Easy |
1944 |
Number of Visible People in a Queue |
Go |
Hard |
1943 |
Describe the Painting |
Go |
Medium |
1942 |
The Number of the Smallest Unoccupied Chair |
Go |
Medium |
1941 |
Check if All Characters Have Equal Number of Occurrences |
Go |
Easy |
1940 |
Longest Common Subsequence Between Sorted Arrays 🔒 |
Go |
Medium |
1939 |
Users That Actively Request Confirmation Messages 🔒 |
MySQL |
Easy |
1938 |
Maximum Genetic Difference Query |
Go |
Hard |
1937 |
Maximum Number of Points with Cost |
Go |
Medium |
1936 |
Add Minimum Number of Rungs |
Go |
Medium |
1935 |
Maximum Number of Words You Can Type |
Go |
Easy |
1934 |
Confirmation Rate 🔒 |
MySQL |
Medium |
1933 |
Check if String Is Decomposable Into Value-Equal Substrings 🔒 |
Go |
Easy |
1932 |
Merge BSTs to Create Single BST |
Go |
Hard |
1931 |
Painting a Grid With Three Different Colors |
Go |
Hard |
1930 |
Unique Length-3 Palindromic Subsequences |
Go |
Medium |
1929 |
Concatenation of Array |
Go |
Easy |
1928 |
Minimum Cost to Reach Destination in Time |
Go |
Hard |
1927 |
Sum Game |
Go |
Medium |
1926 |
Nearest Exit from Entrance in Maze |
Go |
Medium |
1925 |
Count Square Sum Triples |
Go |
Easy |
1924 |
Erect the Fence II 🔒 |
Go |
Hard |
1923 |
Longest Common Subpath |
Go |
Hard |
1922 |
Count Good Numbers |
Go |
Medium |
1921 |
Eliminate Maximum Number of Monsters |
Go |
Medium |
1920 |
Build Array from Permutation |
Go |
Easy |
1919 |
Leetcodify Similar Friends 🔒 |
MySQL |
Hard |
1918 |
Kth Smallest Subarray Sum 🔒 |
Go |
Medium |
1917 |
Leetcodify Friends Recommendations 🔒 |
MySQL |
Hard |
1916 |
Count Ways to Build Rooms in an Ant Colony |
Go |
Hard |
1915 |
Number of Wonderful Substrings |
Go |
Medium |
1914 |
Cyclically Rotating a Grid |
Go |
Medium |
1913 |
Maximum Product Difference Between Two Pairs |
Go |
Easy |
1912 |
Design Movie Rental System |
Go |
Hard |
1911 |
Maximum Alternating Subsequence Sum |
Go |
Medium |
1910 |
Remove All Occurrences of a Substring |
Go |
Medium |
1909 |
Remove One Element to Make the Array Strictly Increasing |
Go |
Easy |
1908 |
Game of Nim 🔒 |
Go |
Medium |
1907 |
Count Salary Categories 🔒 |
MySQL |
Medium |
1906 |
Minimum Absolute Difference Queries |
Go |
Medium |
1905 |
Count Sub Islands |
Go |
Medium |
1904 |
The Number of Full Rounds You Have Played |
Go |
Medium |
1903 |
Largest Odd Number in String |
Go |
Easy |
1902 |
Depth of BST Given Insertion Order 🔒 |
Go |
Medium |
1901 |
Find a Peak Element II |
Go |
Medium |
1900 |
The Earliest and Latest Rounds Where Players Compete |
Go |
Hard |
1899 |
Merge Triplets to Form Target Triplet |
Go |
Medium |
1898 |
Maximum Number of Removable Characters |
Go |
Medium |
1897 |
Redistribute Characters to Make All Strings Equal |
Go |
Easy |
1896 |
Minimum Cost to Change the Final Value of Expression |
Go |
Hard |
1895 |
Largest Magic Square |
Go |
Medium |
1894 |
Find the Student that Will Replace the Chalk |
Go |
Medium |
1893 |
Check if All the Integers in a Range Are Covered |
Go |
Easy |
1892 |
Page Recommendations II 🔒 |
MySQL |
Hard |
1891 |
Cutting Ribbons 🔒 |
Go |
Medium |
1890 |
The Latest Login in 2020 🔒 |
MySQL |
Easy |
1889 |
Minimum Space Wasted From Packaging |
Go |
Hard |
1888 |
Minimum Number of Flips to Make the Binary String Alternating |
Go |
Medium |
1887 |
Reduction Operations to Make the Array Elements Equal |
Go |
Medium |
1886 |
Determine Whether Matrix Can Be Obtained By Rotation |
Go |
Easy |
1885 |
Count Pairs in Two Arrays 🔒 |
Go |
Medium |
1884 |
Egg Drop With 2 Eggs and N Floors |
Go |
Medium |
1883 |
Minimum Skips to Arrive at Meeting On Time |
Go |
Hard |
1882 |
Process Tasks Using Servers |
Go |
Medium |
1881 |
Maximum Value after Insertion |
Go |
Medium |
1880 |
Check if Word Equals Summation of Two Words |
Go |
Easy |
1879 |
Minimum XOR Sum of Two Arrays |
Go |
Hard |
1878 |
Get Biggest Three Rhombus Sums in a Grid |
Go |
Medium |
1877 |
Minimize Maximum Pair Sum in Array |
Go |
Medium |
1876 |
Substrings of Size Three with Distinct Characters |
Go |
Easy |
1875 |
Group Employees of the Same Salary 🔒 |
MySQL |
Medium |
1874 |
Minimize Product Sum of Two Arrays 🔒 |
Go |
Medium |
1873 |
Calculate Special Bonus 🔒 |
MySQL |
Easy |
1872 |
Stone Game VIII |
Go |
Hard |
1871 |
Jump Game VII |
Go |
Medium |
1870 |
Minimum Speed to Arrive on Time |
Go |
Medium |
1869 |
Longer Contiguous Segments of Ones than Zeros |
Go |
Easy |
1868 |
Product of Two Run-Length Encoded Arrays 🔒 |
Go |
Medium |
1867 |
Orders With Maximum Quantity Above Average 🔒 |
MySQL |
Medium |
1866 |
Number of Ways to Rearrange Sticks With K Sticks Visible |
Go |
Hard |
1865 |
Finding Pairs With a Certain Sum |
Go |
Medium |
1864 |
Minimum Number of Swaps to Make the Binary String Alternating |
Go |
Medium |
1863 |
Sum of All Subset XOR Totals |
Go |
Easy |
1862 |
Sum of Floored Pairs |
Go |
Hard |
1861 |
Rotating the Box |
Go |
Medium |
1860 |
Incremental Memory Leak |
Go |
Medium |
1859 |
Sorting the Sentence |
Go |
Easy |
1858 |
Longest Word With All Prefixes 🔒 |
Go |
Medium |
1857 |
Largest Color Value in a Directed Graph |
Go |
Hard |
1856 |
Maximum Subarray Min-Product |
Go |
Medium |
1855 |
Maximum Distance Between a Pair of Values |
Go |
Medium |
1854 |
Maximum Population Year |
Go |
Easy |
1853 |
Convert Date Format 🔒 |
MySQL |
Easy |
1852 |
Distinct Numbers in Each Subarray 🔒 |
Go |
Medium |
1851 |
Minimum Interval to Include Each Query |
Go |
Hard |
1850 |
Minimum Adjacent Swaps to Reach the Kth Smallest Number |
Go |
Medium |
1849 |
Splitting a String Into Descending Consecutive Values |
Go |
Medium |
1848 |
Minimum Distance to the Target Element |
Go |
Easy |
1847 |
Closest Room |
Go |
Hard |
1846 |
Maximum Element After Decreasing and Rearranging |
Go |
Medium |
1845 |
Seat Reservation Manager |
Go |
Medium |
1844 |
Replace All Digits with Characters |
Go |
Easy |
1843 |
Suspicious Bank Accounts 🔒 |
MySQL |
Medium |
1842 |
Next Palindrome Using Same Digits 🔒 |
Go |
Hard |
1841 |
League Statistics 🔒 |
MySQL |
Medium |
1840 |
Maximum Building Height |
Go |
Hard |
1839 |
Longest Substring Of All Vowels in Order |
Go |
Medium |
1838 |
Frequency of the Most Frequent Element |
Go |
Medium |
1837 |
Sum of Digits in Base K |
Go |
Easy |
1836 |
Remove Duplicates From an Unsorted Linked List 🔒 |
Go |
Medium |
1835 |
Find XOR Sum of All Pairs Bitwise AND |
Go |
Hard |
1834 |
Single-Threaded CPU |
Go |
Medium |
1833 |
Maximum Ice Cream Bars |
Go |
Medium |
1832 |
Check if the Sentence Is Pangram |
Go |
Easy |
1831 |
Maximum Transaction Each Day 🔒 |
MySQL |
Medium |
1830 |
Minimum Number of Operations to Make String Sorted |
Go |
Hard |
1829 |
Maximum XOR for Each Query |
Go |
Medium |
1828 |
Queries on Number of Points Inside a Circle |
Go |
Medium |
1827 |
Minimum Operations to Make the Array Increasing |
Go |
Easy |
1826 |
Faulty Sensor 🔒 |
Go |
Easy |
1825 |
Finding MK Average |
Go |
Hard |
1824 |
Minimum Sideway Jumps |
Go |
Medium |
1823 |
Find the Winner of the Circular Game |
Go |
Medium |
1822 |
Sign of the Product of an Array |
Go |
Easy |
1821 |
Find Customers With Positive Revenue this Year 🔒 |
MySQL |
Easy |
1820 |
Maximum Number of Accepted Invitations 🔒 |
Go |
Medium |
1819 |
Number of Different Subsequences GCDs |
Go |
Hard |
1818 |
Minimum Absolute Sum Difference |
Go |
Medium |
1817 |
Finding the Users Active Minutes |
Go |
Medium |
1816 |
Truncate Sentence |
Go |
Easy |
1815 |
Maximum Number of Groups Getting Fresh Donuts |
Go |
Hard |
1814 |
Count Nice Pairs in an Array |
Go |
Medium |
1813 |
Sentence Similarity III |
Go |
Medium |
1812 |
Determine Color of a Chessboard Square |
Go |
Easy |
1811 |
Find Interview Candidates 🔒 |
MySQL |
Medium |
1810 |
Minimum Path Cost in a Hidden Grid 🔒 |
Go |
Medium |
1809 |
Ad-Free Sessions 🔒 |
MySQL |
Easy |
1808 |
Maximize Number of Nice Divisors |
Go |
Hard |
1807 |
Evaluate the Bracket Pairs of a String |
Go |
Medium |
1806 |
Minimum Number of Operations to Reinitialize a Permutation |
Go |
Medium |
1805 |
Number of Different Integers in a String |
Go |
Easy |
1804 |
Implement Trie II (Prefix Tree) 🔒 |
Go |
Medium |
1803 |
Count Pairs With XOR in a Range |
Go |
Hard |
1802 |
Maximum Value at a Given Index in a Bounded Array |
Go |
Medium |
1801 |
Number of Orders in the Backlog |
Go |
Medium |
1800 |
Maximum Ascending Subarray Sum |
Go |
Easy |
1799 |
Maximize Score After N Operations |
Go |
Hard |
1798 |
Maximum Number of Consecutive Values You Can Make |
Go |
Medium |
1797 |
Design Authentication Manager |
Go |
Medium |
1796 |
Second Largest Digit in a String |
Go |
Easy |
1795 |
Rearrange Products Table 🔒 |
MySQL |
Easy |
1794 |
Count Pairs of Equal Substrings With Minimum Difference 🔒 |
Go |
Medium |
1793 |
Maximum Score of a Good Subarray |
Go |
Hard |
1792 |
Maximum Average Pass Ratio |
Go |
Medium |
1791 |
Find Center of Star Graph |
Go |
Easy |
1790 |
Check if One String Swap Can Make Strings Equal |
Go |
Easy |
1789 |
Primary Department for Each Employee 🔒 |
MySQL |
Easy |
1788 |
Maximize the Beauty of the Garden 🔒 |
Go |
Hard |
1787 |
Make the XOR of All Segments Equal to Zero |
Go |
Hard |
1786 |
Number of Restricted Paths From First to Last Node |
Go |
Medium |
1785 |
Minimum Elements to Add to Form a Given Sum |
Go |
Medium |
1784 |
Check if Binary String Has at Most One Segment of Ones |
Go |
Easy |
1783 |
Grand Slam Titles 🔒 |
MySQL |
Medium |
1782 |
Count Pairs Of Nodes |
Go |
Hard |
1781 |
Sum of Beauty of All Substrings |
Go |
Medium |
1780 |
Check if Number is a Sum of Powers of Three |
Go |
Medium |
1779 |
Find Nearest Point That Has the Same X or Y Coordinate |
Go |
Easy |
1778 |
Shortest Path in a Hidden Grid 🔒 |
Go |
Medium |
1777 |
Product's Price for Each Store 🔒 |
MySQL |
Easy |
1776 |
Car Fleet II |
Go |
Hard |
1775 |
Equal Sum Arrays With Minimum Number of Operations |
Go |
Medium |
1774 |
Closest Dessert Cost |
Go |
Medium |
1773 |
Count Items Matching a Rule |
Go |
Easy |
1772 |
Sort Features by Popularity 🔒 |
Go |
Medium |
1771 |
Maximize Palindrome Length From Subsequences |
Go |
Hard |
1770 |
Maximum Score from Performing Multiplication Operations |
Go |
Medium |
1769 |
Minimum Number of Operations to Move All Balls to Each Box |
Go |
Medium |
1768 |
Merge Strings Alternately |
Go |
Easy |
1767 |
Find the Subtasks That Did Not Execute 🔒 |
MySQL |
Hard |
1766 |
Tree of Coprimes |
Go |
Hard |
1765 |
Map of Highest Peak |
Go |
Medium |
1764 |
Form Array by Concatenating Subarrays of Another Array |
Go |
Medium |
1763 |
Longest Nice Substring |
Go |
Easy |
1762 |
Buildings With an Ocean View 🔒 |
Go |
Medium |
1761 |
Minimum Degree of a Connected Trio in a Graph |
Go |
Hard |
1760 |
Minimum Limit of Balls in a Bag |
Go |
Medium |
1759 |
Count Number of Homogenous Substrings |
Go |
Medium |
1758 |
Minimum Changes To Make Alternating Binary String |
Go |
Easy |
1757 |
Recyclable and Low Fat Products 🔒 |
MySQL |
Easy |
1756 |
Design Most Recently Used Queue 🔒 |
Go |
Medium |
1755 |
Closest Subsequence Sum |
Go |
Hard |
1754 |
Largest Merge Of Two Strings |
Go |
Medium |
1753 |
Maximum Score From Removing Stones |
Go |
Medium |
1752 |
Check if Array Is Sorted and Rotated |
Go |
Easy |
1751 |
Maximum Number of Events That Can Be Attended II |
Go |
Hard |
1750 |
Minimum Length of String After Deleting Similar Ends |
Go |
Medium |
1749 |
Maximum Absolute Sum of Any Subarray |
Go |
Medium |
1748 |
Sum of Unique Elements |
Go |
Easy |
1747 |
Leetflex Banned Accounts 🔒 |
MySQL |
Medium |
1746 |
Maximum Subarray Sum After One Operation 🔒 |
Go |
Medium |
1745 |
Palindrome Partitioning IV |
Go |
Hard |
1744 |
Can You Eat Your Favorite Candy on Your Favorite Day? |
Go |
Medium |
1743 |
Restore the Array From Adjacent Pairs |
Go |
Medium |
1742 |
Maximum Number of Balls in a Box |
Go |
Easy |
1741 |
Find Total Time Spent by Each Employee 🔒 |
MySQL |
Easy |
1740 |
Find Distance in a Binary Tree 🔒 |
Go |
Medium |
1739 |
Building Boxes |
Go |
Hard |
1738 |
Find Kth Largest XOR Coordinate Value |
Go |
Medium |
1737 |
Change Minimum Characters to Satisfy One of Three Conditions |
Go |
Medium |
1736 |
Latest Time by Replacing Hidden Digits |
Go |
Easy |
1735 |
Count Ways to Make Array With Product |
Go |
Hard |
1734 |
Decode XORed Permutation |
Go |
Medium |
1733 |
Minimum Number of People to Teach |
Go |
Medium |
1732 |
Find the Highest Altitude |
Go |
Easy |
1731 |
The Number of Employees Which Report to Each Employee 🔒 |
MySQL |
Easy |
1730 |
Shortest Path to Get Food 🔒 |
Go |
Medium |
1729 |
Find Followers Count 🔒 |
MySQL |
Easy |
1728 |
Cat and Mouse II |
Go |
Hard |
1727 |
Largest Submatrix With Rearrangements |
Go |
Medium |
1726 |
Tuple with Same Product |
Go |
Medium |
1725 |
Number Of Rectangles That Can Form The Largest Square |
Go |
Easy |
1724 |
Checking Existence of Edge Length Limited Paths II 🔒 |
Go |
Hard |
1723 |
Find Minimum Time to Finish All Jobs |
Go |
Hard |
1722 |
Minimize Hamming Distance After Swap Operations |
Go |
Medium |
1721 |
Swapping Nodes in a Linked List |
Go |
Medium |
1720 |
Decode XORed Array |
Go |
Easy |
1719 |
Number Of Ways To Reconstruct A Tree |
Go |
Hard |
1718 |
Construct the Lexicographically Largest Valid Sequence |
Go |
Medium |
1717 |
Maximum Score From Removing Substrings |
Go |
Medium |
1716 |
Calculate Money in Leetcode Bank |
Go |
Easy |
1715 |
Count Apples and Oranges 🔒 |
MySQL |
Medium |
1714 |
Sum Of Special Evenly-Spaced Elements In Array 🔒 |
Go |
Hard |
1713 |
Minimum Operations to Make a Subsequence |
Go |
Hard |
1712 |
Ways to Split Array Into Three Subarrays |
Go |
Medium |
1711 |
Count Good Meals |
Go |
Medium |
1710 |
Maximum Units on a Truck |
Go |
Easy |
1709 |
Biggest Window Between Visits 🔒 |
MySQL |
Medium |
1708 |
Largest Subarray Length K 🔒 |
Go |
Easy |
1707 |
Maximum XOR With an Element From Array |
Go |
Hard |
1706 |
Where Will the Ball Fall |
Go |
Medium |
1705 |
Maximum Number of Eaten Apples |
Go |
Medium |
1704 |
Determine if String Halves Are Alike |
Go |
Easy |
1703 |
Minimum Adjacent Swaps for K Consecutive Ones |
Go |
Hard |
1702 |
Maximum Binary String After Change |
Go |
Medium |
1701 |
Average Waiting Time |
Go |
Medium |
1700 |
Number of Students Unable to Eat Lunch |
Go |
Easy |
1699 |
Number of Calls Between Two Persons 🔒 |
MySQL |
Medium |
1698 |
Number of Distinct Substrings in a String 🔒 |
Go |
Medium |
1697 |
Checking Existence of Edge Length Limited Paths |
Go |
Hard |
1696 |
Jump Game VI |
Go |
Medium |
1695 |
Maximum Erasure Value |
Go |
Medium |
1694 |
Reformat Phone Number |
Go |
Easy |
1693 |
Daily Leads and Partners 🔒 |
MySQL |
Easy |
1692 |
Count Ways to Distribute Candies 🔒 |
Go |
Hard |
1691 |
Maximum Height by Stacking Cuboids |
Go |
Hard |
1690 |
Stone Game VII |
Go |
Medium |
1689 |
Partitioning Into Minimum Number Of Deci-Binary Numbers |
Go |
Medium |
1688 |
Count of Matches in Tournament |
Go |
Easy |
1687 |
Delivering Boxes from Storage to Ports |
Go |
Hard |
1686 |
Stone Game VI |
Go |
Medium |
1685 |
Sum of Absolute Differences in a Sorted Array |
Go |
Medium |
1684 |
Count the Number of Consistent Strings |
Go |
Easy |
1683 |
Invalid Tweets 🔒 |
MySQL |
Easy |
1682 |
Longest Palindromic Subsequence II 🔒 |
Go |
Medium |
1681 |
Minimum Incompatibility |
Go |
Hard |
1680 |
Concatenation of Consecutive Binary Numbers |
Go |
Medium |
1679 |
Max Number of K-Sum Pairs |
Go |
Medium |
1678 |
Goal Parser Interpretation |
Go |
Easy |
1677 |
Product's Worth Over Invoices 🔒 |
MySQL |
Easy |
1676 |
Lowest Common Ancestor of a Binary Tree IV 🔒 |
Go |
Medium |
1675 |
Minimize Deviation in Array |
Go |
Hard |
1674 |
Minimum Moves to Make Array Complementary |
Go |
Medium |
1673 |
Find the Most Competitive Subsequence |
Go |
Medium |
1672 |
Richest Customer Wealth |
Go |
Easy |
1671 |
Minimum Number of Removals to Make Mountain Array |
Go |
Hard |
1670 |
Design Front Middle Back Queue |
Go |
Medium |
1669 |
Merge In Between Linked Lists |
Go |
Medium |
1668 |
Maximum Repeating Substring |
Go |
Easy |
1667 |
Fix Names in a Table 🔒 |
MySQL |
Easy |
1666 |
Change the Root of a Binary Tree 🔒 |
Go |
Medium |
1665 |
Minimum Initial Energy to Finish Tasks |
Go |
Hard |
1664 |
Ways to Make a Fair Array |
Go |
Medium |
1663 |
Smallest String With A Given Numeric Value |
Go |
Medium |
1662 |
Check If Two String Arrays are Equivalent |
Go |
Easy |
1661 |
Average Time of Process per Machine 🔒 |
MySQL |
Easy |
1660 |
Correct a Binary Tree 🔒 |
Go |
Medium |
1659 |
Maximize Grid Happiness |
Go |
Hard |
1658 |
Minimum Operations to Reduce X to Zero |
Go |
Medium |
1657 |
Determine if Two Strings Are Close |
Go |
Medium |
1656 |
Design an Ordered Stream |
Go |
Easy |
1655 |
Distribute Repeating Integers |
Go |
Hard |
1654 |
Minimum Jumps to Reach Home |
Go |
Medium |
1653 |
Minimum Deletions to Make String Balanced |
Go |
Medium |
1652 |
Defuse the Bomb |
Go |
Easy |
1651 |
Hopper Company Queries III 🔒 |
MySQL |
Hard |
1650 |
Lowest Common Ancestor of a Binary Tree III 🔒 |
Go |
Medium |
1649 |
Create Sorted Array through Instructions |
Go |
Hard |
1648 |
Sell Diminishing-Valued Colored Balls |
Go |
Medium |
1647 |
Minimum Deletions to Make Character Frequencies Unique |
Go |
Medium |
1646 |
Get Maximum in Generated Array |
Go |
Easy |
1645 |
Hopper Company Queries II 🔒 |
MySQL |
Hard |
1644 |
Lowest Common Ancestor of a Binary Tree II 🔒 |
Go |
Medium |
1643 |
Kth Smallest Instructions |
Go |
Hard |
1642 |
Furthest Building You Can Reach |
Go |
Medium |
1641 |
Count Sorted Vowel Strings |
Go |
Medium |
1640 |
Check Array Formation Through Concatenation |
Go |
Easy |
1639 |
Number of Ways to Form a Target String Given a Dictionary |
Go |
Hard |
1638 |
Count Substrings That Differ by One Character |
Go |
Medium |
1637 |
Widest Vertical Area Between Two Points Containing No Points |
Go |
Medium |
1636 |
Sort Array by Increasing Frequency |
Go |
Easy |
1635 |
Hopper Company Queries I 🔒 |
MySQL |
Hard |
1634 |
Add Two Polynomials Represented as Linked Lists 🔒 |
Go |
Medium |
1633 |
Percentage of Users Attended a Contest 🔒 |
MySQL |
Easy |
1632 |
Rank Transform of a Matrix |
Go |
Hard |
1631 |
Path With Minimum Effort |
Go |
Medium |
1630 |
Arithmetic Subarrays |
Go |
Medium |
1629 |
Slowest Key |
Go |
Easy |
1628 |
Design an Expression Tree With Evaluate Function 🔒 |
Go |
Medium |
1627 |
Graph Connectivity With Threshold |
Go |
Hard |
1626 |
Best Team With No Conflicts |
Go |
Medium |
1625 |
Lexicographically Smallest String After Applying Operations |
Go |
Medium |
1624 |
Largest Substring Between Two Equal Characters |
Go |
Easy |
1623 |
All Valid Triplets That Can Represent a Country 🔒 |
MySQL |
Easy |
1622 |
Fancy Sequence |
Go |
Hard |
1621 |
Number of Sets of K Non-Overlapping Line Segments |
Go |
Medium |
1620 |
Coordinate With Maximum Network Quality |
Go |
Medium |
1619 |
Mean of Array After Removing Some Elements |
Go |
Easy |
1618 |
Maximum Font to Fit a Sentence in a Screen 🔒 |
Go |
Medium |
1617 |
Count Subtrees With Max Distance Between Cities |
Go |
Hard |
1616 |
Split Two Strings to Make Palindrome |
Go |
Medium |
1615 |
Maximal Network Rank |
Go |
Medium |
1614 |
Maximum Nesting Depth of the Parentheses |
Go |
Easy |
1613 |
Find the Missing IDs 🔒 |
MySQL |
Medium |
1612 |
Check If Two Expression Trees are Equivalent 🔒 |
Go |
Medium |
1611 |
Minimum One Bit Operations to Make Integers Zero |
Go |
Hard |
1610 |
Maximum Number of Visible Points |
Go |
Hard |
1609 |
Even Odd Tree |
Go |
Medium |
1608 |
Special Array With X Elements Greater Than or Equal X |
Go |
Easy |
1607 |
Sellers With No Sales 🔒 |
MySQL |
Easy |
1606 |
Find Servers That Handled Most Number of Requests |
Go |
Hard |
1605 |
Find Valid Matrix Given Row and Column Sums |
Go |
Medium |
1604 |
Alert Using Same Key-Card Three or More Times in a One Hour Period |
Go |
Medium |
1603 |
Design Parking System |
Go |
Easy |
1602 |
Find Nearest Right Node in Binary Tree 🔒 |
Go |
Medium |
1601 |
Maximum Number of Achievable Transfer Requests |
Go |
Hard |
1600 |
Throne Inheritance |
Go |
Medium |
1599 |
Maximum Profit of Operating a Centennial Wheel |
Go |
Medium |
1598 |
Crawler Log Folder |
Go |
Easy |
1597 |
Build Binary Expression Tree From Infix Expression 🔒 |
Go |
Hard |
1596 |
The Most Frequently Ordered Products for Each Customer 🔒 |
MySQL |
Medium |
1595 |
Minimum Cost to Connect Two Groups of Points |
Go |
Hard |
1594 |
Maximum Non Negative Product in a Matrix |
Go |
Medium |
1593 |
Split a String Into the Max Number of Unique Substrings |
Go |
Medium |
1592 |
Rearrange Spaces Between Words |
Go |
Easy |
1591 |
Strange Printer II |
Go |
Hard |
1590 |
Make Sum Divisible by P |
Go |
Medium |
1589 |
Maximum Sum Obtained of Any Permutation |
Go |
Medium |
1588 |
Sum of All Odd Length Subarrays |
Go |
Easy |
1587 |
Bank Account Summary II 🔒 |
MySQL |
Easy |
1586 |
Binary Search Tree Iterator II 🔒 |
Go |
Medium |
1585 |
Check If String Is Transformable With Substring Sort Operations |
Go |
Hard |
1584 |
Min Cost to Connect All Points |
Go |
Medium |
1583 |
Count Unhappy Friends |
Go |
Medium |
1582 |
Special Positions in a Binary Matrix |
Go |
Easy |
1581 |
Customer Who Visited but Did Not Make Any Transactions 🔒 |
MySQL |
Easy |
1580 |
Put Boxes Into the Warehouse II 🔒 |
Go |
Medium |
1579 |
Remove Max Number of Edges to Keep Graph Fully Traversable |
Go |
Hard |
1578 |
Minimum Deletion Cost to Avoid Repeating Letters |
Go |
Medium |
1577 |
Number of Ways Where Square of Number Is Equal to Product of Two Numbers |
Go |
Medium |
1576 |
Replace All ?'s to Avoid Consecutive Repeating Characters |
Go |
Easy |
1575 |
Count All Possible Routes |
Go |
Hard |
1574 |
Shortest Subarray to be Removed to Make Array Sorted |
Go |
Medium |
1573 |
Number of Ways to Split a String |
Go |
Medium |
1572 |
Matrix Diagonal Sum |
Go |
Easy |
1571 |
Warehouse Manager 🔒 |
MySQL |
Easy |
1570 |
Dot Product of Two Sparse Vectors 🔒 |
Go |
Medium |
1569 |
Number of Ways to Reorder Array to Get Same BST |
Go |
Hard |
1568 |
Minimum Number of Days to Disconnect Island |
Go |
Hard |
1567 |
Maximum Length of Subarray With Positive Product |
Go |
Medium |
1566 |
Detect Pattern of Length M Repeated K or More Times |
Go |
Easy |
1565 |
Unique Orders and Customers Per Month 🔒 |
MySQL |
Easy |
1564 |
Put Boxes Into the Warehouse I 🔒 |
Go |
Medium |
1563 |
Stone Game V |
Go |
Hard |
1562 |
Find Latest Group of Size M |
Go |
Medium |
1561 |
Maximum Number of Coins You Can Get |
Go |
Medium |
1560 |
Most Visited Sector in a Circular Track |
Go |
Easy |
1559 |
Detect Cycles in 2D Grid |
Go |
Medium |
1558 |
Minimum Numbers of Function Calls to Make Target Array |
Go |
Medium |
1557 |
Minimum Number of Vertices to Reach All Nodes |
Go |
Medium |
1556 |
Thousand Separator |
Go |
Easy |
1555 |
Bank Account Summary 🔒 |
MySQL |
Medium |
1554 |
Strings Differ by One Character 🔒 |
Go |
Medium |
1553 |
Minimum Number of Days to Eat N Oranges |
Go |
Hard |
1552 |
Magnetic Force Between Two Balls |
Go |
Medium |
1551 |
Minimum Operations to Make Array Equal |
Go |
Medium |
1550 |
Three Consecutive Odds |
Go |
Easy |
1549 |
The Most Recent Orders for Each Product 🔒 |
MySQL |
Medium |
1548 |
The Most Similar Path in a Graph 🔒 |
Go |
Hard |
1547 |
Minimum Cost to Cut a Stick |
Go |
Hard |
1546 |
Maximum Number of Non-Overlapping Subarrays With Sum Equals Target |
Go |
Medium |
1545 |
Find Kth Bit in Nth Binary String |
Go |
Medium |
1544 |
Make The String Great |
Go |
Easy |
1543 |
Fix Product Name Format 🔒 |
MySQL |
Easy |
1542 |
Find Longest Awesome Substring |
Go |
Hard |
1541 |
Minimum Insertions to Balance a Parentheses String |
Go |
Medium |
1540 |
Can Convert String in K Moves |
Go |
Medium |
1539 |
Kth Missing Positive Number |
Go |
Easy |
1538 |
Guess the Majority in a Hidden Array 🔒 |
Go |
Medium |
1537 |
Get the Maximum Score |
Go |
Hard |
1536 |
Minimum Swaps to Arrange a Binary Grid |
Go |
Medium |
1535 |
Find the Winner of an Array Game |
Go |
Medium |
1534 |
Count Good Triplets |
Go |
Easy |
1533 |
Find the Index of the Large Integer 🔒 |
Go |
Medium |
1532 |
The Most Recent Three Orders 🔒 |
MySQL |
Medium |
1531 |
String Compression II |
Go |
Hard |
1530 |
Number of Good Leaf Nodes Pairs |
Go |
Medium |
1529 |
Bulb Switcher IV |
Go |
Medium |
1528 |
Shuffle String |
Go |
Easy |
1527 |
Patients With a Condition 🔒 |
MySQL |
Easy |
1526 |
Minimum Number of Increments on Subarrays to Form a Target Array |
Go |
Hard |
1525 |
Number of Good Ways to Split a String |
Go |
Medium |
1524 |
Number of Sub-arrays With Odd Sum |
Go |
Medium |
1523 |
Count Odd Numbers in an Interval Range |
Go |
Easy |
1522 |
Diameter of N-Ary Tree 🔒 |
Go |
Medium |
1521 |
Find a Value of a Mysterious Function Closest to Target |
Go |
Hard |
1520 |
Maximum Number of Non-Overlapping Substrings |
Go |
Hard |
1519 |
Number of Nodes in the Sub-Tree With the Same Label |
Go |
Medium |
1518 |
Water Bottles |
Go |
Easy |
1517 |
Find Users With Valid E-Mails 🔒 |
MySQL |
Easy |
1516 |
Move Sub-Tree of N-Ary Tree 🔒 |
Go |
Hard |
1515 |
Best Position for a Service Centre |
Go |
Hard |
1514 |
Path with Maximum Probability |
Go |
Medium |
1513 |
Number of Substrings With Only 1s |
Go |
Medium |
1512 |
Number of Good Pairs |
Go |
Easy |
1511 |
Customer Order Frequency 🔒 |
MySQL |
Easy |
1510 |
Stone Game IV |
Go |
Hard |
1509 |
Minimum Difference Between Largest and Smallest Value in Three Moves |
Go |
Medium |
1508 |
Range Sum of Sorted Subarray Sums |
Go |
Medium |
1507 |
Reformat Date |
Go |
Easy |
1506 |
Find Root of N-Ary Tree 🔒 |
Go |
Medium |
1505 |
Minimum Possible Integer After at Most K Adjacent Swaps On Digits |
Go |
Hard |
1504 |
Count Submatrices With All Ones |
Go |
Medium |
1503 |
Last Moment Before All Ants Fall Out of a Plank |
Go |
Medium |
1502 |
Can Make Arithmetic Progression From Sequence |
Go |
Easy |
1501 |
Countries You Can Safely Invest In 🔒 |
MySQL |
Medium |