Ecosyste.ms: Awesome

An open API service indexing awesome lists of open source software.

Awesome Lists | Featured Topics | Projects

https://github.com/OmkarPathak/Data-Structures-using-Python

This is my repository for Data Structures using Python
https://github.com/OmkarPathak/Data-Structures-using-Python

algorithms data-structures hacktoberfest hacktoberfest2018 python3

Last synced: 15 days ago
JSON representation

This is my repository for Data Structures using Python

Host: GitHub
URL: https://github.com/OmkarPathak/Data-Structures-using-Python
Owner: OmkarPathak
License: gpl-3.0
Created: 2017-06-07T02:59:59.000Z (over 7 years ago)
Default Branch: master
Last Pushed: 2022-10-07T20:12:55.000Z (about 2 years ago)
Last Synced: 2024-10-18T13:48:57.072Z (26 days ago)
Topics: algorithms, data-structures, hacktoberfest, hacktoberfest2018, python3
Language: Jupyter Notebook
Size: 113 KB
Stars: 942
Watchers: 25
Forks: 436
Open Issues: 22
Metadata Files:
- Readme: README.md
- License: LICENSE

Awesome Lists containing this project

README

        # Data-Structures-using-Python

This is my repository for Data Structures using Python.

This repository mainly aims at implementation of various Data Structures using Python.

Omkar Pathak,


Pune, Maharashtra, India.


# Arrays

* [Arrays Concept](https://github.com/OmkarPathak/Data-Structures-using-Python/blob/master/Arrays/Arrays.ipynb)

    * [Array implementation](Arrays/Arrays.py)

    * [Reversing an Array](Arrays/P01_ReversingArray.py)

    * [Array Rotation](Arrays/P02_ArrayRotation.py)

    * [Get the missing number](Arrays/P03_GetMissingNumber.py)

    * [Check the number that occurs odd number of times](Arrays/P04_OddNumberOfTimes.py)

    * [Determine two elements in an array whose sum is equal to specified sum](Arrays/P05_CheckForPairSum.py)

# Linked Lists

* [Linked Lists Concept](https://github.com/OmkarPathak/Data-Structures-using-Python/blob/master/Linked%20Lists/Linked%20Lists.ipynb)

    * [Singly Linked List implementation](Linked%20Lists/SinglyLinkedList.py)

    * [Doubly Linked List implementation](Linked%20Lists/DoublyLinkedList.py)

    * [Finding the length of linked list](Linked%20Lists/P01_FindingLengthOfLinkedList.py)

    * [Reversing the linked list](Linked%20Lists/P02_ReversingLinkedList.py)

# Stack

* [Stack Concept](https://github.com/OmkarPathak/Data-Structures-using-Python/tree/master/Stack/Stack.ipynb)

    * [Stack implementation](https://github.com/OmkarPathak/Data-Structures-using-Python/tree/master/Stack/Stack.py)

    * [Infix to Postfix conversion](Stack/P01_InfixToPostfix.py)

    * [Balanced Parenthesis](Stack/P02_BalancedParenthesis.py)

    * [Decimal to Binary conversion using Stack](Stack/P03_DecimalToBinary.py)

    * [Reversing a String using stack](Stack/P04_ReverseString.py)

# Queue

* [Queue Concept](https://github.com/OmkarPathak/Data-Structures-using-Python/tree/master/Queue/Queue.ipynb)

    * [Queue implementation](Queue/Queue.py)

    * [Circular Queue](Queue/CicularQueue.py)

    * [Double Ended Queue](Queue/Deque.py)

    * [Priority Queue](Queue/PriorityQueue.py)

# Tree

* [Tree Concept](https://github.com/OmkarPathak/Data-Structures-using-Python/blob/master/Trees/Tree.ipynb)

    * [Tree implementation](Trees/Tree.py)

    * [Binary Search Tree](Trees/BinarySearchTree.py)

    * [Breadth First Traversal](Trees/P01_BreadthFirstTraversal.py)

    * [Count Leaf Nodes](Trees/P02_CountLeafNodes.py)

    * [Construct tree from inorder and preorder](Trees/P03_TreeFromInorderAndPreorder.py)

    * [Finding root to leaf paths](Trees/P04_RootToLeafPaths.py)

    * [Finding the inorder predecessor and successor](Trees/P05_InorderPredecessorAndSuccessor.py)

# Graph

* [Graph Concept](https://github.com/OmkarPathak/Data-Structures-using-Python/tree/master/Graph/Graph.ipynb)

    * [Graph implementation](Graph/Graph.py)

    * [Breadth First Search Traversal](Graph/P01_BreadthFirstSearch.py)

    * [Depth First Search Traversal](Graph/P02_DepthFirstSearch.py)

    * [Detect Cycle in Directed Graph](Graph/P03_DetectCycleInDirectedGraph.py)

    * [Detect Cycle in Undirected Graph](Graph/P04_DetectCycleInUndirectedGraph.py)

    * [Topologocal Sort](Graph/P05_TopologicalSort.py)

    * [Prim's Algorithm using Adjacency Matrix](Graph/P06_Prim's-Algorithm.py)

# Heap

* [Heap Concept](https://github.com/OmkarPathak/Data-Structures-using-Python/blob/master/Heap/Heap.ipynb)

    * [Heap implementation (Min Heap)](Heap/Heap.py)

    * [Heap Sort](Heap/P01_HeapSort.py)

    * [Implementing a Max Heap](Heap/P02_MaxHeap.py)

# Dynamic Programming

* [Fibonacci Series](Dynamic%20Programming/P01_Fibonnaci.py)

* [Longest Increasing Subsequence](Dynamic%20Programming/P02_LongestIncreasingSubsequence.py)

* [Longest Continuous Odd Subsequence](Dynamic%20Programming/P03_LongestContinuousOddSubsequence.py)

* [Count Minimum Number of Coins](Dynamic%20Programming/mincoin.py)

# Donation

If you have found my softwares to be of any use to you, do consider helping me pay my internet bills. This would encourage me to create many such softwares :)

| PayPal |  |

|:-------------------------------------------:|:-------------------------------------------------------------:|

| ₹ (INR)  |  |