FastPrep
Problem · String

Calculate Difference Value 🍧

Learn this problem
● MediumDoorDash logoDoorDashFULLTIMEOA

Problem statement

As an assignment, students at HackerLand High School are to find a subsequence using two strings by performing the below-mentioned operation. Given two strings firstString of length n and secondString of length m, the goal is to make secondString a subsequence of firstString by applying the operation any number of times.

In one operation, any single character can be removed from the secondString. The goal is to find the minimum possible difference value which is calculated as: | maximum index of all the characters removed from the string secondString | - | minimum index of all the characters removed from the string secondString | + 1. Removing a character from secondString does not affect the indices of the other characters and an empty string is always a subsequence of firstString.

Note: A subsequence of a string is a new string formed deleting some (can be none) of the characters from a string without changing the relative positions of the remaining characters. "ace" is a subsequence of "abcde" but "aec" is not.

Function

findDifferenceValue(firstString: String, secondString: String) → int

Complete the function findDifferenceValue in the editor.

Examples

Example 1

firstString = "HACKERRANK"secondString = "HACKERMAN"return = 1
Remove the character at index 7 to change secondString to "HACKERAN", a subsequence of firstString. The difference value is 7 - 7 + 1 = 1. Return 1.

Constraints

Unknown for now 🍰

More DoorDash problems

drafts saved locally
public int findDifferenceValue(String firstString, String secondString) {
    // write your code here
}
firstString"HACKERRANK"
secondString"HACKERMAN"
expected1
checking account