Repository files navigation

I started the project by learning data structures and algorithms from a bookProblem Solving with Algorithms and Data Structures using Python.It does not contain everything from the book,nor is everything implemented in the same way,but it also contains other data structures, algorithms and problems.

Book website

Videos

• Anagrams - quadratic solution
• Anagrams - log linear solution
• Anagrams - linear solution
• Time - iterative solution
• Time - non-iterative solution

• Stack - array implementation
• Stack - less efficient array implementation
• Stack - fixed size array implementation
• Stack two queues
• Stack - linked list implementation
  • Examples
    • Balanced brackets
    • Number converter

• Queue - array implementation
• Queue - fixed size array implementation
• Queue - linked list implementation
• Circular queue - fixed size array implementation
• Queue - two stacks implementation

• Deque - array implementation
• Circular deque - fixed size array implementation
• Deque - linked list implementation

• Singly linked list
• Doubly linked list
• Circular singly linked list
• Circular doubly linked list

• Convert number - recursive solution
• Convert number - iterative solution
• Factorial
• Fibonacci - iterative solution
• Fibonacci - recursive worst solution
• Fibonacci - memoization
• Fibonacci - recursive solution
• Fibonacci sum recursive
• Fibonacci sum iterative
• Maze - path finder
• Palindrome
• Reverse linked list - recursive solution
• Reverse linked list - iterative solution
• Reverse linked list - iterative solution stack
• Reverse list
• Reverse string
• Sum numbers - binary recursion
• Sum numbers - recursion with pointer
• Sum numbers - recursion with slicing
• Towers of Hanoi

• Sequential search - unordered list
• Sequential search - ordered list
• Binary search iterative
• Binary search recursive
• Binary search recursive pointers

• Linear probing
• Chaining

• List of lists representation
• Class representation
• Parse tree
• Tree traversal
  • Methods
  • Functions
  • Preorder traversal example
  • Inorder traversal example
  • Postorder traversal example
• Binary Heap - min heap implementation
• Binary Search Tree
• AVL tree

• Bubble sort
• Short bubble
• Insertion sort
• Selection sort
• Merge sort
• Quicksort in place
• Quicksort - return new array

• Breadth first search
• Depth first search
  • Depth first search - stack
  • Depth first search - recursive
• Cycle detection
  • Cycle detection directed graph
  • Cycle detection undirected graph
• Topological sorting
• Dijkstra algorithm - Shortest path
  • Priority Queue implementation
  • Matrix implementation
  • Adjacency list implementation
• Bellman-Ford algorithm
• Bellman-Ford algorithm - negative weight cycle
• Minimum Spanning Tree
  • Minimum Spanning Tree in undirected graph
  • Prim's algorithm - Minimum Spanning Tree in undirected weighted graph
  • Kruskal's algorithm - Minimum Spanning Tree in undirected weighted graph
• Is graph bipartite
• Union find
  • Number of connected components
  • Union find path compression
• Kosaraju's algorithm

• Trie

• Brute force algorithm