maximize-number-of-subsequences-in-a-string

Maximize Number of Subsequences in a String

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

ruby

bash

swift

golang

scala

html

pythonml

kotlin

rust

typescript

racket

erlang

elixir

dart

maximumSubsequenceCount

You are given a 0-indexed string <code>text</code> and another 0-indexed string <code>pattern</code> of length <code>2</code>, both of which consist of only lowercase English letters.

You can add either <code>pattern[0]</code> or <code>pattern[1]</code> anywhere in <code>text</code> exactly once. Note that the character can be added even at the beginning or at the end of <code>text</code>.

Return the maximum number of times <code>pattern</code> can occur as a subsequence of the modified <code>text</code>.

A subsequence is a string that can be derived from another string by deleting some or no characters without changing the order of the remaining characters.

&nbsp;
Example 1:

<pre>
Input: text = &quot;abdcdbc&quot;, pattern = &quot;ac&quot;
Output: 4
Explanation:
If we add pattern[0] = &#39;a&#39; in between text[1] and text[2], we get &quot;abadcdbc&quot;. Now, the number of times &quot;ac&quot; occurs as a subsequence is 4.
Some other strings which have 4 subsequences &quot;ac&quot; after adding a character to text are &quot;aabdcdbc&quot; and &quot;abdacdbc&quot;.
However, strings such as &quot;abdcadbc&quot;, &quot;abdccdbc&quot;, and &quot;abdcdbcc&quot;, although obtainable, have only 3 subsequences &quot;ac&quot; and are thus suboptimal.
It can be shown that it is not possible to get more than 4 subsequences &quot;ac&quot; by adding only one character.
</pre>

Example 2:

<pre>
Input: text = &quot;aabb&quot;, pattern = &quot;ab&quot;
Output: 6
Explanation:
Some of the strings which can be obtained from text and have 6 subsequences &quot;ab&quot; are &quot;aaabb&quot;, &quot;aaabb&quot;, and &quot;aabbb&quot;.
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= text.length &lt;= 105</code></li>
	<li><code>pattern.length == 2</code></li>
	<li><code>text</code> and <code>pattern</code> consist only of lowercase English letters.</li>
</ul>

String

Greedy

Prefix Sum

Accenture

Accolite

Activision

Adobe

Aetion

Affinity

Affirm

Airbnb

Airtel

Akamai

Akuna Capital

Alation

Alibaba

AllinCall

alphonso

Altimetrik

Amazon

American Express

Analytics quotient

AppDynamics

Apple

AQR Capital Management LLC

Arcesium

Arista Networks

Asana

Ascend

Athenahealth

Atlassian

Audible

Avalara

Baidu

Barclays

BitGo

BlackRock

Blizzard

Bloomberg

Bolt

Booking.com

Bridgewater Associates

ByteDance

C3 IoT

Canonical

Capgemini

Capital One

Cashfree

Cisco

Citadel

Citrix

Clari

Cloudera

Code Studio

codeagon

Codenation

CoderByte

Cognizant

Cohesity

Coinbase

Commvault

Coupang

Coursera

Cruise Automation

Cryptic Studios

DailyHunt

Databricks

Dataminr

DE Shaw

Dell

Deloitte

Deutsche Bank

DiDi

Directi

Discord

Docusign

DoorDash

Drawbridge

Dropbox

Dunzo

Duolingo

eBay

edabit

Electronic Arts

Epam Systems

Epic Systems

epiFi

Evernote

Expedia

Facebook

FactSet

Fallible

Fleetx

Flipkart

ForUsAll

fourkites

Garena

GE Digital

GE Healthcare

Online Assessment

Phone Interview

On Campus Interview

Onsite Interview

Don't know

last week

last month

last 3 months

last 6 months

more than 6 months

other