Tags

algorithms

• Knapsack
• Quick Select
• Finding Median
• Statistics from Streaming Data
• Binary Search

applied-ml

• Movie Reviews and Gradient Descent

bfs

• 01 Matrix
• All Nodes Distance K in Binary Tree
• Cheapest Flights Within K Stops
• Jump Game III
• Shortest Path in Binary Matrix
• Swim in Rising Water

binary search

• Binary Search in Sorted Array
• Find Minimum in Rotated Sorted Array
• First and Last Position in a Sorted Array
• Minimum Limit of Balls in a Bag
• Split Array Largest Sum
• Swim in Rising Water
• Zero Array Transformation II

binary tree

• All Nodes Distance K in Binary Tree
• Check Completeness of a Binary Tree

computational-graph

• Gradient Through Concatenation
• Gradient Through Addition with Broadcasting
• Differentiable Computations

computer-vision

• Canny Edge detector
• Histogram of Oriented Gradients

deep-learning

• Common Optimisers
• Focal Loss

dfs

• Reconstruct Itinerary

dijkstra sssp

• Cheapest Flights Within K Stops
• Dijkstra Algorithm

distributed-computing

• Reservoir Sampling

distributed-systems

• Evolution of Search Engines

dp

• Distinct Subsequences
• Edit Distances
• Interleaving String
• Sum of Good Subsequences
• Target Sum
• Word break

dsu

• Making A Large Island
• Number of Connected Components in an Undirected Graph

eulerian path

• Reconstruct Itinerary

fenwick trees

• Fenwick Trees and Prefix Sums

greedy

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

heap

• Median in a Stream

intervals

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

knapsack

• Coin Change
• Coin Change II

line sweep

• Line Sweep Technique
• Smallest Range Covering Elements from K Lists
• Zero Array Transformation I
• Zero Array Transformation II

linked list

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

llm

• LoRA

machine-learning

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

monotonic stack

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

mst

• Kruskals algorithm
• Min Cost to Connect All Points
• Prims Algorithm

optimisation

• Variational Inference
• KKT conditions and Lagrange multipliers
• BFGS
• Newton's Method

optimisers

• Kitchen sink optimiser model

palindromes

• Count Palindromic Substrings
• Longest Palindromic Substring
• Manacher Algorithm
• Palindromic Partition

permutation

• Next Permutation
• Permutation Sequence

prefix sum

• Fenwick Trees and Prefix Sums

probability

• Sampling in a Sphere
• Variational Inference
• Reservoir Sampling

probability-theory

• Diffusion Models

ranking

• RankNet and LambdaRank

recommendation system

• A Tale of Two Towers
• Scaling CF with Neural Networks and Features
• The "Zero" Problem
• Collaborative Filtering - The Foundations and Flaws

rmq

• Fenwick Trees and Prefix Sums
• Segment Trees

search

• RankNet and LambdaRank

segment trees

• Segment Trees

self attention

• Implementing Self Attention

sliding window

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

stack

• Asteroid Collision
• Longest Valid Parentheses
• Valid Parenthesis String

statistics

• Sampling in a Sphere
• Statistics from Streaming Data

stories

• Productivity Principles
• Logic Bulling

string

• Distinct Subsequences
• Edit Distances
• Interleaving String
• Reorganize String

sub sequence

• Distinct Subsequences
• Sum of Good Subsequences

topological sort

• Find Eventual Safe States
• Topological Sort

transformers

• Implementing Self Attention

trie

• Word break

two pointers

• Containers with Most Water
• Longest Substring Without Repeating Characters
• String Compression