Python Algorithms

Problem solving with algorithms and Data structures using Python

written by sean base on following git

https://github.com/TheAlgorithms/Python

Github | https://github.com/newsteinking/High_pythonalgorithms

• chapter 1: Sorting
  • Comparison sorts
  • 1.1 Bubble Sort
    • Source: Wikipedia
    • View the algorithm in action
      • 1.1.1 Step-by-step example
      • First Pass
      • Second Pass
      • Third Pass
      • 1.1.2 Bubble sort Animation
      • 1.1.3 Python Code
      • 1.1.4 Bubble Sort Animation
  • 1.2 Selection Sort
    • Source: Wikipedia
    • View the algorithm in action
      • 1.2.1 Selection sort Animation
      • 1.2.2 Python Code
      • 1.2.3 Selection Sort Animation
  • 1.3 Insertion Sort
    • Source: Wikipedia
    • View the algorithm in action
      • 1.3.1 Inertion sort Animation
      • 1.3.2 Python Code
      • 1.3.3 Inertion Sort Animation
  • 1.4 Merge Sort
    • Source: Wikipedia
    • View the algorithm in action
      • 1.4.1 Merge sort Animation
      • 1.4.2 Python Code
      • 1.4.3 Merge Sort Animation
  • 1.5 Quick Sort
    • Source: Wikipedia
    • View the algorithm in action
      • 1.5.1 Quick sort Animation
      • 1.5.2 Python Code
      • 1.5.3 Quick Sort Animation
  • 1.6 Heap Sort
    • Source: Wikipedia
    • View the algorithm in action
      • 1.6.1 Heap sort Animation
      • 1.6.2 Python Code
      • 1.6.3 Heap Sort Animation
  • 1.7 Randix Sort
    • Source: Wikipedia
      • 1.7.1 Randix sort Animation
      • 1.7.2 Python Code
      • 1.7.3 Randix Sort Animation
  • 1.8 Cocktail shaker sort
    • Source: Wikipedia
      • 1.8.1 Cocktail shaker sort Animation
      • 1.8.2 Python Code
  • 1.9 Shell sort
    • Source: Wikipedia
    • View the algorithm in action
      • 1.9.1 Shell sort Animation
      • 1.9.2 Python Code
  • Non Comparison sorts
  • 1.10 Bucket Sort
• chapter 2: Arrays
  • 2.1 delete nth
  • 2.2 flatten
  • 2.3 garage
  • 2.4 josephus
  • 2.5 limit
  • 2.6 longest non repeat
  • 2.7 Max ones index
  • 2.8 Merge Interval
  • 2.9 missing ranges
  • 2.10 move zeros
  • 2.11 n sum
  • 2.12 plus one
  • 2.13 rotate
  • 2.14 summarize ranges
  • 2.15 three sum
  • 2.16 top 1
  • 2.17 trim mean
  • 2.18 two sum
• chapter 3: Backtrack
  • 3.1 add operators
  • 3.2 anagram
  • 3.3 array sum combination
  • 3.4 combination sum
  • 3.5 factor combinations
  • 3.6 find words
  • 3.7 generate abbreviations
  • 3.8 generate parenthesis
  • 3.9 letter combination
  • 3.10 palindrome partioning
  • 3.11 pattern match
  • 3.12 Permute Unique
  • 3.13 Permute
  • 3.14 subsets unique
  • 3.15 subsets
• chapter 4: bfs
  • 4.1 maze search
  • 4.2 shortest distance from alll buidings
  • 4.3 word ladder
• chapter 5: Bit manipulation
  • 5.1 add bitwise operator
  • 5.2 binary gap
  • 5.3 bit operation
  • 5.4 bytes int conversion
  • 5.5 count filps to convert
  • 5.6 count ones
  • 5.7 find difference
  • 5.8 find missing number
  • 5.9 flip bit longest sequence
  • 5.10 has alternative bit
  • 5.11 insert bit
  • 5.12 Power of two
  • 5.13 Remove bit
  • 5.14 Reverse bits
  • 5.15 Single number
  • 5.16 Single number2
  • 5.17 Single number3
  • 5.18 subsets
  • 5.19 swap pair
• chapter 6: Calculator
  • 6.1 math parser
  • Example:
• chapter 7: dfs
  • 7.1 all factors
  • 7.2 count islands
  • 7.3 pacific atlantic
  • 7.4 sudoku solver
  • 7.5 walls and getes
• chapter 8: Dynamic Programming
  • 8.1 buy sell stock
  • 8.2 climbing stairs
  • 8.3 coin change
  • 8.4 combination sum
  • 8.5 edit distance
  • 8.6 egg drop
  • 8.7 fib
  • 8.8 hosoya triangle
  • 8.9 house robber
  • 8.10 job scheduling
  • 8.11 knapsack
  • 8.12 longest increasing
  • 8.13 matrix chain order
  • 8.14 max product subarray
  • 8.15 max subarray
  • 8.16 min cost path
  • 8.17 num decodings
  • 8.18 regex matching
  • 8.19 rod cut
  • 8.20 word break
• chapter 9: graph
  • 9.1 check bipartite
  • 9.2 check digraph strongly connected
  • 9.3 clone graph
  • 9.4 cycle detection
  • 9.5 dijkstra
  • 9.6 find all cliques
  • 9.7 find path
  • 9.8 graph
  • 9.9 markov chain
  • 9.10 minimum spanning tree
  • 9.11 path between two vertices in digraph
  • 9.12 satisfiability
  • 9.13 tarjan
  • 9.14 Transitive Closure DFS
  • 9.15 traveral
• chapter 10: Heap
  • 10.1 binary heap
  • 10.2 k closest points
  • 10.3 merge sorted k lists
  • 10.4 skyline
  • 10.5 sliding window max
