Discover data structures and algorithms using Python. Gain insights into solving real-world problems and typical interview questions with detailed reviews, explanations, and hands-on coding exercises.

Data structures and algorithms are among the most fundamental concepts of Computer Science. Whether it’s real-world problems you’re trying to solve or the typical coding question asked in an interview, almost every problem requires you to demonstrate a deep understanding of data structures and algorithms. 

This course is a detailed review of some of the most common data structures and algorithms that you’ll see in interviews and your everyday work. With implementation details, thorough explanations, and hands-on coding exercises, you’ll quickly gain the confidence you need to solve any problem, no matter the situation.

Data Structures and Algorithms in Python

Recursive implementations  are always less space-consuming then iterative implementations. 

Recursive implementations are always less space-consuming then iterative implementations.

```python
base * (exp -1)* pow(base,exp)
```

Fill in the blank for the following recursive function which calculates the power of a base raised to an exponent:
```python
def pow(base,exp):
    if exp == 0: 
        return 1
    else:
        return ___________
```

Fill in the blank for the following recursive function which calculates the power of a base raised to an exponent:
<pre><code class="language-python">def pow(base,exp):
 if exp == 0: 
 return 1
 else:
 return ___________
</code></pre>

What is the output of the following code?
```python
def fibonacci(n):
    if n==1:
        return 0
    elif n==2:
        return 1
    else:
        return fibonacci(n-1)+fibonacci(n-2) 
print(fibonacci(7)) 
```

What is the output of the following code?
<pre><code class="language-python">def fibonacci(n):
 if n==1:
 return 0
 elif n==2:
 return 1
 else:
 return fibonacci(n-1)+fibonacci(n-2) 
print(fibonacci(7)) 
</code></pre>

Only recursively defined functions can be implemented recursively. 

Only recursively defined functions can be implemented recursively.

It's quiz time! Test yourself by solving these questions about recursion. 

Introduction

Stack

Singly Linked Lists

Circular Linked Lists

Doubly Linked Lists

Arrays

Binary Trees

Binary Search Trees

Binary Search

Recursion

String Processing

Quiz