{"id":15443721,"url":"https://github.com/omkarpathak/data-structures-using-python","last_synced_at":"2025-05-16T04:05:52.811Z","repository":{"id":41045188,"uuid":"93586265","full_name":"OmkarPathak/Data-Structures-using-Python","owner":"OmkarPathak","description":"This is my repository for Data Structures using Python","archived":false,"fork":false,"pushed_at":"2022-10-07T20:12:55.000Z","size":116,"stargazers_count":968,"open_issues_count":22,"forks_count":437,"subscribers_count":24,"default_branch":"master","last_synced_at":"2025-05-16T04:05:44.999Z","etag":null,"topics":["algorithms","data-structures","hacktoberfest","hacktoberfest2018","python3"],"latest_commit_sha":null,"homepage":null,"language":"Jupyter Notebook","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"gpl-3.0","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/OmkarPathak.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null}},"created_at":"2017-06-07T02:59:59.000Z","updated_at":"2025-05-13T18:59:04.000Z","dependencies_parsed_at":"2022-08-10T01:34:54.146Z","dependency_job_id":null,"html_url":"https://github.com/OmkarPathak/Data-Structures-using-Python","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/OmkarPathak%2FData-Structures-using-Python","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/OmkarPathak%2FData-Structures-using-Python/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/OmkarPathak%2FData-Structures-using-Python/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/OmkarPathak%2FData-Structures-using-Python/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/OmkarPathak","download_url":"https://codeload.github.com/OmkarPathak/Data-Structures-using-Python/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":254464895,"owners_count":22075570,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["algorithms","data-structures","hacktoberfest","hacktoberfest2018","python3"],"created_at":"2024-10-01T19:36:30.729Z","updated_at":"2025-05-16T04:05:52.762Z","avatar_url":"https://github.com/OmkarPathak.png","language":"Jupyter Notebook","funding_links":["https://paypal.me/omkarpathak27"],"categories":[],"sub_categories":[],"readme":"# Data-Structures-using-Python\nThis is my repository for Data Structures using Python.\nThis repository mainly aims at implementation of various Data Structures using Python.\n\nOmkar Pathak,\u003cbr /\u003e\nPune, Maharashtra, India.\u003cbr /\u003e\n\n# Arrays\n\n* [Arrays Concept](https://github.com/OmkarPathak/Data-Structures-using-Python/blob/master/Arrays/Arrays.ipynb)\n    * [Array implementation](Arrays/Arrays.py)\n    * [Reversing an Array](Arrays/P01_ReversingArray.py)\n    * [Array Rotation](Arrays/P02_ArrayRotation.py)\n    * [Get the missing number](Arrays/P03_GetMissingNumber.py)\n    * [Check the number that occurs odd number of times](Arrays/P04_OddNumberOfTimes.py)\n    * [Determine two elements in an array whose sum is equal to specified sum](Arrays/P05_CheckForPairSum.py)\n\n# Linked Lists\n\n* [Linked Lists Concept](https://github.com/OmkarPathak/Data-Structures-using-Python/blob/master/Linked%20Lists/Linked%20Lists.ipynb)\n    * [Singly Linked List implementation](Linked%20Lists/SinglyLinkedList.py)\n    * [Doubly Linked List implementation](Linked%20Lists/DoublyLinkedList.py)\n    * [Finding the length of linked list](Linked%20Lists/P01_FindingLengthOfLinkedList.py)\n    * [Reversing the linked list](Linked%20Lists/P02_ReversingLinkedList.py)\n\n# Stack\n\n* [Stack Concept](https://github.com/OmkarPathak/Data-Structures-using-Python/tree/master/Stack/Stack.ipynb)\n    * [Stack implementation](https://github.com/OmkarPathak/Data-Structures-using-Python/tree/master/Stack/Stack.py)\n    * [Infix to Postfix conversion](Stack/P01_InfixToPostfix.py)\n    * [Balanced Parenthesis](Stack/P02_BalancedParenthesis.py)\n    * [Decimal to Binary conversion using Stack](Stack/P03_DecimalToBinary.py)\n    * [Reversing a String using stack](Stack/P04_ReverseString.py)\n\n# Queue\n\n* [Queue Concept](https://github.com/OmkarPathak/Data-Structures-using-Python/tree/master/Queue/Queue.ipynb)\n    * [Queue implementation](Queue/Queue.py)\n    * [Circular Queue](Queue/CicularQueue.py)\n    * [Double Ended Queue](Queue/Deque.py)\n    * [Priority Queue](Queue/PriorityQueue.py)\n\n# Tree\n\n* [Tree Concept](https://github.com/OmkarPathak/Data-Structures-using-Python/blob/master/Trees/Tree.ipynb)\n    * [Tree implementation](Trees/Tree.py)\n    * [Binary Search Tree](Trees/BinarySearchTree.py)\n    * [Breadth First Traversal](Trees/P01_BreadthFirstTraversal.py)\n    * [Count Leaf Nodes](Trees/P02_CountLeafNodes.py)\n    * [Construct tree from inorder and preorder](Trees/P03_TreeFromInorderAndPreorder.py)\n    * [Finding root to leaf paths](Trees/P04_RootToLeafPaths.py)\n    * [Finding the inorder predecessor and successor](Trees/P05_InorderPredecessorAndSuccessor.py)\n\n# Graph\n\n* [Graph Concept](https://github.com/OmkarPathak/Data-Structures-using-Python/tree/master/Graph/Graph.ipynb)\n    * [Graph implementation](Graph/Graph.py)\n    * [Breadth First Search Traversal](Graph/P01_BreadthFirstSearch.py)\n    * [Depth First Search Traversal](Graph/P02_DepthFirstSearch.py)\n    * [Detect Cycle in Directed Graph](Graph/P03_DetectCycleInDirectedGraph.py)\n    * [Detect Cycle in Undirected Graph](Graph/P04_DetectCycleInUndirectedGraph.py)\n    * [Topologocal Sort](Graph/P05_TopologicalSort.py)\n    * [Prim's Algorithm using Adjacency Matrix](Graph/P06_Prim's-Algorithm.py)\n\n# Heap\n\n* [Heap Concept](https://github.com/OmkarPathak/Data-Structures-using-Python/blob/master/Heap/Heap.ipynb)\n    * [Heap implementation (Min Heap)](Heap/Heap.py)\n    * [Heap Sort](Heap/P01_HeapSort.py)\n    * [Implementing a Max Heap](Heap/P02_MaxHeap.py)\n\n# Dynamic Programming\n\n* [Fibonacci Series](Dynamic%20Programming/P01_Fibonnaci.py)\n* [Longest Increasing Subsequence](Dynamic%20Programming/P02_LongestIncreasingSubsequence.py)\n* [Longest Continuous Odd Subsequence](Dynamic%20Programming/P03_LongestContinuousOddSubsequence.py)\n* [Count Minimum Number of Coins](Dynamic%20Programming/mincoin.py)\n\n# Donation\n\nIf 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 :)\n\n| PayPal | \u003ca href=\"https://paypal.me/omkarpathak27\" target=\"_blank\"\u003e\u003cimg src=\"https://www.paypalobjects.com/webstatic/mktg/logo/AM_mc_vs_dc_ae.jpg\" alt=\"Donate via PayPal!\" title=\"Donate via PayPal!\" /\u003e\u003c/a\u003e |\n|:-------------------------------------------:|:-------------------------------------------------------------:|\n| ₹ (INR)  | \u003ca href=\"https://www.instamojo.com/@omkarpathak/\" target=\"_blank\"\u003e\u003cimg src=\"https://www.soldermall.com/images/pic-online-payment.jpg\" alt=\"Donate via Instamojo\" title=\"Donate via instamojo\" /\u003e\u003c/a\u003e |\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fomkarpathak%2Fdata-structures-using-python","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fomkarpathak%2Fdata-structures-using-python","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fomkarpathak%2Fdata-structures-using-python/lists"}