• chapter 11: Linked list
  • 11.1 add two numbers
  • 11.2 copy random pointer
  • 11.3 delete node
  • 11.4 first cyclic node
  • 11.5 intersection
  • 11.6 is cyclic
  • 11.7 is paliindrome
  • 11.8 is sorted
  • 11.9 kth to last
  • 11.10 linked list
  • 11.11 merge two list
  • 11.12 partition
  • 11.13 remove duplicates
  • 11.14 remove range
  • 11.15 reverse
  • 11.16 rotate list
  • 11.17 swap in pairs
• chapter 12: Map
  • 12.1 hashtable
  • 12.2 is anagram
  • 12.3 is isomorphic
  • 12.4 logest common subsequence
  • 12.5 randomized set
  • 12.6 separate chaining hashtable
  • 12.7 valid sudoku
  • 12.8 word pattern
• chapter 13: Maths
  • 13.1 base conversion
  • 13.2 combination
  • 13.3 decimal to binary ip
  • 13.4 euler totient
  • 13.5 extended gcd
  • 13.6 factorial
  • 13.7 gcd
  • 13.8 generate stobogrammtic
  • 13.9 hailstone
  • 13.10 is strobogrammatic
  • 13.11 moduler exponetial
  • 13.12 next bigger
  • 13.13 next perfect square
  • 13.14 nth digit
  • 13.15 prime check
  • 13.16 primes sieve of eratosthenes
  • 13.17 pythagoras
  • 13.18 rabin miller
  • 13.19 rsa
  • 13.20 sqrt precision factor
  • 13.21 summing digits
• chapter 14: Matrix
  • 14.1 bomb enemy
  • 14.2 copy transform
  • 14.3 count paths
  • 14.4 crout matrix decomposition
  • 14.5 rotate image
  • 14.6 search in sorted matrix
  • 14.7 sparse dot vector
  • 14.8 sparse mul
  • 14.9 spiral traversal
  • 14.10 sudoku validator
• chapter 15:ml
  • 15.1 nearest neighbor
• chapter 16: queues
  • 16.1 max sliding window
  • 16.2 moving average
  • 16.3 priority queue
  • 16.4 queue
  • 16.5 reconstruct queue
  • 16.6 zigzag iterator
• chapter 17: search
  • 17.1 binary search
  • 17.2 find min rotate
  • 17.3 firt occurrence
  • 17.4 jump search
  • 17.5 last occurrence
  • 17.6 linear search
  • 17.7 next greatest letter
  • 17.8 search insert
  • 17.9 search range
  • 17.10 search rotate
  • Your algorithm's runtime complexity must be in the order of O(log n).
  • 17.11 two sum
• chapter 18: set
  • 18.1 find keyboard row
  • 18.2 randomized set
  • 18.3 set covering
• chapter 19: stack
  • 19.1 is consecutive
  • 19.2 is sorted
  • 19.3 longest abs path
  • 19.4 ordered stack
  • 19.5 remove min
  • 19.6 simplify path
  • 19.7 stack
  • 19.8 stutter
  • 19.9 swithch pairs
  • 19.10 valid parenthesis
• chapter 20: Strings
  • 20.1 add binary
  • 20.2 atbash cipher
  • 20.3 breaking bad
  • 20.4 caesar cipher
  • 20.5 contain string
  • 20.6 count binary substring
  • 20.7 decode string
  • 20.8 delete reocurring
  • 20.9 domain extractor
  • 20.10 encode decode
  • 20.11 first unique char
  • 20.12 fizz buzz
  • 20.13 group anagrams
  • 20.14 int to roman
  • 20.15 is palindrome
  • 20.16 is rotated
  • 20.17 judge circle
  • 20.18 license number
  • 20.19 longest common prefix
  • 20.20 make sentence
  • 20.21 merge string checker
  • 20.22 min distance
  • 20.23 multiply strings
  • 20.24 one edit distance
  • 20.25 rabin karp
  • 20.26 repeat string
  • 20.27 repeat substring
  • 20.28 reverse string
  • 20.29 reverse vowel
  • 20.30 reverse words
  • 20.31 roman to int
  • 20.32 rotate
  • 20.33 strip url params
  • 20.34 strong password
  • 20.35 text justification
  • 20.36 unique morse
  • 20.37 validate coordinates
  • 20.38 word squares
• chapter 21: tree
  • 21.1 avl
  • 21.2 bst
  • bst - array to bst
  • bst - bst closest value
  • bst - bst
  • bst - BSTiterator
  • bst - count left node
  • bst - delete node
  • bst - depth sum
  • bst - height
  • bst - is bst
  • bst - kth smallest
  • bst - lowest common ancestor
  • bst - num empty
  • bst - predecessor
  • bst - serialize deserialize
  • bst - successor
  • bst - unique bst
  • 21.3 red black tree
  • 21.4 segment tree
  • 21.5 traversal
  • traversal - inorder
  • traversal - level order
  • traversal - postorder
  • traversal - preorder
  • traversal - zigzag
  • 21.6 trie
  • trie - add and search
  • trie - trie
  • 21.7 bin tree to list
  • 21.8 binary tree paths
  • 21.9 deepest left
  • 21.10 invert tree
  • 21.11 is balanced
  • 21.12 is subtree
  • 21.13 is symmetric
  • 21.14 logest consecutive
  • 21.15 lowest common ancestor
  • 21.16 max height
  • 21.17 max path sum
  • 21.18 min height
  • 21.19 path sum
  • 21.20 path sum2
  • 21.21 pretty print
  • 21.22 same tree
  • 21.23 tree
• chapter 22: Union-find
  • 22.1 count islands
• chapter 23: Unix
  • 23.1 path
  • full path
  • join with slash
  • simplify path
  • split