Added Java program Get_Equal_Substring_Within_Budget

[ganesh-159th]

Program Description: Get Equal Substring Within Budget
The "Get Equal Substring Within Budget" program is designed to calculate the maximum length of a substring of two given strings, s and t, that can be changed to match each other within a specified cost limit (maxCost). The cost of changing a character from one string to another is determined by the absolute difference between their ASCII values.

Functionality:
The program takes three inputs:
The first string s.
The second string t.
The maximum cost maxCost.
It iterates through the characters of both strings simultaneously and calculates the cost of changing each character from s to t.
It maintains a sliding window approach to find the maximum length of a substring that can be changed within the specified cost limit.
The program then returns the maximum length of the valid substring.

**// Sample input
String s = "abcd";
String t = "bcdf";
int maxCost = 3;

// Output
int maxLength = obj.equalSubstring(s, t, maxCost);
System.out.println("Maximum length of valid substring: " + maxLength);
**

Expected Output:
Maximum length of valid substring: 3

[vercel]

The latest updates on your projects. Learn more about Vercel for Git ↗︎

Name	Status	Preview	Comments	Updated (UTC)
open-source-contribution-for-beginners	✅ Ready (Inspect)	Visit Preview	💬 Add feedback	May 30, 2024 5:09pm