KO | EN

GitLite

Minimalist Open Source Repository Search Engine

gitlite — search

#typescript #ai-agents #developer-tools #cli #codex #claude-code #react #mcp #open-source #deepseek-harness #dsh-plugin #ai

Data-Structures-using-Python

★ 972 Open GitHub ↗

This is my repository for Data Structures using Python

// repository documentation

Was this content helpful?

★ 0 (0 ratings)

# 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,<br />
Pune, Maharashtra, India.<br />

# 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 | <a href="https://paypal.me/omkarpathak27" target="_blank"><img src="https://www.paypalobjects.com/webstatic/mktg/logo/AM_mc_vs_dc_ae.jpg" alt="Donate via PayPal!" title="Donate via PayPal!" /></a> |
|:-------------------------------------------:|:-------------------------------------------------------------:|
| ₹ (INR)  | <a href="https://www.instamojo.com/@omkarpathak/" target="_blank"><img src="https://www.soldermall.com/images/pic-online-payment.jpg" alt="Donate via Instamojo" title="Donate via instamojo" /></a> |

Data-Structures-using-Python

Explore Similar Repositories

Was this content helpful?

Recent Feedback

Download README