https://github.com/miladsade96/ds_algo_code_snippets

Python Data Structures and Algorithms Code Snippets
https://github.com/miladsade96/ds_algo_code_snippets

algorithms data-structures python python3 snippets

Last synced: 3 months ago
JSON representation

Python Data Structures and Algorithms Code Snippets

• Host: GitHub
• URL: https://github.com/miladsade96/ds_algo_code_snippets
• Owner: miladsade96
• License: gpl-3.0
• Created: 2020-04-01T12:27:27.000Z (over 5 years ago)
• Default Branch: master
• Last Pushed: 2021-03-14T08:59:22.000Z (over 4 years ago)
• Last Synced: 2025-02-23T00:23:15.110Z (8 months ago)
• Topics: algorithms, data-structures, python, python3, snippets
• Language: Python
• Size: 408 KB
• Stars: 0
• Watchers: 2
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

          
# DS_Algo_Code_Snippets

## Python Data Structures and Algorithms Code Snippets

## Author:

Milad Sadeghi DM : [@EverLookNeverSee](https://github.com/EverLookNeverSee)

## Table of contents:

* Array Sequences --> [contents](/code_snippets/01_Array_Sequences)

    * Relationship between list length and underlying size --> [source code](/code_snippets/01_Array_Sequences/Number_01.py)

    * Dynamic array implementation --> [source code](/code_snippets/01_Array_Sequences/Number_02.py)

    * Anagram check --> [source code](/code_snippets/01_Array_Sequences/Number_03.py)

    * Array pair sum --> [source code](/code_snippets/01_Array_Sequences/Number_04.py)

    * Find the missing element --> [source code](/code_snippets/01_Array_Sequences/Number_05.py)

    * Largest continuous sum --> [source code](/code_snippets/01_Array_Sequences/Number_06.py)

    * Sentence reversal --> [source code](/code_snippets/01_Array_Sequences/Number_07.py)

    * String compression --> [source code](/code_snippets/01_Array_Sequences/Number_08.py)

    * Unique characters in string --> [source code](/code_snippets/01_Array_Sequences/Number_09.py)

* Stacks , Queues and Deques --> [contents](/code_snippets/02_Stacks_Queues_Deques)

    * Implementation of Stack --> [source code](/code_snippets/02_Stacks_Queues_Deques/Number_01.py)

    * Implementation of Queue --> [source code](/code_snippets/02_Stacks_Queues_Deques/Number_02.py)

    * Implementation of Deque --> [source code](/code_snippets/02_Stacks_Queues_Deques/Number_03.py)

    * Balanced parenthesis check --> [source code](/code_snippets/02_Stacks_Queues_Deques/Number_04.py)

    * Implementing a queue using two stacks --> [source code](/code_snippets/02_Stacks_Queues_Deques/Number_05.py)

* Linked Lists --> [contents](code_snippets/03_Linked_Lists)

    * Implementation of singly linked list --> [source code](/code_snippets/03_Linked_Lists/Number_01.py)

    * Implementation of doubly linked list --> [source code](/code_snippets/03_Linked_Lists/Number_02.py)

    * Singly linked list cycle check --> [source code](/code_snippets/03_Linked_Lists/Number_03.py)

    * Linked list reversal --> [source code](/code_snippets/03_Linked_Lists/Number_04.py)

    * Linked List Nth to Last Node --> [source code](/code_snippets/03_Linked_Lists/Number_05.py)

* Recursion --> [contents](code_snippets/04_Recursion)

    * Implementation of factorial function using recursion --> [source code](/code_snippets/04_Recursion/Number_01.py)

    * Cumulative sum of 0 to given integer using recursion --> [source code](/code_snippets/04_Recursion/Number_02.py)

    * Sum of all individual digits in an integer --> [source code](/code_snippets/04_Recursion/Number_03.py)

    * Word split using recursion --> [source code](/code_snippets/04_Recursion/Number_04.py)

    * Reverse a string using recursion --> [source code](/code_snippets/04_Recursion/Number_05.py)

    * String permutation using recursion --> [source code](/code_snippets/04_Recursion/Number_06.py)

    * Fibonacci sequence implemented in three different ways --> [source code](/code_snippets/04_Recursion/Number_07.py)

    * Coin change problem implemented in two different ways --> [source code](/code_snippets/04_Recursion/Number_08.py)

   

 

* Trees --> [contents](/code_snippets/05_Trees)

    * Representing a tree using nodes and references --> [source code](/code_snippets/05_Trees/Number_01.py)

    * Tree traversals: preorder, postorder, inorder --> [source code](/code_snippets/05_Trees/Number_02.py)

    * Binary heap implementation --> [source code](/code_snippets/05_Trees/Number_03.py)

  

## License

GPL - [more details](LICENSE)