palindrome

100%

✓ Published0🌍 Public

Last edited Mar 14, 2016

Created on Mar 14, 2016

This example checks whether the word “chicken” is a palindrome by building two arrays from the string’s characters, reversing one, and comparing them element by element. It logs a message to the console indicating whether the word is a palindrome, not a palindrome, or if no word was entered. The visualization uses plain JavaScript with no external libraries or rendering, relying solely on console output. The code demonstrates basic array manipulation and conditional logic without any D3 or SVG elements, despite the HTML including a D3 script tag.

AI-generated description

Built with blockbuilder.org

Similar vizzes

Loading thumbnail…

Gist bdf18bc2f317cb12b0db8e964e212b94

This C++ console program determines whether a user-provided word is a palindrome. It first prompts for input via the standard `cin` stream, then passes the string to the `polindromo_palabra` function. That function measures the word's length, rejects empty or single-character inputs with specific messages, and builds a reversed copy of the string by iterating backward through the original. It then compares the original to the reversed version using the `!=` operator, printing whether the word is or is not a palindrome. The example uses standard C++ libraries (`iostream`, `stdio.h`, and the `string` class) with no external visualization or graphics APIs.

MMistyBlunch

66% match

Loading thumbnail…

Recursive function to evaluate whether a phrase is a palindrome

This example demonstrates a recursive XQuery function that determines whether a phrase is a palindrome, using the Persian sentence "شکر بترازوی وزارت برکش" as test data. The function checks length, compares first and last characters, and recursively tests the trimmed remainder via XPath `fn:string-length`, `fn:substring`, and `fn:replace`. The initial phrase is normalized with `fn:lower-case` and whitespace removal before evaluation. The code relies solely on the standard XQuery 3.0 function library, with no external visualization or rendering dependencies.

CCliffordAnderson

56% match

Loading thumbnail…

Freecodecamp

This visualization demonstrates the outcome of a string-mutation algorithm, showing whether two input words share all their characters. The code defines a function that checks if every letter in the second word appears in the first, returning a boolean result. The example specifically tests the words "hello" and "hey," which produces a false output because the letter "y" is missing from the first word. No external visualization libraries are used; instead, the display relies on the raw JavaScript logic and the console output from the gist. The data source is the hardcoded array passed to the function.

EEelsie

54% match

Loading thumbnail…

JS Bin

This example demonstrates two JavaScript array and string manipulation techniques: counting duplicate names in an array using the `reduce` method, and checking if two words are anagrams by sorting their lowercase, trimmed characters. The code logs results to the console, showing a counted object with name frequencies and a boolean `isAnagram` variable. It relies on native JavaScript functions like `toLowerCase`, `split`, `sort`, `join`, and `trim`, with no external visualization libraries. The dataset is a hardcoded array of names and two test words embedded directly in the script.

JJn1532

53% match

Loading thumbnail…

Gist 9a5e7b204b7bb4e90cc3f9b7bf5b7dad

This example shows a recursive JavaScript function that reverses a string. The function `rec` takes a word, checks if its length is zero, and returns an empty string as the base case; otherwise, it appends the last character to the result of calling `rec` on the string with that last character removed. It demonstrates the reversal of the input "hello" to "olleh" through a simple recursion pattern. The code uses plain JavaScript with no external libraries or rendering APIs.

MMistyBlunch

53% match

Loading thumbnail…

Gist 215171539b05b8928b7a

This example demonstrates a JavaScript function that checks whether all characters from one string appear in another, returning a boolean based on the comparison. The code defines `mutation(arr)`, which takes an array of two strings, converts both to lowercase, and iterates through the second string’s characters using a `for` loop with `indexOf` to test for presence. However, the logic incorrectly returns `true` or `false` immediately after checking the first character, rather than evaluating the entire string. The example calls the function with `["hello", "oen"]` and relies on native JavaScript string methods rather than any visualization library or rendering API.

SSSabu

53% match

Loading thumbnail…

AI1.02.11

This example demonstrates a collection of JavaScript utility functions that perform calculations and string manipulations, logging results to the browser console. The code defines functions to compute squares, BMI, arithmetic means, maximum values, string reversal, vowel counts, and palindrome checks. It uses standard JavaScript features like `arguments` objects, `Set` for vowel detection, and array methods (`split`, `reverse`, `join`). While the page loads D3 v7 via a CDN, the visualization itself does not employ any D3 APIs, instead relying solely on vanilla JavaScript logic and console output.

Jjwr2023

52% match

Loading thumbnail…

MSAN 622 Homework 2: Javascript Anagrams (4/24)

A JavaScript program identifies and displays all words from a predefined array that have at least one anagram elsewhere in the list. The function `anagram_finder` iterates through the input, comparing each word pair using `is_anagram`, which checks character sets for equality. The output, printed to the console, includes words like 'list', 'cat', and 'act' that share rearranged letter groupings, while excluding unique words like 'man'. This example demonstrates basic algorithmic string comparison without external libraries.

KKirkHunter

51% match