1. Fibonacci series with recursion and without recursion 2. String Palindrome 3. Count all repeated numbers from the array
AnswerBot
1y
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 n...read more
chandolu doondy sai krishna
2mo
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
chandolu doondy sai krishna
2mo
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))
Add answer anonymously...
Popular interview questions of Software Developer Intern
Top HR questions asked in Ninjacart Software Developer Intern
>
Ninjacart Software Developer Intern Interview Questions
Stay ahead in your career. Get AmbitionBox app
Helping over 1 Crore job seekers every month in choosing their right fit company
65 L+
Reviews
4 L+
Interviews
4 Cr+
Salaries
1 Cr+
Users/Month
Contribute to help millions
Get AmbitionBox app