Kolokodess / Practice-Coding-in-Python

Daily study plan of implementing algorithms in python

Practice-Coding-in-Python

Daily study plan of implementing algorithms in python

Strings

Word Count

Palindrome

Anagram

Isomorphism

Reverse words

Length of Last word in a given sentence

String Manipulations

Simple Substring search brute force

Robin Karp algorithm

Search pattern in text

Arrays

Simple array manipulations

Slicing

Linked Lists

Singly LinkedList

Doubly LinkedList

Stack

FIFO

Stack as Queue

Queue

LIFO

Queue as Stack, Circular Buffer

Hash table

Hashing with chaining

Open addressing

Search

Simple Binary Search

Interpolation Search

Sorting

Quicksort

Merge sort

Bubble sort

Bitwise operations

Simple bit manipulations

Trees

Binary search trees: BSTs

Heap / Priority Queue / Binary Heap

Binary Tree Traversals preorder, inorder, postorder

Balanced Search trees: Red Black Trees

Graphs

Simple Graph

BFS

DFS

Dynamic Programming

Maximum increasing subsequence

Set

Bloom Filter

Trie

Simple Trie

Treap

Simple Treap

Cache

LRU cache

Concurrency

Threads in Python

Garbage Collection

Garbage collection in Python

Machine Learning

Linear Regression

Decision Trees

Logistic Regression

Naive Bayes

ADA Boost

SVM

K-means

PCA