DeShaw Online Assessment (OA) Coding Questions | HackerRank | Same Substring | Diverse Deputation

Question 1: Same Substring Problem Statement: Two strings, s and t, each of length n, that contain lowercase English characters are given as well as an integer K. The cost to change the ith character in s from si to ti is the absolute difference of the ASCII value of characters, i.e., abs(si - ti). Find the maximum length of a substring of s that can be changed to the corresponding substring of t with a total cost less than ...