Hard | K5kC | Code & More

All Topics Algorithms Backend
Design Concurrency Database Database
Design Java Javascript Object Oriented
Design Programming
Language Shell

Title	Difficulty	Companies
Maximum Score of Non-overlapping Intervals	Hard
Maximum Sum of Edge Values in a Graph	Hard
Merge Operations for Minimum Travel Time	Hard
Minimum Cost Good Caption	Hard
Minimum Cost to Divide Array Into Subarrays	Hard
Minimum Increments for Target Multiples in an Array	Hard
Minimum Operations to Make Array Elements Zero	Hard
Minimum Operations to Make Character Frequencies Equal	Hard
Minimum Operations to Make Elements Within K Subarrays Equal	Hard
Minimum Pair Removal to Sort Array II	Hard
Path Existence Queries in a Graph II	Hard
Permutations IV	Hard
Separate Squares II	Hard
Shortest Matching Substring	Hard
Shortest Path in a Weighted Tree	Hard
Smallest Palindromic Rearrangement II	Hard
Smallest Substring With Identical Characters I	Hard
Smallest Substring With Identical Characters II	Hard
Subsequences with a Unique Middle Mode I	Hard
Subtree Inversion Sum	Hard
Design an Array Statistics Tracker	Hard
Find Circular Gift Exchange Chains	Hard
Longest Team Pass Streak	Hard
Minimum Runes to Add to Cast Spell	Hard
Minimum Time to Break Locks II	Hard
Multiply Two Polynomials	Hard
Range XOR Queries with Subarray Reversals	Hard
Subsequences with a Unique Middle Mode II	Hard
Team Dominance by Pass Success	Hard
Find Time Required to Eliminate Bacterial Strains	Hard
Longest Subsequence Repeated k Times	Hard
Kth Smallest Product of Two Sorted Arrays	Hard
Sum of k-Mirror Numbers	Hard
Count the Number of Arrays with K Matching Adjacent Elements	Hard
Maximum Difference Between Even and Odd Frequency II	Hard
Analyze Organization Hierarchy	Hard
Distribute Candies Among Children III	Hard
Maximum Candies You Can Get from Boxes	Hard	airbnb
Alternating Groups 3	Hard
Add Edges to Make Degrees of All Nodes Even	Hard
Abbreviating the Product of a Range	Hard
24 Game	Hard	amazon facebook google microsoft twitter uber
Maximize the Number of Target Nodes After Connecting Trees II	Hard
Largest Color Value in a Directed Graph	Hard
Find the Maximum Sum of Node Values	Hard
Add two numbers without using the plus operator	Hard
Best Position for a Service Centre	Hard	reddit
Construct Target Array With Multiple Sums	Hard	quora
Count All Valid Pickup and Delivery Options	Hard	doordash
Count Different Palindromic Subsequences	Hard	facebook google linkedin pure-storage