When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Longest palindromic substring - Wikipedia

    en.wikipedia.org/wiki/Longest_palindromic_substring

    This algorithm is slower than Manacher's algorithm, but is a good stepping stone for understanding Manacher's algorithm. It looks at each character as the center of a palindrome and loops to determine the largest palindrome with that center. The loop at the center of the function only works for palindromes where the length is an odd number.

  3. Palindrome tree - Wikipedia

    en.wikipedia.org/wiki/Palindrome_Tree

    In computer science a palindrome tree, also called an EerTree, [1] is a type of search tree, that allows for fast access to all palindromes contained in a string.They can be used to solve the longest palindromic substring, the k-factorization problem [2] (can a given string be divided into exactly k palindromes), palindromic length of a string [3] (what is the minimum number of palindromes ...

  4. Palindromic number - Wikipedia

    en.wikipedia.org/wiki/Palindromic_number

    A number that is non-palindromic in all bases b in the range 2 ≤ b ≤ n − 2 can be called a strictly non-palindromic number. For example, the number 6 is written as "110" in base 2, "20" in base 3, and "12" in base 4, none of which are palindromes. All strictly non-palindromic numbers larger than 6 are prime.

  5. Comparison of programming languages (string functions)

    en.wikipedia.org/wiki/Comparison_of_programming...

    «FUNCTION» BYTE-LENGTH(string) number of characters and number of bytes, respectively COBOL: string length string: a decimal string giving the number of characters Tcl: ≢ string: APL: string.len() Number of bytes Rust [30] string.chars().count() Number of Unicode code points Rust [31]

  6. Palindromic prime - Wikipedia

    en.wikipedia.org/wiki/Palindromic_prime

    Any number that can be expressed as a repetition of just one digit d in some base must trivially be palindromic in that base and must be a multiple of d in every base. Accordingly, no number that consists only of a string of repetitions of the same digit in at least one base, can be a prime unless it is a string of 1s in that base.

  7. For loop - Wikipedia

    en.wikipedia.org/wiki/For_loop

    In computer science, a for-loop or for loop is a control flow statement for specifying iteration. Specifically, a for-loop functions by running a section of code repeatedly until a certain condition has been satisfied. For-loops have two parts: a header and a body. The header defines the iteration and the body is the code executed once per ...

  8. Palindrome - Wikipedia

    en.wikipedia.org/wiki/Palindrome

    A palindrome is a word, number, phrase, or other sequence of symbols that reads the same backwards as forwards, such as madam or racecar, the date "22/02/2022" and the sentence: "A man, a plan, a canal – Panama".

  9. Control flow - Wikipedia

    en.wikipedia.org/wiki/Control_flow

    A label is an explicit name or number assigned to a fixed position within the source code, and which may be referenced by control flow statements appearing elsewhere in the source code. A label marks a position within source code and has no other effect. Line numbers are an alternative to a named label used in some languages (such as BASIC).