how to create a word list contains the first 4 letters are alphabets and the following 4 letters [closed]

how to create a word list contains the first 4 alphabets and the next 4 digits.
Ex: AAAA0000 – ZZZZ9999

javascript – Regex for password must contain at least eight characters, at least one number and lower and upper case letters and special characters

I would answer Peter Mortensen, but I don't have enough reputation.

Its expressions are perfect for each of the minimum requirements specified. The problem with its expressions that don't require special characters is that they don't allow special characters either, so they also impose maximum requirements, which I don't believe the OP asked. Normally, you want to allow your users to make their password as strong as they want; why restrict strong passwords?

Thus, its expression "at least eight characters, at least one letter and one number":


meets minimum requirement, but remaining characters may only be letters and numbers. To allow (but not require) special characters, you should use something like:

^(?=.*(A-Za-z))(?=.*d).{8,}$ to allow all characters


^(?=.*(A-Za-z))(?=.*d)(A-Za-zd$@$!%*#?&){8,}$ to allow specific special characters

Likewise, "at least eight characters, at least one uppercase letter, one lowercase letter and one number:"


meets this minimum requirement but only authorizes letters and numbers. Use:

^(?=.*(a-z))(?=.*(A-Z))(?=.*d).{8,}$ to allow all characters


^(?=.*(a-z))(?=.*(A-Z))(?=.*d)(A-Za-zd$@$!%*?&){8,} to allow specific special characters.

Locating abbreviations for prompt date letters MM / DD / YYYY

If a website is located, will users still understand that D = day, M = month, even if these abbreviations are English abbreviations? (global site, public users joe)

android – Convert edited text to duplicate letters

I have an EditText that has numbers and letters (currency – € 12.00) and I want to change it to double (12.00) so that I can work with it as a number. How can this be done? I tried it like that but it doesn't work for me:

  double modcuota =  Double.parseDouble(cuota.getText().toString().trim());

javascript – Search in a string for the letters that appear in upper and lower case

I had a challenge recently and they asked me to return the largest letter (in alphabetical order, for example between b and the zI return the z) so that, string, appears in upper and lower case.

I did it as follows

function solution15(S) {
    const arr = S.split("");
    const lowercase = arr.filter((a)=> a === a.toLowerCase());
    const uppercase = arr.filter((a)=> a === a.toUpperCase());
    const coincidences = uppercase.filter(val => lowercase.includes(val.toLowerCase()));
    if (coincidences.length) {
        return coincidences(coincidences.length-1);
    return "NO";

Which works but is not very efficient.
I can't think of another better solution but I understand that there are. It can be done with regex for example?

Thank you!

windows 10 – Regex: search for lines with a specific TAG that contains words starting with lowercase letters

I want to find these lines with a particular TAG which contains at least 2 words starting with lowercase letters. for example

I love my house (this kind)

and not

I Love My House

I'm trying a regex, but not too good:

FIND: (?:G(?!^)|)s*K(*)|u$1L$2

Maybe you can help me.

python – Word search engine / filter for sentences – Confusion with capital letters

I have a work code that checks for a Requirements_example.txt text for different words. It reacts differently depending on the word it finds or does not find.
he does not However recognize the words if they are written in housing these latter. How can I check them independently of the writing? (Example: in my Other list i have the word & # 39;all"- he does not find"All& # 39;)

from nltk.corpus import wordnet 
import pandas as pd

# Import Badwords
my_sheet = 'Tabelle1'
file_name = 'Badwords.xlsx'
df = pd.read_excel(file_name, sheet_name = my_sheet)

Conjunctive = ()
Unprecise = ()
Other = ()
Modalverbs = ()

#Synonymfunction from wordnet
def syns(keywordword):

    synonyms = () 

    for syn in wordnet.synsets(keywordword): 
        for l in syn.lemmas(): 

    if len(synonyms):
        print('Here is a list of synonyms:',set(synonyms)) 
        return synonyms

#open the example text and set it to word_list
with open('Requirements_example.txt') as myfile:
    word_list={word for line in myfile for word in line.split()}

#Check for Badwords in the text
check = 1
for word in Conjunctive:
    if word in word_list:
        print ("Conjunctive should rather be avoided - replace the word '{}' with 'shall' or 'must'.".format(word.strip()))
        check = 0
#Modal Verben
if not any(word in word_list for word in Modalverbs):
    print("Please use a modal verb such as 'shall' or 'must'.")
    check = 0
for word in Unprecise:
    if word in word_list:
        print ("The word '{}' has an unprecise definition".format(word.strip()))
        check = 0
        keyword = word.strip()
for word in Other:
    if word in word_list:
        print ("You wrote a word that should rather be avoided - replace the word '{}'".format(word.strip()))
        check = 0
        keyword = word.strip()
#if all good:
if check == 1:
    print('All Good')

I am also satisfied with all the other advice regarding my code. Something I could have resolved better?

When I copy text from Adobe Acrobat PDF and paste it into PowerPoint, some letters are missing like fi and th. How can I fix it?

When I copy from a PDF created from an InDesign file, in PowerPoint, ALL the text sticks very well.

When I "place" an InDesign file inside another InDesign file and transform it into PDF, that's when copying / pasting into PowerPoint doesn't work for "fi", "Th" and some other letter combinations.

Someone runs into this and knows if there is a resolution?

eg the word "Definition" will appear as "De nition"
ex: the word "The" will come is like "e"
eg the word "after" will appear as "a er"

kotlin – Generate random letters containing a word

There is a popular game called 4 Pics 1 Word which presents the user with 4 pictures representing a common word. The word must be typed by selecting some of the 9 random letters appearing under the images.

The German version of this app has an annoying bug. When the random letters contain a letter from the set ÄÖÜß, it is guaranteed that the desired word contains this letter. It is unfair. The algorithm for selecting random letters seems to be as follows: take the letters of the word and fill in the rest with equally distributed letters of the alphabet A-Z. This algorithm can be implemented quickly but often selects a Q without the corresponding U.

I wanted to see if it was possible to generate "more naturally random" random letters. The first step to achieving this goal is to choose the letters based on how often they appear in the corpus of all the words to guess. The following code does just that.

I know the code is slow and can be optimized for speed in several ways. This is not the purpose of the code. The main objective is to serve as a reference implementation as simple to understand (and verify mathematically) as possible. It must clearly demonstrate the underlying concepts and ideas. It can then be compared to more optimized versions of the code, to verify that the probabilities in the optimized code are still correct.

package de.roland_illig.wordprob

import org.assertj.core.api.Assertions.assertThat
import org.assertj.core.api.Assertions.assertThatThrownBy
import org.junit.jupiter.api.AfterEach
import org.junit.jupiter.api.Disabled
import org.junit.jupiter.api.Test

 * Given a (word) from a set of (words), generate (n) random letters
 * that contain all the letters from the (word).
 * The returned letters should be "as random as possible".
fun randomLetters(
    words: Set,
    word: String,
    n: Int,
    rnd: (Int) -> Int
): String {
    require(word in words) { word }
    require(n >= word.length) { "$n < $word" }

    val wordCodePoints = word.codePoints().toArray()
    val allLetters = words.joinToString("").codePoints().toArray()
    while (true) {
        val codePoints = IntArray(n) { allLetters(rnd(allLetters.size)) }
        if (codePoints.containsAll(wordCodePoints))
            return String(codePoints, 0, codePoints.size)

private fun IntArray.containsAll(sub: IntArray): Boolean {
    val remaining = mutableMapOf()
    for (cp in this) remaining(cp) = (remaining(cp) ?: 0) + 1

    for (cp in sub) {
        val rem = remaining(cp) ?: return false
        if (rem == 0) return false
        remaining(cp) = rem - 1
    return true

class WordProbabilitiesKtTest {

    private val seqs = mutableListOf()

    fun tearDown() {
        for (seq in seqs) {
            check(seq.i == seq.ns.size) {
                "partly used sequence ${seq.ns.asList()}"

    fun containsAll() {
        fun Array.containsAll(sub: Array) =

        assertThat(arrayOf(1, 2, 3).containsAll(arrayOf(1, 2, 3))).isTrue()
        assertThat(arrayOf(1, 2, 3).containsAll(arrayOf(1, 2))).isTrue()
        assertThat(arrayOf(1, 2, 3).containsAll(arrayOf())).isTrue()
        assertThat(arrayOf(1, 2, 3).containsAll(arrayOf(1, 1))).isFalse()
        assertThat(arrayOf(1, 2, 3).containsAll(arrayOf(4))).isFalse()

    fun randomLetters() {
        assertThat(randomLetters(setOf("a", "b"), "a", 1, seq(0))).isEqualTo("a")
        assertThat(randomLetters(setOf("a", "b"), "b", 1, seq(1))).isEqualTo("b")
        assertThat(randomLetters(setOf("a", "b"), "a", 1, seq(1, 0))).isEqualTo("a")
        assertThat(randomLetters(setOf("a", "b"), "a", 2, seq(1, 0))).isEqualTo("ba")

            setOf("cat", "dog"),
            seq(3, 4, 5, 1, 3, 5, 1, 0, 2)

    fun `randomLetters, generator exhausted`() {
        assertThatThrownBy { randomLetters(setOf("a", "b"), "a", 2, seq(1, 1, 1, 1, 1)) }

    @Disabled("Tests the test code, fails too late, at tearDown")
    fun `randomLetters, generator partly used`() {
        randomLetters(setOf("a", "b"), "a", 2, seq(1, 1, 1, 1, 1, 0, 0, 7))

    private fun seq(vararg ns: Int): (Int) -> Int {
        val seq = Seq(*ns).also { seqs += it }
        return { }

    private class Seq(internal vararg val ns: Int) {
        internal var i = 0
        fun next(): Int = ns(i).also {
            check(i < ns.size) { "reached end of ${ns.asList()}" }

A future version of this code might take into account the fact that in German, the letter Q is always followed by a U. This could be based on a Markov chain. But for now, I'm happy to correct the unfair distribution of single letters.

VPS (dot) li – premium domain and 3 letters of 13 years old!

Domain: VPS (dot) li
Registrar: Gandi SAS
Age: 13
Expires: Jan 31, 2021

You can use this domain to sell VPS / VM. It is one of the most important keywords researched and used in the hosting industry; very profitable if a good referencing is carried out.

Estimated value: $ 2.972 (USD)

Price: $ 800

Payment will be made via Paypal / Dan / Sedo / Flippa