Medium | K5kC | Code & More

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

Title	Difficulty	Companies	Videos
Find the Most Common Response	Medium
Find the Number of Copy Arrays	Medium
Find X Value of Array I	Medium
Fruits Into Baskets III	Medium
Implement Router	Medium
Longest Palindrome After Substring Concatenation I	Medium
Longest Palindromic Subsequence After at Most K Operations	Medium
Longest Subsequence With Decreasing Adjacent Difference	Medium
Make Array Non-decreasing	Medium
Maximize Active Section with Trade I	Medium
Maximize Amount After Two Days of Conversions	Medium
Maximum Amount of Money Robot Can Earn	Medium
Maximum and Minimum Sums of at Most Size K Subsequences	Medium
Maximum Area Rectangle With Point Constraints I	Medium
Maximum Coins From K Consecutive Bags	Medium
Maximum Frequency After Subarray Operation	Medium
Maximum Number of Distinct Elements After Operations	Medium
Maximum Subarray Sum With Length Divisible by K	Medium
Maximum Sum With at Most K Elements	Medium
Maximum Weighted K-Edge Path	Medium
Minimize the Maximum Edge Weight of Graph	Medium
Minimum Cost to Make Arrays Identical	Medium
Minimum Operations to Convert All Elements to Zero	Medium
Minimum Time to Break Locks I	Medium
Number of Unique XOR Triplets I	Medium
Number of Unique XOR Triplets II	Medium
Paint House IV	Medium
Path Existence Queries in a Graph I	Medium
Properties Graph	Medium
Reschedule Meetings for Maximum Free Time I	Medium
Reschedule Meetings for Maximum Free Time II	Medium
Select K Disjoint Special Substrings	Medium
Separate Squares I	Medium
Smallest Palindromic Rearrangement I	Medium
Stock Price Fluctuation	Medium	two-sigma
Sum of K Subarrays With Length at Least M	Medium
Unit Conversion I	Medium
Zero Array Transformation IV	Medium
Design a 3D Binary Matrix with Efficient Layer Tracking	Medium
Longest Common Prefix After at Most One Removal	Medium
Make a Positive Array	Medium
Maximize Profit from Task Assignment	Medium
Maximize Score After Pair Deletions	Medium
Maximum Coin Collection	Medium
Minimum Operations to Make Subarray Elements Equal	Medium
Minimum Threshold for Inversion Pairs Count	Medium
Minimum Time to Visit All Houses	Medium
Minimum Unlocked Indices to Sort Nums	Medium
Permutations III	Medium
Unit Conversion II	Medium