Welcome back brave human being,
By now you should be an expert at the two-pointer technique and your LeetCode tracker should be starting to fill up! 💪
Today’s problem is:
1099. Two Sum Less Than K
Return the maximum sum of distinct pairs in the array such that the sum is less than k. If no such pair exists, return -1.
By now you should know...
What step is missing in the given array?
Crucial step to use the two-pointer technique
What would the naive solution look like?
See you tomorrow,
Denisse
LinkedIn Optimization
Tree tips to pimp your profile:
Add your skills e.g.: Python, SQL, JavaScript
Add a feature section: Write a Medium article, add your publication or a portfolio
Turn on Creator mode and the skills you dominate