HOME
Federated Learning
Differential Privacy
Applying DP
DP relaxations
Deep Learning
Computer Vision
Natural Language Processing
Tabular Data
DataStructures & Algorithms
MOOCS
Publications
Bookshelf
Algorithms
Sorting
Merge sorting
Quick sorting
3way Quick sorting
Selection sorting
Searching
Binary search
Compter real sqrt
Find first occurance
Search cyclically sorted array
Greedy
Car fueling
Job sequencing
Max. ads revenue
Money change
Min. spanning tree
Max. loot
Disjkstra adjacency matrix
Recursion
GCD
coins max gain
generate permutation
levenshtien distance
N queens
towers of hanoi
Graph
Eulerian path in undirected graph
Min. cost path
Backtracking
Eulerian path in undirected graph
Min. cost path
String
Alien dictionary
Backspace string compare
Math
Death in circle
Implementation
Black & white
Max. rect in histogram
Dyanmic prog. I
Consecutive 1s not allowed
Bed Bath & beyond
Knapsack
Levenshtien distance
Longest common subsequence
Dynamic prog. II
Max. Profit
Min. triangle path
Moves to climb stairs
Divide & conquer
Binary search (again)
Improved quick sort
Inversions
Majority element
Data structures
Hash Table
Hash table using chaining
Linear Hash table
Binary Tree
Binary Tree
Heap
Heap
Array to heap
Linked list
Double linked list
single linked list (py)
single linked list (cpp)
Queue
Queue
Stack
Stack
Largest rectangle area (cpp)
Largest rectangle area (py)
Trie
Trie