https://leetcode.com/problems/get-equal-substrings-within-budget/description/
Max substring
Max substring
sum(abs(s[..] - t[..])) < maxCost #medium #sliding_window👍2🔥1
1.68K subscribers
659 photos
38 videos
1 file
1.07K links
Don't miss a day to solve the problem
My leetcode graph - https://leetcode.com/SamoylenkoDmitry/
Download Telegram
My leetcode graph - https://leetcode.com/SamoylenkoDmitry/