kata | A language for describing and taking code katas

Nearly i tried to finish a Codewars task called "Alphabet symmetry".
Here is the link: https://www.codewars.com/kata/59d9ff9f7905dfeed50000b0/train/javascript
I tried finish it on JavaScript language.
So my code is working and it passes all the tests, except one:

i want to call my array data from database using ajax. but i don't know the way. im confused in ajax call to show it into text field. how to get array data from my sql query

this the index.php looks like..

I am very new to C# programming (2 days in so far), after learning intermediate python and doing a few small projects, I am trying to learn C#

But because me knowing python, I am finding C# a little confusing, arrays always throw me off, while in python initializing a list is as easy as declaring a variable with empty lists x = [], C#'s way of declaring arrays is confusing.

My issue is, I encountered an error, which I did google but found nothing (there was one question similar to mine but no one had answered on it)

I was on a site called https://codewars.com/ and was solving Katas (problems) [lvl 7 (beginner)]

The question stated that for any input integer n, I have to return an array with a factor of the number n where n > 1

In python, the code will be like this:

Problem is described here

Given a list of integers A, for each pair of integers (first, last) in list ranges, calculate the sum of the values in A between indices first and last (both inclusive), and return the greatest resulting sum.

Problem is not so trivial as it seems, because of the timeout - test lists are way too long:

each integers-list : 100000 elements each ranges-list : 10000 elements

I have tried some solutions, and the fastest one, so far, was this: (checked with timeit, sum() is faster than loops and adding to the result, if i am right?)

Please take a look at the lines of code written below. It's too slow to pass the last test(long string). Is it a bad idea to iterate over each element in the array in this case? Is it the main cause responsible for slowing down the execution when dealing with long string?

The question to solve is described as follows:

Complete the function scramble(str1, str2) that returns true if a portion of str1 characters can be rearranged to match str2, otherwise returns false. This is the link to the question

So i have this kata: In this simple assignment you are given a number and have to make it negative. But maybe the number is already negative?

Example:

Currently I'm going through the problems on CodeWars, and I'm stuck on the Persistent Bugger problem.

Write a function, persistence, that takes in a positive parameter num and returns its multiplicative persistence, which is the number of times you must multiply the digits in num until you reach a single digit.

For example:

persistence(39) # returns 3, because 39=27, 27=14, 14=4 # and 4 has only one digit persistence(999) # returns 4, because 999=729, 729=126, # 126=12, and finally 12=2

persistence(4) # returns 0, because 4 is already a one-digit number

I've narrowed down my problem to a recursive function, however I'm having trouble wrapping my head around how to return my iteration counter.

Currently it runs through the program and maintains an accurate count. When it ends up with a single digit value however, it returns to the persistence call, lowering my iteration every time.

Codeware Challenge

So here what happening I'm trying to make a function that return the number i enter in the function parameter * the number of loop iteration i expect

I am looking at the Mumbling code challenge on CodeWars:

The examples below show you how to write function accum:

Examples: ...