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

We will solve this problem in a very similar way as we have done in the last lesson. 
## Cases to Consider
Again, we'll consider two cases while writing our code:
1. Node to be deleted is at position 0
2. Node to be deleted is not at position 0

The overall logic will stay the same as in the previous lesson except that we'll change the code a bit to cater to position rather than a key. 

## Implementation 
Without any further ado, let's jump to the implementation: 

We will solve this problem in a very similar way as we have done in the last lesson. 
# Cases to Consider
Again, we'll consider two cases while writing our code:
1. Node to be deleted is at position 0
2. Node to be deleted is not at position 0

The overall logic will stay the same as in the previous lesson except that we'll change the code a bit to cater to position rather than a key. 

# Implementation 
Without any further ado, let's jump to the implementation: 

In this lesson, you will learn how to delete a node at a given position in a linked list. 

Introduction

Stack

Singly Linked Lists

Circular Linked Lists

Doubly Linked Lists

Arrays

Binary Trees

Binary Search Trees

Binary Search

Recursion

String Processing

Deletion by Position

Cases to Consider #

Implementation #