Xuanken Tay

Software engineer who likes statistics, machine learning, DevOps and the cloud

less than 1 minute read

Given two lowercase alphabet strings a and b, return the length of the longest anagram subsequence.

Constraints

  • n ≤ 100,000 where n is the length of a
  • m ≤ 100,000 where m is the length of b

https://binarysearch.com/problems/Longest-Anagram-Subsequence

Examples

Example 1

Input

  • a = afbc
  • b = cxba

Output

  • answer = 3

Explanation

  • “abc” is a subsequence in “afbc”
  • “cba” is a subsequence in “cxba”

And abc and cba are anagrams of each other.

Solution

Leave a comment

Read more

Anagram Substrings

less than 1 minute read

Given two strings s0 and s1, return the number of substrings where s1 contains any anagram of s0.

Anagram Partitioning

1 minute read

You are given two non-empty strings a and b that are the same length. Partition them into substrings such that each pair of a and b’s substring is the same s...

String Equivalence Relations

2 minute read

You are given three lowercase alphabet strings a, b and target. Strings a and b have the same length and are defined to be equivalent: a[i] = b[i]. For examp...

Minimum Window Substring

less than 1 minute read

Given two lowercase alphabet strings a and b, return the length of a minimum substring in a that contains all the characters of b.