All Problems

730 problems total

Filter by Difficulty:

Tag:

Company:

Active filters:Tag: math×
TitleDifficultyVideosCompanies
Amount of New Area Painted Each Dayhard-
Array With Elements Not Equal to Average of Neighborsmedium-
Best Position for a Service Centrehard-
Brace Expansionmedium-
Can Make Palindrome from Substringmedium-
Check If Digits Are Equal in String After Operations Ieasy-
Check If Digits Are Equal in String After Operations IIhard-
Construct K Palindrome Stringsmedium
Count Connected Components in LCM Graphhard-
Count Mentions Per Usermedium-
Count Numbers with Non-Decreasing Digits hard-
Count Partitions with Even Sum Differenceeasy-
Count Sorted Vowel Stringsmedium-
Count Special Subsequencesmedium-
Count the Number of Arrays with K Matching Adjacent Elementshard-
Delivering Boxes from Storage to Portshard-
Digit Operations to Make Two Integers Equalmedium-
Fancy Sequencehard-
Find Closest Personeasy-
Find Sum of Array Product of Magical Sequenceshard-
Divide Two Integersmedium-
Find the Number of Copy Arraysmedium-
Find Time Required to Eliminate Bacterial Strainshard-
Find X Value of Array Imedium-
Find X Value of Array IIhard-
Implement Hierarchical Locking System for Tree Structuresmedium-
Infinite Prime Generatormedium-
Add Two Numbers represented as Linked List in Reversed Ordermedium-
Reverse Integermedium-
Palindrome Numbereasy
Integer To Romanmedium-
Roman To Integereasy
Manhattan Distances of All Arrangements of Pieceshard-
Maximum and Minimum Sums of at Most Size K Subarrayshard-
Maximum and Minimum Sums of at Most Size K Subsequencesmedium-
Maximum Area Rectangle With Point Constraints Imedium-
Maximum Area Rectangle With Point Constraints IIhard-
Maximum Containers on a Shipeasy-
Maximum Manhattan Distance After K Changesmedium-
Maximum Number of Matching Indices After Right Shiftseasy-
Maximum of Two Numbers Without Conditionalshard-
Maximum Product of the Length of Two Palindromic Subsequencesmedium-
Maximum Product of Two Digitseasy-
Maximum Subarray With Equal Productseasy-
Minimum Cost Tree From Leaf Valuesmedium-
Minimum Increments for Target Multiples in an Arrayhard-
Minimum Operations to Make Array Elements Zerohard-
Minimum Operations to Make Array Sum Divisible by Keasy-
Minimum Operations to Make Elements Within K Subarrays Equalhard-
Minimum Operations to Make Subarray Elements Equalmedium-
Showing 1 to 50 of 730 results