You are not logged in. Please login at to post your questions!


A string problem.

The task is to count the minimum number of characters to be removed from a string A, such that the final string does not contain string B as a subsequence. For example, A: "abb", B:" ab". We can remove 'b' & 'b ' (2 chars) from A or remove just 'a' (1 char) from A. Hence we will remove only 'a' from A in order to minimize the number of characters removed. Any approach would be helpful.

asked 13 Sep '18, 04:07

aasifkhan7's gravatar image

accept rate: 0%

With the string array, we can easily declare more than a number of the variable with the different category, and if you are unable to declare the function to call the array, you can take some help from Linksys Tech Support as, with that, you can easily able to call the different types of functions.


answered 13 Sep '18, 05:04

pedor6's gravatar image

accept rate: 0%

I'm not sure that I follow.

(13 Sep '18, 20:07) aasifkhan74★

A user always faces string problem but there is no need to worry about that. If you want to resolve that type of error the connect Netgear tech support they assist you and will resolve your problem.


answered 08 Oct '18, 17:40

suzangro's gravatar image

accept rate: 0%

toggle preview

Follow this question

By Email:

Once you sign in you will be able to subscribe for any updates here



Answers and Comments

Markdown Basics

  • *italic* or _italic_
  • **bold** or __bold__
  • link:[text]( "title")
  • image?![alt text](/path/img.jpg "title")
  • numbered list: 1. Foo 2. Bar
  • to add a line break simply add two spaces to where you would like the new line to be.
  • basic HTML tags are also supported
  • mathemetical formulas in Latex between $ symbol

Question tags:


question asked: 13 Sep '18, 04:07

question was seen: 140 times

last updated: 08 Oct '18, 17:40