Data-Structure-Problems

This repository contains all the code for implemenation of algorithms and data structures from scratch in python. All the code in the repository is referenced from the book attacked.
The book itself is not sufficient to understand some hard concepts here are some list of youtube playlists for references which I took to understand them.

• Mit Open Course Ware
• Abdul Bari
• My Code School

If you click of the Folders in the table of content, each folder has it's own readme file which contains all the algorithms implemented inside that folder with time complexities, pseudocode and references.

Table Of content

1. Algorithms

   • Backtracking
     • N-Queen
     • Tower of Hanoi
   • Greedy
     • Huffman-Coding
     • Knap-Sack
     • Interval-Scheduling
   • Searching
     • Binary Search
     • Finding-Missing-Number
     • Rabin-Karp
     • Tries
   • Sorting
     • Bubble-Sort
     • Counting-Sort
     • Insertion-Sort
     • Merge-Sort
     • Quick-Sort
     • Radix-Sort
     • Selection-Sort
     • Heap Sort

2. Data Structures

   • Disjoint-Sets
     • Disjoint-Sets-Implementation
   • Graphs
     • Graph-Implementation
     • Bellmon-Ford-Algorithm
     • Dijktra's Shortest Path
   • Hashtables
     • Hashtable-Implementation
     • Bloomfilters
   • Heaps
     • Heap Implementation
   • Linked-Lists
     • Circular Linked List
     • Flyod Circle Finding Algorithm
     • Merge Sorted Linked Lists
   • Queue
     • Queue Implementation
     • Queue Implementation With Stack
     • Interleaving Queue
   • Stacks
     • Stack Implementation
     • Stack Throught Dynamic Array
     • Advanced Stack
     • Span-Finding
     • Infix To Post Fix
     • Reverse Stack
     • Syntax checker
   • Trees
     • Avl Tree
     • Binary Search Tree
     • Doubly Linked List To Tree
     • Generic Trees
     • Next Sibbling Trees
     • Threaded Binary Trees
     • Tree Implementation
     • Tree Traversals
     • Zig Zag Traversel
     • Miscelenous Questions

Directory Structures

|
|____ Algorithms
|    |____ Backtracking
|    |    |____ N-Queen
|    |    |____ Towers-Of-Hanoi
|    |____ Searching
|    |    |____ binary-search.py
|    |    |____ find-missing-number.py
|    |    |____ rabin-karp.py
|    |    |____ tries.py
|    |    |____ documentation
|    |____ Sorting
|    |    |____ bubble-sort.py
|    |    |____ counting-sort.py
|    |    |____ insertion-sort.py
|    |    |____ merge-sort.py
|    |    |____ quick-sort.py
|    |    |____ radix-sort.py
|    |    |____ selection-srot.py
|    |    |____ documentation
|
|____ Data-Strucutes
|    |____ Disjoint-Sets
|    |    |____ disjoint-sets.py
|    |____ Graphs
|    |    |____ graph.py
|    |    |____ documentation
|    |____ Hashtables
|    |    |____ hashtable.py
|    |    |____ bloomfilters.py
|    |    |____ documentation
|    |____ Heaps
|    |    |____ heap.py
|    |    |____ documentation
|    |____ Linked-Lists
|    |    |____ circular-linked-list.py
|    |    |____ flyod-cycle-finding.py
|    |    |____ merge-sorted-list.py
|    |____ Queues
|    |    |____ queue.py
|    |    |____ queue-with-stack.py
|    |    |____ inter-leaving-queue.py
|    |____ Stacks
|    |    |____ stack.py
|    |    |____ stack-with-dynamic-array.py
|    |    |____ syntax-checker.py
|    |    |____ infix-to-postfix.py
|    |    |____ findspans.py
|    |    |____ advancedstack.py
|    |____ Trees
|    |    |____ tree.py
|    |    |____ avl-tree.py
|    |    |____ binary-search-tree.py
|    |    |____ generic-trees.py
|    |    |____ next-sibbling-tess.py
|    |    |____ threaded-binary-trees.py
|    |    |____ zig-zag-traverse.py

Line of Code: 3078