Minimum number of deletions to make a string palindrome [closed] - string

Closed. This question is opinion-based. It is not currently accepting answers.
Want to improve this question? Update the question so it can be answered with facts and citations by editing this post.
Closed 1 year ago.
Improve this question
I have a string consisting zeros and ones and I need to know how many deletions from the beginning I need to do in order to make a string a palindrome. I wrote a function to check if the string is palindrome (and iterate over each element) and it works, but I need complexity better than O(n^2). It will be probably O(n) with KMP algorithm but I have no idea how to use it in this case.
Can you help me?

Related

How to differentiate two forms of percent in a grammar? [closed]

Closed. This question is opinion-based. It is not currently accepting answers.
Want to improve this question? Update the question so it can be answered with facts and citations by editing this post.
Closed 6 months ago.
Improve this question
I have two forms of "percent" that I need in a grammar:
PERCENT_1
: 'PERCENT'
;
PERCENT_2
: '%'
;
One is the word PERCENT, for example used with something like LIMIT 10 PERCENT and the other is the modulo operator. What might be a good way to differentiate these two things?
One is a keyword, the other an operator. I usually name keyword tokens <name>_SYMBOL and operators <name>_OPERATOR (see the MySQL grammar). Of course this is totally up to you, but should be consistently used throughout your grammar(s).

Variable naming convension for whether having [closed]

Closed. This question is opinion-based. It is not currently accepting answers.
Want to improve this question? Update the question so it can be answered with facts and citations by editing this post.
Closed 2 years ago.
Improve this question
Variable for whether having, for example, the variable for if the user has points, which is correct?
have_points, has_points, if_having_points or if_has_points?
Naming convention for a variable which holds boolean value should be indicated by prefixes like: is, has, have, does, will, can etc.
In your case you're using snake case. If "has Points" is being tracked for a single entity then you can go with has_points. For more than one entity you might want to go for have_points.
Although it boils to personal preference, but you should still try to keep your code short and succinct.

How to find the number of common characters of two input strings in Assembly? [closed]

Closed. This question needs to be more focused. It is not currently accepting answers.
Want to improve this question? Update the question so it focuses on one problem only by editing this post.
Closed 6 years ago.
Improve this question
I need to compare two input strings and display the number of common characters in Assembly but i can't find how to do that.
To do it efficiently you would need some sort of data structure to remember which characters you have seen already.
If you don’t mind duplicates and don't need efficiency, you could loop over the first string and, for each character, loop over the second string and compare them (adding one to a register or a variable when they match).

Python similar type of string to search [closed]

Closed. This question needs to be more focused. It is not currently accepting answers.
Want to improve this question? Update the question so it focuses on one problem only by editing this post.
Closed 8 years ago.
Improve this question
I have just started learning python and I have a question. I have a text file which I opened. The file has random questions. Now my question is how can I search for any question similar to this type of question "what is your .... " and "how do you ...." and return the whole question . I am using python 3.x. Please help
I highly suggest you spend some time reading about regex. The trick would be to search for a string that includes the first words you want (the "What is your" statement) and ends with a question mark. The following docs should give you quite a bit of clarity.
https://docs.python.org/3.4/library/re.html
https://docs.python.org/3.4/howto/regex.html#regex-howto

Simplest way to handle non-determinism in Haskell? [closed]

Closed. This question needs details or clarity. It is not currently accepting answers.
Want to improve this question? Add details and clarify the problem by editing this post.
Closed 8 years ago.
Improve this question
The search algorithm I'm implementing (a simple partial order planner) just has a few choices to make at each invocation. Ideally I would like it to backtrack over the possibilities and return the first found solution.
Take a look at the list ([]) monad instance. It's commonly used for non-determinism.

Resources