Python Data Structures

This project is a repository of common computer science data structures, sorting algorithms, and functions. Comments have been provided to explain the classes' implementation and underlying logic.

Testing

Running the test suite with unittest.

$ python -m unittest discover tests

Running the test suite with coverage report with coverage.

$ coverage run -m unittest discover tests
$ coverage report -m

Sorting Algorithms

• Quicksort
• Mergesort
• Radixsort
• Heapsort
• Topological Sort

Searching Algorithms

• BinarySearch
• Breadth First Search
  • 2D Grid BFS
  • Graph BFS
• Depth First Search
  • 2D Grid DFS
• Finding Duplicates
• Dijkstra's Pathfinding

Data Structures

• LRU Cache
• Naïve Tree
  • In-Order Traversal
  • Pre-Order Traversal
  • Post-Order Traversal
  • Level-Order Traversal
• Binary Search Tree
• Hash Map
  • DJB2 Hash Function
  • SDBM Hash Function
  • Lose/Lose Hash Function
• Heap
• Trie
• Priority Queue
• Linked List
  • Contains Cycles
  • Find Start of Cycle
• Graph
  • Detect Cycle
  • Directed
  • Directed Weighted
• Fenwick Tree

Algorithms

Different algorithmic programs. Grouped by general topic.

Bitwise Algorithms

• Hamming Distance
• Hamming Weight
• Binary Complement

Mathematical Algorithms

• Fibonacci
• Factorial
• Convert Base

String Based Algorithms

• Fizz Buzz
• Permutations
• Combinations
  • Letters in Word
  • Letters from Phone
• Longest Common Prefix
  • Trie
  • Reduce
• Finding Substring
  • Rabin-Karp
• Calculate Edit Distance
• Generate Word Squares