All Problems

4301 problems total

Array (1905)Sorting (440)Depth First Search (316)Database (301)Breadth First Search (241)Tree (240)Stack (172)Graph Theory (169)Linked List (81)Monotonic Stack (67)Queue (50)Recursion (48)Shortest Path (33)
All Topics(4301)Algorithms(3944)Database(305)Networking(0)Object Oriented Design(31)Programming Languages(5)System Design(0)

Filter by Difficulty:

EasyMediumHard

Tag:

Company:

TitleDifficultyVideosCompanies
Make Lexicographically Smallest Array by Swapping Elementsmedium-
Count Beautiful Substrings IIhard-
Number of Divisible Substringsmedium-
Find the Peakseasy-
Minimum Number of Coins to be Addedmedium-
Count Complete Substringshard-
Count the Number of Infection Sequenceshard-
Number of Same-End Substringsmedium-
Find Common Elements Between Two Arrayseasy-
Remove Adjacent Almost-Equal Charactersmedium-
Length of Longest Subarray With at Most K Frequencymedium-
Number of Possible Sets of Closing Brancheshard-
Count Tested Devices After Test Operationseasy-
Double Modular Exponentiationmedium-
Count Subarrays Where Max Element Appears at Least K Timesmedium-
Count the Number of Good Partitionshard-
Number of Divisible Triplet Sumsmedium-
Find Missing and Repeated Valueseasy-
Divide Array Into Arrays With Max Differencemedium-
Minimum Cost to Make Array Equalindromicmedium-
Apply Operations to Maximize Frequency Scorehard-
Minimum Number of Coins for Fruits IIhard-
Count the Number of Incremovable Subarrays Ieasy-
Find Polygon With the Largest Perimetermedium-
Count the Number of Incremovable Subarrays IIhard-
Find Number of Coins to Place in Tree Nodeshard-
Minimum Number Gameeasy-
Maximum Square Area by Removing Fences From a Fieldmedium-
Minimum Cost to Convert String 1medium
Minimum Cost to Convert String IIhard-
Symmetric Coordinatesmedium-
Most Expensive Item That Can Not Be Boughtmedium-
Check if Bitwise OR Has Trailing Zeroseasy-
Find Longest Special Substring That Occurs Thrice 1medium-
Find Longest Special Substring That Occurs Thrice 2medium-
Palindrome Rearrangement Querieshard-
Find Peak Calling Hours for Each Citymedium-
Calculate Compressed Meaneasy-
Find Third Transactionmedium-
Find Expensive Citieseasy-
Manager of the Largest Departmentmedium-
Class Performancemedium-
Loan Typeseasy-
Top Three Winerieshard-
Number of Self-Divisible Permutationsmedium-
Friday Purchases Imedium-
Friday Purchases IIhard-
Viewers Turned Streamershard-
Smallest Missing Integer Greater Than Sequential Prefix Sumeasy-
Minimum Number of Operations to Make Array XOR Equal to Kmedium-
Showing 3851 to 3900 of 4301 results
Previous1...7677787980...87Next