Coding interview preparation.

Includes:

• Backtracking

• Hashing

• Divide and Conquer

• Sorting

• Selection

• Graphs

• Dynamic Programming

• Trees (BST, AVL, Trie)

• Standard Searching

• Linked Structures

• Collection of practice questions from books, CodeJam, HackerRank etc.

TLDR: Common Complexities

Todo:

• args, kwargs

• how to use yield, generators and iterators properly

• more DP

• more Trees (red/black tree, suffix trie, N*array tree)

• more Graph algorithms (dijksta, max flow, shortest path)

• backtracking (depth first search/depth limited search, sudoku)

• P/NP problems

• tail recursion

• selection (mean of medians)

• permutations

• palindromes

• disjoint sets

• AI/ML

• regex

• string searching (Knuth–Morris–Pratt etc)

• OOP

• compare List Comprehension vs Generator Comprehension vs Lambda, Map, Filter

• skip list?

• text processing?

• everything in algos ds in python? & clrs?