Improve the given code below, make sure that the code will require input from the user. Problem: Write a JavaScript function that would accept a string and checks whether a passed string is palindrome? function check_Palindrome(str_entry){ var cstr = str_entry.toLowerCase().replace(/[^a-zA-Z0-9]+/g,''); //changes the str -> lowercase && rem all non-alpha numeric chars var count = 0; if(cstr === ""){ console.log("String is not found"); return false; } if((cstr.length) % 2 === 0){ //checks if the str is even or odd count = (cstr.length) / 2; } else { console.log("Num4"); if(cstr.length === 1){ //if str length === 1 then it is palindrome console.log("The string is a palindrome."); return true; } else { count = (cstr.length - 1) / 2; //if the str length is odd, ignores the mid char } } var p; for(p = 0; p < count; p++){ if(cstr[p] != cstr.slice(-1-p)[0]){ //compares char that doesn't match console.log("The string is not a palindrome."); console.log("\n"); return false; } } console.log("The string is a palindrome."); return true; } check_Palindrome('010'); check_Palindrome('1011

Improve the given code below, make sure that the code will require input from the user. Problem: Write a JavaScript function that would accept a string and checks whether a passed string is palindrome? function check_Palindrome(str_entry){ var cstr = str_entry.toLowerCase().replace(/[^a-zA-Z0-9]+/g,''); //changes the str -> lowercase && rem all non-alpha numeric chars var count = 0; if(cstr === ""){ console.log("String is not found"); return false; } if((cstr.length) % 2 === 0){ //checks if the str is even or odd count = (cstr.length) / 2; } else { console.log("Num4"); if(cstr.length === 1){ //if str length === 1 then it is palindrome console.log("The string is a palindrome."); return true; } else { count = (cstr.length - 1) / 2; //if the str length is odd, ignores the mid char } } var p; for(p = 0; p < count; p++){ if(cstr[p] != cstr.slice(-1-p)[0]){ //compares char that doesn't match console.log("The string is not a palindrome."); console.log("\n"); return false; } } console.log("The string is a palindrome."); return true; } check_Palindrome('010'); check_Palindrome('1011

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter7: User-defined Simple Data Types, Namespaces, And The String Type

Section: Chapter Questions

Problem 8PE: Write a program that reads in a line consisting of a students name, Social Security number, user ID,...

See similar textbooks

Similar questions

Programming language c++
javascript only: Write a function `popularLetters(string)` that takes a string as an argument and returns an array of all of the characters that appear five or more times in the string. Examples: console.log(popularLetters('apple')); // [] console.log(popularLetters('bananas in pajamas')); // [ 'a' ] console.log(popularLetters('Yes, we have no bananas, we have no bananas today!')); // [ 'e', ' ', 'a', 'n' ]
Scrabble Scrabble is a game where players get points by spelling words. Words are scored by adding together the point values of each individual letter. Define a function scrabble_score (word:str) -> int that takes a string word as input and returns the equivalent scrabble score for that word. score = {"a": 1, "c": 3, "f": 4, "i": 1, "1": 1, "o": 1, "r": 1, "u": 1, "t": 1, "x": 8, "z": 10} For example, "b": 3, "h": 4, "n": 1, Your Answer: == 20 assert scrabble_score("quick") assert scrabble_score("code") == 7 1 # Put your answer here 2 Submit "e": 1, "d": 2, "g": 2, "k": 5, "j": 8, "m": 3, "q": 10, "p": 3, "s": 1, "w": 4, "v": 4, "y": 4,
Task 2: Implement the function Searchingstrings that allow to search a sub-string in a given string and display the: First occurrence, Last occurrence, First occurrence from a given index and Last occurrence from a given index. You can use the following String methods: string. IndexOf(searchvalue, start) return the position of the first occurrence of specified character(s) in a string. string.lastIndexOf(searchvalue, start) return the position of the last occurrence of specified character(s) in a string. You can use the following string to test your solution: var letters = "abcdefghijklmnopqrstuvwxyzabcdefghijklm"; Write the code in a separate.js and separate.html file.
In C programming language Question (Strings) Write a function find_Substring() that finds a substring into a string. Pass array s1 and s2 to this function and prints if the substring is present or not. Expected Output 1: Enter string This is a javascript Enter substring script The substring is present Expected Output 2: Enter string This is a javascript Enter substring Jscript The substring is not present
Write an application which defines String=”hello world”, convert it into character array through function char[] stringToCharArray = testString. toCharArray();
• get_tokens_from_equation(line): Takes one string as input that contains any combination of digits from 0-9 and the following mathematical symbols: + - x / = ^ (O The string does not have to correspond to a valid mathematical equation. For example, '4-3=0' and '4xx5=(8' could be valid inputs to this function. The function will translate the string into a list of tokens. A token is a single non-negative number (of any length) or a single mathematical symbol. Numbers should be added to the list as integers, and symbols as strings. The tokens in the list should be in the same order as the numbers/symbols appear in the string. For example, given the string '52-2=50', the function should return the list [52, '-', 50]. >>> get_tokens_from_equation('4=3') [4, '=', 3] >>> get_tokens_from_equation('6-5=15^4/2') [6, '-', 5, '=', 15, '^', 4, '/', 2] >>> get_tokens_from_equation('288/24x6=18x13x8') [288, '/', 24, 'x', 6, '=', 18, 'x', 13, 'x', 8]
The function “reverse” reverses a given string and returns a pointer to the resulting string. Complete the missing parts. char* reverse( char* str ) { int n, h, j, k; char _________________; n = strlen( _____________); h = (n / 2); for ( j=0, k=(n - 1); (j < h); j++, _____________________ ) { tmp = ___________; str[k] = str[j]; str[j] = _______________________________; } return ________________________;} int main( int argc, char** argv ) { char s[512]; strcpy( s, argv[1] ); printf( "Reverse: %s\n", reverse( s ) ); return 0;}
Match the std::string constructor on right to its function on left. Source: https://cplusplus.com/reference/string/string/string/ E string() string (const string& str) string (const char* s) string (size_t n, char c) [Choose] [Choose ] constructs a copy of str. constructs an empty string, with a length of zero characters. copies the null-terminated character sequence (C-string) pointed by s. fills the string with n consecutive copies of character c. [Choose ]
Exercise Objectives Problem Description Write a program that reads a string and mirrors it around the middle character. Examples: abcd becomes cdab. abcde becomes deCab AhmadAlami becomes AlamiAhmad Page 1 of 2 Your program must: • Implement function void reflect (char* str) which receives a string (array of characters) and mirrors it. This function does not print anything. • Read from the user (in main()) a string and then print the string after calling function reflect(). • Use pointers and pointer arithmetic only. The use of array notation and/or functions from the string.h library is not allowed.
javascript Define a function, myIncludes, that accepts two parameters: an array and a searchValue. myIncludes should return true if the searchValue is an element in the array. Otherwise, myIncludes should return false. example myIncludes([10, 20, 30], 20); // => true myIncludes(['apples', 'bananas', 'citrus'], 'pears'); // => false
In c++ i dont need vector Input and output is in the photo find a sorted array of strings denoting all the possible directions which the rat can take to reach the destination at (n-1, n-1). The directions in which the rat can move are ‘U'(up), ‘D'(down), ‘L’ (left), ‘R’ (right).