Leetcode 2486. Append Characters to String to Make Subsequence
I am a developer from Nashville, TN. I specialize in the .NET tech stack. I have created many projects in Blazor WASM, Xamarin, MAUI, etc.
Search for a command to run...
I am a developer from Nashville, TN. I specialize in the .NET tech stack. I have created many projects in Blazor WASM, Xamarin, MAUI, etc.
No comments yet. Be the first to comment.
A series documenting my journey to improving my ability to solve LeetCode problems through YouTube videos, study plans, articles, etc. Using my own words for later reference.
Intuition Sort the array and check if the start and end of the array match. If not, increment or decrement accordingly. Approach First sort the array. Then use two pointers. One at the beginning, the other at the end. Check to see if the value at the...
Intuition Sort the array and check if the start and end of the array match. If not, increment or decrement accordingly. Approach First sort the array. Then use two pointers. One at the beginning, the other at the end. Check to see if the value at the...
Intuition Find position of ch (if any) then use two pointers to swap characters until string is reveresed from beginning to index of ch Approach Start by checking each character for ch. If we find it, that's where our right pointer will start. Our le...
Intuition Use two pointers to iterate through the string checking each adjacent character to see if it is "bad" or "good". Approach First if the string is 1 or fewer characters we know it is good so we can just return it. If that's not the case, we c...
Intuition Since both arrays are sorted, we can find the minimum common value by iterating from left to right with two pointers. Approach Initialize both pointers to 0 to start at the beginning of the array. While both pointers are within bounds of th...
Get the length of the subsequence (if any) and subtract it from the length of t to find out how many characters we have to append (if any)
Keep a count of the length of the subsequence while iterating through s and then subtract the length of the subsequence from the length of t
public class Solution
{
public int AppendCharacters(string s, string t)
{ //position of the last character that forms a subsequence
int pos = 0;
//iterate through s
for(int i = 0; i < s.Length; i++)
{
//if the position of the last character that forms a
//subsequence is >= the length of t, it is already a
//subsequence so we return 0
if(pos >= t.Length)
{
return 0;
}
//otherwise we increment pos
else if(s[i] == t[pos])
{
pos++;
}
}
//once we reach the end of s we have calculated the length
//of the subsequence and can subtract it from the remaining
//characters in t so we know how many characters to append
return t.Length - pos;
}