• #algorithms(4) • #applied-ml(1) • #bfs(6) • #binary search(7) • #binary tree(2) • #computational-graph(3) • #computer-vision(2) • #deep-learning(2) • #dfs(1) • #dijkstra sssp(2) • #distributed-computing(1) • #distributed-systems(1) • #dp(6) • #dsu(2) • #eulerian path(1) • #fenwick trees(1) • #greedy(8) • #heap(1) • #intervals(5) • #knapsack(2) • #line sweep(4) • #linked list(7) • #machine-learning(11) • #monotonic stack(5) • #mst(3) • #optimisation(4) • #optimisers(1) • #palindromes(4) • #permutation(2) • #prefix sum(1) • #probability(3) • #probability-theory(1) • #ranking(1) • #rmq(2) • #search(1) • #segment trees(1) • #self attention(1) • #sliding window(4) • #stack(3) • #statistics(1) • #stories(2) • #string(4) • #sub sequence(2) • #topological sort(2) • #transformers(1) • #trie(1) • #two pointers(3)

#algorithms

[notes] Knapsack
[notes] Quick Select
[posts] Finding Median
[posts] Binary Search

#applied-ml

[notes] Movie Reviews and Gradient Descent

#bfs

[collections] 01 Matrix
[collections] All Nodes Distance K in Binary Tree
[collections] Cheapest Flights Within K Stops
[collections] Jump Game III
[collections] Shortest Path in Binary Matrix
[collections] Swim in Rising Water
[collections] Binary Search in Sorted Array
[collections] Find Minimum in Rotated Sorted Array
[collections] First and Last Position in a Sorted Array
[collections] Minimum Limit of Balls in a Bag
[collections] Split Array Largest Sum
[collections] Swim in Rising Water
[collections] Zero Array Transformation II

#binary tree

[collections] All Nodes Distance K in Binary Tree
[collections] Check Completeness of a Binary Tree

#computational-graph

[notes] Gradient Through Concatenation
[notes] Gradient Through Addition with Broadcasting
[posts] Differentiable Computations

#computer-vision

[notes] Canny Edge detector
[notes] Histogram of Oriented Gradients

#deep-learning

[notes] Common Optimisers
[notes] Focal Loss

#dfs

[collections] Reconstruct Itinerary

#dijkstra sssp

[collections] Cheapest Flights Within K Stops
[collections] Dijkstra Algorithm

#distributed-computing

[notes] Reservoir Sampling

#distributed-systems

[links] Evolution of Search Engines

#dp

[collections] Distinct Subsequences
[collections] Edit Distances
[collections] Interleaving String
[collections] Sum of Good Subsequences
[collections] Target Sum
[collections] Word break

#dsu

[collections] Making A Large Island
[collections] Number of Connected Components in an Undirected Graph

#eulerian path

[collections] Reconstruct Itinerary

#fenwick trees

[collections] Fenwick Trees and Prefix Sums

#greedy

[collections] Best Time to Buy and Sell Stock
[collections] Best Time to Buy and Sell Stock II
[collections] Gas Station
[collections] Jump Game
[collections] Jump Game II
[collections] Max Chunks To Make Sorted
[collections] Min Meeting Rooms
[collections] Minimum Number of Arrows to Burst Balloons

#heap

[collections] Median in a Stream

#intervals

[collections] Insert Interval
[collections] Merge Intervals
[collections] Min Meeting Rooms
[collections] Minimum Number of Arrows to Burst Balloons
[collections] Smallest Range Covering Elements from K Lists

#knapsack

[collections] Coin Change
[collections] Coin Change II

#line sweep

[collections] Line Sweep Technique
[collections] Smallest Range Covering Elements from K Lists
[collections] Zero Array Transformation I
[collections] Zero Array Transformation II

#linked list

[collections] Detecting a Cycle in Linked List
[collections] Implementing LRU Cache
[collections] Merge K Sorted Lists
[collections] Merging Two Sorted Linked Lists
[collections] Remove Nodes From Linked List
[collections] Remove Nth Node From End of List
[collections] Reverse Linked List

#machine-learning

[posts] XGBoost
[posts] Normalisation Layers
[posts] Variational Inference
[notes] Gradient Boosting
[notes] Attribute Selection in Decision Trees
[notes] Bias and Variance
[notes] Common Optimisers
[notes] Focal Loss
[notes] Softmax Classifier
[notes] Linear Classifiers
[notes] Bayes Error

#monotonic stack

[collections] Daily Temperatures
[collections] Largest Rectangle in Histogram
[collections] Monotonic Stack
[collections] Remove Nodes From Linked List
[collections] Sum of Subarray Minimums

#mst

[collections] Kruskals algorithm
[collections] Min Cost to Connect All Points
[collections] Prims Algorithm

#optimisation

[posts] Variational Inference
[notes] KKT conditions and Lagrange multipliers
[notes] BFGS
[notes] Newton's Method

#optimisers

[collections] Kitchen sink optimiser model

#palindromes

[collections] Count Palindromic Substrings
[collections] Longest Palindromic Substring
[collections] Manacher Algorithm
[collections] Palindromic Partition

#permutation

[collections] Next Permutation
[collections] Permutation Sequence

#prefix sum

[collections] Fenwick Trees and Prefix Sums

#probability

[posts] Sampling in a Sphere
[posts] Variational Inference
[notes] Reservoir Sampling

#probability-theory

[links] Diffusion Models

#ranking

[notes] RankNet and LambdaRank

#rmq

[collections] Fenwick Trees and Prefix Sums
[collections] Segment Trees
[notes] RankNet and LambdaRank

#segment trees

[collections] Segment Trees

#self attention

[collections] Implementing Self Attention

#sliding window

[collections] Longest Substring Without Repeating Characters
[collections] Partition Labels
[collections] String Compression
[collections] Take K of Each Character From Left and Right

#stack

[collections] Asteroid Collision
[collections] Longest Valid Parentheses
[collections] Valid Parenthesis String

#statistics

[posts] Sampling in a Sphere

#stories

[stories] Productivity Principles
[stories] Logic Bulling

#string

[collections] Distinct Subsequences
[collections] Edit Distances
[collections] Interleaving String
[collections] Reorganize String

#sub sequence

[collections] Distinct Subsequences
[collections] Sum of Good Subsequences

#topological sort

[collections] Find Eventual Safe States
[collections] Topological Sort

#transformers

[collections] Implementing Self Attention

#trie

[collections] Word break

#two pointers

[collections] Containers with Most Water
[collections] Longest Substring Without Repeating Characters
[collections] String Compression