Python Data Structures and Algorithms
This repository contains data structures and algorithms concepts and questions in Python.
The open source community has helped me a lot during my interview preparations and studies while I was in my undergrad. I always wanted to give something back to the community. In my endeavour to contribute something back, I will be uploading data structures and algorithms questions in Python in this repo. Feel free to contribute and get in touch!
Structure of the repository
As of now, the repository contains a file called
useful_links.md and 2 main directories: Data Structures and Algorithms.
Contains all data structure questions categorised into sub-directories like stack, queue, etc according to their type.
- Binary Search Tree
- Linked List
- Circular Linked List
This directory contains various types of algorithm questions like Dynamic Programming, Sorting, Greedy, etc. The current structure of this directory is like -
- Dynamic Programming
You can find useful links in this repository in the different markdown files. Below is a table of contents.
Things need to be done
As you can see, the repo is still in its infancy. Here are some key things in the to-do.
- Queue questions
- Algorithms 2.1. Dynamic Programming 2.2. Greedy
- More questions in data structures, especially for graph, circular linked list, tries, heaps and hash.
Contributions are always welcomed.
To follow the guidelines, refer to Contributing.md
MIT @ Prabhu Pant