1. Fibonacci series with recursion and without recursion 2. String Palindrome 3. Count all repeated numbers from the array

Question

Accepted Answer

Answering questions related to Fibonacci series, string palindrome, and counting repeated numbers in an array.

For Fibonacci series with recursion, write a function that calls itself to calculate the next number in the series.
For Fibonacci series without recursion, use a loop to calculate the series.
For string palindrome, compare characters from start and end of the string.
To count all repeated numbers from the array, use a hashmap to store counts of each number.

Accepted Answer

def is_palindrome_iterative(s):
    return s == s[::-1]

string = "racecar"
print(is_palindrome_iterative(string))  # Output: True

string2 = "hello"
print(is_palindrome_iterative(string2))  # Output: False

Accepted Answer

def fibonacci_iterative(n):
    fib = [0, 1]
    for i in range(2, n):
        fib.append(fib[i-1] + fib[i-2])
    return fib

n = 10 
print(fibonacci_iterative(n))