https://github.com/beebombshell/python-dsa
This repository is a compilation of important Data Structures and Algorithms based on Python.
https://github.com/beebombshell/python-dsa
hacktoberfest hacktoberfest-2021 hacktoberfest-2022 hacktoberfest-accepted hacktoberfest2021 hacktoberfest2022
Last synced: 12 months ago
JSON representation
This repository is a compilation of important Data Structures and Algorithms based on Python.
- Host: GitHub
- URL: https://github.com/beebombshell/python-dsa
- Owner: BeeBombshell
- License: mit
- Created: 2021-10-01T12:20:24.000Z (over 4 years ago)
- Default Branch: main
- Last Pushed: 2022-10-22T16:22:53.000Z (over 3 years ago)
- Last Synced: 2025-04-02T10:39:29.431Z (about 1 year ago)
- Topics: hacktoberfest, hacktoberfest-2021, hacktoberfest-2022, hacktoberfest-accepted, hacktoberfest2021, hacktoberfest2022
- Language: Python
- Homepage:
- Size: 167 KB
- Stars: 36
- Watchers: 3
- Forks: 47
- Open Issues: 14
-
Metadata Files:
- Readme: README.md
- Contributing: CONTRIBUTING.md
- License: LICENSE
- Code of conduct: CODE_OF_CONDUCT.md
Awesome Lists containing this project
README
# Python DSA :snake:
This repository is a compilation of important Data Structures and Algorithms based on Python.
> **Please make seperate folders for different topics** :innocent:
The following topics will be elaborated:
* Big O Time Complexity
* Tuples
* Dictionaries
* Lists
* Arrays
* Binary Search
* Linear Search
* Sliding Window Example
* Looping
* For Loop
* While Loop
* do While Loop
* Sorting Algorithms
* Bubble Sort
* Selection Sort
* Insertion Sort
* Bucket Sort
* Merge Sort
* Quick Sort
* Heap Sort
* Tree Sort
* Shell Sort
* Count Sort
* Radix Sort
* Searching Algorithms
* Linear Search
* Binary Search
* Recursion
* Ackermann Function
* Backtracking
* Dynamic Programming
* Linked List
* Singly Linked List
* Doubly Linked List
* Circular Singly Linked List
* Circular Doubly Linked List
* Reverse Linked List
* Merge Linked List
* Middle Linked List
* Palindromic Linked List
* Cycle exist in Linked List
* Start of cycle in Linked List
* Happy Number
* Tree Data Structure
* BFS
* DFS
* Binary Tree
* Binary Search Tree
* AVL tree
* Trie
* Inorder Tree Traversal
* Preorder Tree Traversal
* Postorder Tree Traversal
* Binary Tree Max Path
* Morris Traversal
* Graph Data Structure
* Breadth First Search
* Depth First Search
* Number of Islands
* Divide and Conquer Algorithm
