codejeet

Distinct Subsequences at Salesforce

Hard51.5% acceptance

This problem has 62.5% frequency at Salesforce.

Problem Description

Given two strings s and t, return _the number of distinct_ **_subsequences_** _of_ s _which equals_ t. The test cases are generated so that the answer fits on a 32-bit signed integer.

Read full problem and hints

Topics

StringDynamic Programming

Also asked at 14 companies

AmazonBloombergCoupangGoogleJPMorganMeeshoMetaMicrosoftOracleSwiggyTikTokTrilogyWalmart LabsZoho
View Full Problem

More Salesforce Questions

Minimum Operations to Reduce an Integer to 0MediumString CompressionMediumRemove Adjacent Almost-Equal CharactersMediumMaximum Number of Occurrences of a SubstringMediumSmallest Substring With Identical Characters IIHard
View all Salesforce questions