{"problems":[{"title":"Matrix-Vector Dot Product","category":"Linear Algebra","difficulty":"easy","id":"1","createdAt":"July 22, 2026 at 9:04:06 AM UTUTC-4"},{"title":"Calculate Covariance Matrix","category":"Statistics","difficulty":"easy","id":"10","createdAt":"July 22, 2026 at 9:04:07 AM UTUTC-4"},{"title":"Implement the Softsign Activation Function","category":"Deep Learning","difficulty":"easy","id":"100","createdAt":"July 22, 2026 at 9:04:07 AM UTUTC-4"},{"title":"Backward Pass of Tensor Reshape","category":"Deep Learning","difficulty":"easy","id":"1000","createdAt":"May 20, 2026 at 9:56:07 AM UTUTC-4"},{"title":"Backward Pass of Row-wise Max Operation","category":"Deep Learning","difficulty":"medium","id":"1001","createdAt":"May 20, 2026 at 9:56:07 AM UTUTC-4"},{"title":"Fused Backward Pass of BatchNorm1d","category":"Deep Learning","difficulty":"hard","id":"1002","createdAt":"May 20, 2026 at 9:56:07 AM UTUTC-4"},{"title":"BatchNorm1d Forward with Bessel's Correction","category":"Deep Learning","difficulty":"easy","id":"1003","createdAt":"May 20, 2026 at 9:56:07 AM UTUTC-4"},{"title":"Implement FlattenConsecutive Layer for Hierarchical Fusion","category":"Deep Learning","difficulty":"medium","id":"1004","createdAt":"May 20, 2026 at 10:08:23 AM UTUTC-4"},{"title":"BatchNorm1d Supporting 2D and 3D Inputs","category":"Deep Learning","difficulty":"medium","id":"1005","createdAt":"May 20, 2026 at 10:08:23 AM UTUTC-4"},{"title":"Implement a Sequential Container for Neural Network Layers","category":"Deep Learning","difficulty":"easy","id":"1006","createdAt":"May 20, 2026 at 10:08:23 AM UTUTC-4"},{"title":"GPT FeedForward Block (Linear-GELU-Linear)","category":"Machine Learning","difficulty":"medium","id":"1007","createdAt":"May 20, 2026 at 10:50:18 AM UTUTC-4"},{"title":"Shortcut Connection Gradient Effect in Deep Networks","category":"Machine Learning","difficulty":"medium","id":"1008","createdAt":"May 20, 2026 at 10:50:18 AM UTUTC-4"},{"title":"Count Trainable Parameters with Weight Tying in a GPT Model","category":"Machine Learning","difficulty":"medium","id":"1009","createdAt":"May 20, 2026 at 10:50:18 AM UTUTC-4"},{"title":"Implement the GRPO Objective Function","category":"Reinforcement Learning","difficulty":"hard","id":"101","createdAt":"January 26, 2026 at 9:29:50 AM UTC-0500"},{"title":"Model Memory Footprint Estimation","category":"Machine Learning","difficulty":"medium","id":"1010","createdAt":"May 20, 2026 at 10:50:18 AM UTUTC-4"},{"title":"Pre-allocated Sliding KV Cache Update","category":"Deep Learning","difficulty":"hard","id":"1011","createdAt":"May 20, 2026 at 12:08:04 PM UTUTC-4"},{"title":"KV Cache Size Estimator for MLA vs MHA vs GQA","category":"Deep Learning","difficulty":"easy","id":"1012","createdAt":"May 20, 2026 at 12:08:04 PM UTUTC-4"},{"title":"Distribute SWA and Full Attention Layers by Ratio","category":"Deep Learning","difficulty":"easy","id":"1013","createdAt":"May 20, 2026 at 12:08:04 PM UTUTC-4"},{"title":"KV Cache Estimator with Sliding Window Attention","category":"Deep Learning","difficulty":"medium","id":"1014","createdAt":"May 20, 2026 at 12:08:04 PM UTUTC-4"},{"title":"MoE Parameter and Active-Token Memory Estimator","category":"Deep Learning","difficulty":"medium","id":"1015","createdAt":"May 20, 2026 at 12:08:04 PM UTUTC-4"},{"title":"Estimate MoE vs Dense FFN Parameters with Match-Dense Sizing","category":"Deep Learning","difficulty":"medium","id":"1016","createdAt":"May 20, 2026 at 12:08:04 PM UTUTC-4"},{"title":"Implement Gated DeltaNet Linear Attention","category":"Deep Learning","difficulty":"hard","id":"1017","createdAt":"May 20, 2026 at 12:08:04 PM UTUTC-4"},{"title":"Delta Rule Update for Associative Memory","category":"Deep Learning","difficulty":"medium","id":"1018","createdAt":"May 20, 2026 at 12:08:04 PM UTUTC-4"},{"title":"Estimate KV-Cache Memory for MHA vs Linear Attention","category":"Deep Learning","difficulty":"easy","id":"1019","createdAt":"May 20, 2026 at 12:08:04 PM UTUTC-4"},{"title":"Implement the Swish Activation Function","category":"Deep Learning","difficulty":"easy","id":"102","createdAt":"July 22, 2026 at 9:04:07 AM UTUTC-4"},{"title":"Implement Cross-Layer KV Sharing in Transformer","category":"Deep Learning","difficulty":"hard","id":"1020","createdAt":"May 20, 2026 at 12:08:04 PM UTUTC-4"},{"title":"Estimate KV-Cache Memory with GQA and Cross-Layer Sharing","category":"Deep Learning","difficulty":"medium","id":"1021","createdAt":"May 20, 2026 at 12:08:04 PM UTUTC-4"},{"title":"L2 Normalization Along an Axis","category":"Linear Algebra","difficulty":"easy","id":"1022","createdAt":"May 20, 2026 at 12:08:04 PM UTUTC-4"},{"title":"Build Causal Mask with Position Offsets for Cached Attention","category":"Deep Learning","difficulty":"medium","id":"1023","createdAt":"May 20, 2026 at 12:08:04 PM UTUTC-4"},{"title":"Implement Llama 3.1 RoPE Frequency Rescaling","category":"Deep Learning","difficulty":"hard","id":"1024","createdAt":"May 21, 2026 at 10:37:07 AM UTUTC-4"},{"title":"Llama 3 RoPE Frequency Scaling","category":"Deep Learning","difficulty":"hard","id":"1025","createdAt":"May 21, 2026 at 10:37:07 AM UTUTC-4"},{"title":"Implement Weight Tying Between Embedding and LM Head","category":"Deep Learning","difficulty":"easy","id":"1026","createdAt":"May 21, 2026 at 10:37:07 AM UTUTC-4"},{"title":"Simulate DDP All-Reduce Gradient Averaging","category":"Deep Learning","difficulty":"medium","id":"1027","createdAt":"May 21, 2026 at 10:37:07 AM UTUTC-4"},{"title":"Resize LM Embedding and Output Head for New Tokens","category":"NLP","difficulty":"medium","id":"1028","createdAt":"May 21, 2026 at 10:37:07 AM UTUTC-4"},{"title":"RoPE with Position Offset for KV Cache","category":"Machine Learning","difficulty":"medium","id":"1029","createdAt":"May 21, 2026 at 10:37:07 AM UTUTC-4"},{"title":"Implement the SELU Activation Function","category":"Deep Learning","difficulty":"easy","id":"103","createdAt":"July 22, 2026 at 9:04:07 AM UTUTC-4"},{"title":"Sequential Weight Loading Peak Memory Simulation","category":"Machine Learning","difficulty":"medium","id":"1030","createdAt":"May 21, 2026 at 10:37:07 AM UTUTC-4"},{"title":"Extending a BPE Tokenizer with New Special Tokens","category":"Machine Learning","difficulty":"medium","id":"1031","createdAt":"May 21, 2026 at 10:37:07 AM UTUTC-4"},{"title":"Tokens-per-Second Throughput from Inference Intervals","category":"Machine Learning","difficulty":"medium","id":"1032","createdAt":"May 21, 2026 at 10:37:07 AM UTUTC-4"},{"title":"Vocabulary Size Padding for Tensor Core Alignment","category":"Machine Learning","difficulty":"medium","id":"1033","createdAt":"May 21, 2026 at 10:37:07 AM UTUTC-4"},{"title":"Chat Template Encoding for Instruct Models","category":"Machine Learning","difficulty":"medium","id":"1034","createdAt":"May 21, 2026 at 10:37:07 AM UTUTC-4"},{"title":"Multi-turn Chat History Prompt Construction (Qwen3 Template)","category":"Machine Learning","difficulty":"medium","id":"1035","createdAt":"May 21, 2026 at 10:37:07 AM UTUTC-4"},{"title":"Trim Input Tokens to Fit Model Context Window","category":"Machine Learning","difficulty":"medium","id":"1036","createdAt":"May 21, 2026 at 10:37:07 AM UTUTC-4"},{"title":"YaRN RoPE Frequency Scaling","category":"Machine Learning","difficulty":"medium","id":"1037","createdAt":"May 21, 2026 at 10:37:07 AM UTUTC-4"},{"title":"Gemma-Style RMSNorm with Zero-Centered Scale","category":"Deep Learning","difficulty":"easy","id":"1038","createdAt":"May 21, 2026 at 10:37:07 AM UTUTC-4"},{"title":"Implement Bias-less Cohere LayerNorm","category":"Deep Learning","difficulty":"easy","id":"1039","createdAt":"May 21, 2026 at 10:37:07 AM UTUTC-4"},{"title":"Binary Classification with Logistic Regression","category":"Machine Learning","difficulty":"easy","id":"104","createdAt":"July 22, 2026 at 9:04:07 AM UTUTC-4"},{"title":"Parallel Transformer Block Forward Pass","category":"Deep Learning","difficulty":"medium","id":"1040","createdAt":"May 21, 2026 at 10:37:07 AM UTUTC-4"},{"title":"Truncate KV Cache for Sliding Window Attention","category":"Deep Learning","difficulty":"medium","id":"1041","createdAt":"May 21, 2026 at 10:37:07 AM UTUTC-4"},{"title":"Bias-less LayerNorm with Float32 Compute","category":"Deep Learning","difficulty":"easy","id":"1042","createdAt":"May 21, 2026 at 10:37:07 AM UTUTC-4"},{"title":"Parallel Attention and FFN Transformer Block","category":"Deep Learning","difficulty":"medium","id":"1043","createdAt":"May 21, 2026 at 10:37:07 AM UTUTC-4"},{"title":"Hybrid Linear/Full Attention Layer Routing","category":"Deep Learning","difficulty":"medium","id":"1044","createdAt":"May 21, 2026 at 10:37:07 AM UTUTC-4"},{"title":"Partial Rotary Position Embedding (Partial RoPE)","category":"Deep Learning","difficulty":"medium","id":"1045","createdAt":"May 21, 2026 at 10:37:07 AM UTUTC-4"},{"title":"Zero-Initialized RMSNorm with (1+w) Scaling","category":"Deep Learning","difficulty":"easy","id":"1046","createdAt":"May 21, 2026 at 10:37:07 AM UTUTC-4"},{"title":"Gemma-Style RMSNorm with Optional Scale","category":"Deep Learning","difficulty":"easy","id":"1047","createdAt":"May 21, 2026 at 10:37:07 AM UTUTC-4"},{"title":"Proportional RoPE Inverse Frequencies with NoPE Tail","category":"Deep Learning","difficulty":"medium","id":"1048","createdAt":"May 21, 2026 at 10:37:07 AM UTUTC-4"},{"title":"Tanh Logit Soft-Capping","category":"Deep Learning","difficulty":"easy","id":"1049","createdAt":"May 21, 2026 at 10:37:07 AM UTUTC-4"},{"title":"Train Softmax Regression with Gradient Descent","category":"Machine Learning","difficulty":"hard","id":"105","createdAt":"January 21, 2026 at 3:42:20 PM UTC-0500"},{"title":"Per-Layer Embedding Projection (PLE)","category":"Deep Learning","difficulty":"hard","id":"1050","createdAt":"May 21, 2026 at 10:37:07 AM UTUTC-4"},{"title":"Gated Per-Layer Input Residual","category":"Deep Learning","difficulty":"medium","id":"1051","createdAt":"May 21, 2026 at 10:37:07 AM UTUTC-4"},{"title":"Scaled Token Embedding Lookup","category":"Deep Learning","difficulty":"easy","id":"1052","createdAt":"May 21, 2026 at 10:37:07 AM UTUTC-4"},{"title":"Sliding Window KV Cache Truncation","category":"Deep Learning","difficulty":"medium","id":"1053","createdAt":"May 21, 2026 at 10:37:07 AM UTUTC-4"},{"title":"Partition Parameters for Muon vs AdamW","category":"Optimization","difficulty":"easy","id":"1054","createdAt":"May 21, 2026 at 10:37:07 AM UTUTC-4"},{"title":"Greedy Streaming Decoder with KV Cache","category":"NLP","difficulty":"medium","id":"1055","createdAt":"May 21, 2026 at 10:37:07 AM UTUTC-4"},{"title":"Pre-Norm GPT Transformer Block Forward Pass","category":"Deep Learning","difficulty":"hard","id":"1056","createdAt":"May 21, 2026 at 10:37:07 AM UTUTC-4"},{"title":"Balance Dataset via Undersampling","category":"Machine Learning","difficulty":"easy","id":"1057","createdAt":"May 21, 2026 at 10:37:07 AM UTUTC-4"},{"title":"Random Train/Validation/Test Split with Shuffling","category":"Machine Learning","difficulty":"easy","id":"1058","createdAt":"May 21, 2026 at 10:37:07 AM UTUTC-4"},{"title":"Pad and Truncate Tokenized Sequences","category":"NLP","difficulty":"easy","id":"1059","createdAt":"May 21, 2026 at 10:37:07 AM UTUTC-4"},{"title":"Train Logistic Regression with Gradient Descent","category":"Machine Learning","difficulty":"hard","id":"106","createdAt":"July 22, 2026 at 9:04:07 AM UTUTC-4"},{"title":"Swap LM Head with Classification Head","category":"Deep Learning","difficulty":"easy","id":"1060","createdAt":"May 21, 2026 at 10:37:07 AM UTUTC-4"},{"title":"Last-Token Classification from Sequence Logits","category":"Deep Learning","difficulty":"easy","id":"1061","createdAt":"May 21, 2026 at 10:37:07 AM UTUTC-4"},{"title":"Gather Logits at Last Non-Padding Token","category":"NLP","difficulty":"medium","id":"1062","createdAt":"May 21, 2026 at 10:37:07 AM UTUTC-4"},{"title":"Mean Pooling Over Sequence Embeddings for Classification","category":"NLP","difficulty":"easy","id":"1063","createdAt":"May 21, 2026 at 10:37:07 AM UTUTC-4"},{"title":"Build Attention Mask from Pad Tokens","category":"NLP","difficulty":"easy","id":"1064","createdAt":"May 21, 2026 at 10:37:07 AM UTUTC-4"},{"title":"Custom Collate Function for Instruction Finetuning","category":"NLP","difficulty":"medium","id":"1065","createdAt":"May 21, 2026 at 10:37:07 AM UTUTC-4"},{"title":"Mask Instruction Tokens for Loss Computation","category":"NLP","difficulty":"medium","id":"1066","createdAt":"May 21, 2026 at 10:37:07 AM UTUTC-4"},{"title":"Masked Log-Probability for Sequence Tokens","category":"NLP","difficulty":"medium","id":"1067","createdAt":"May 21, 2026 at 10:37:07 AM UTUTC-4"},{"title":"DPO Implicit Reward Computation","category":"Deep Learning","difficulty":"easy","id":"1068","createdAt":"May 21, 2026 at 10:37:07 AM UTUTC-4"},{"title":"Preference Dataset Collate Function for DPO","category":"NLP","difficulty":"hard","id":"1069","createdAt":"May 21, 2026 at 10:37:07 AM UTUTC-4"},{"title":"Implement Masked Self-Attention","category":"Deep Learning","difficulty":"medium","id":"107","createdAt":null},{"title":"Greedy Autoregressive Text Generation","category":"NLP","difficulty":"easy","id":"1070","createdAt":"May 21, 2026 at 10:37:07 AM UTUTC-4"},{"title":"Detect Near-Duplicate Text Entries with TF-IDF","category":"NLP","difficulty":"medium","id":"1071","createdAt":"May 21, 2026 at 10:37:07 AM UTUTC-4"},{"title":"Pairwise Cosine Similarity Matrix","category":"Machine Learning","difficulty":"easy","id":"1072","createdAt":"May 21, 2026 at 10:37:07 AM UTUTC-4"},{"title":"Compute Three Correlation Coefficients Between Score Lists","category":"Machine Learning","difficulty":"medium","id":"1073","createdAt":"May 21, 2026 at 10:37:07 AM UTUTC-4"},{"title":"Recursively Replace Linear Layers with LoRA","category":"Deep Learning","difficulty":"medium","id":"1074","createdAt":"May 21, 2026 at 10:37:07 AM UTUTC-4"},{"title":"Backpropagation Through a Scalar Chain Network","category":"Deep Learning","difficulty":"medium","id":"1075","createdAt":"June 3, 2026 at 4:12:14 PM UTUTC-4"},{"title":"Backpropagation Gradients for a Dense Layer","category":"Deep Learning","difficulty":"medium","id":"1076","createdAt":"June 3, 2026 at 4:12:14 PM UTUTC-4"},{"title":"Implement RAFT for RLVR with Binary Rewards","category":"Deep Learning","difficulty":"medium","id":"1077","createdAt":"June 4, 2026 at 10:14:08 AM UTUTC-4"},{"title":"Implement RAFT++ with Importance Sampling and Clipping","category":"Deep Learning","difficulty":"medium","id":"1078","createdAt":"June 4, 2026 at 10:14:08 AM UTUTC-4"},{"title":"Implement Reinforce-Rej: Filtering Trivial Prompt Groups","category":"Deep Learning","difficulty":"medium","id":"1079","createdAt":"June 4, 2026 at 10:14:08 AM UTUTC-4"},{"title":"Measure Disorder in Apple Colors","category":"Machine Learning","difficulty":"easy","id":"108","createdAt":null},{"title":"Generate Input-Target Batches for Language Model Training","category":"Deep Learning","difficulty":"easy","id":"1080","createdAt":"June 12, 2026 at 5:47:57 PM UTUTC-4"},{"title":"Causal Cumulative Mean via Triangular Matrix Multiply","category":"Deep Learning","difficulty":"medium","id":"1081","createdAt":"June 12, 2026 at 5:47:57 PM UTUTC-4"},{"title":"Autoregressive Token Generation with Block-Size Context Cropping","category":"NLP","difficulty":"medium","id":"1082","createdAt":"June 12, 2026 at 5:47:57 PM UTUTC-4"},{"title":"Implement a Trie for Prefix Matching","category":"Data Structures","difficulty":"medium","id":"1083","createdAt":null},{"title":"Implement a Snapshot Array","category":"Data Structures","difficulty":"medium","id":"1084","createdAt":null},{"title":"Best Meeting Point on a 2D Grid","category":"Algorithms","difficulty":"medium","id":"1085","createdAt":null},{"title":"Add Two Numbers as Linked Lists","category":"Data Structures","difficulty":"easy","id":"1086","createdAt":null},{"title":"Detect a Cycle in a Linked List and a Graph","category":"Algorithms","difficulty":"medium","id":"1087","createdAt":null},{"title":"Implement a Hash Table from Scratch","category":"Data Structures","difficulty":"medium","id":"1088","createdAt":null},{"title":"Efficiently Find Duplicates in a Large Dataset","category":"Algorithms","difficulty":"medium","id":"1089","createdAt":null},{"title":"Implement Layer Normalization for Sequence Data","category":"Machine Learning","difficulty":"medium","id":"109","createdAt":null},{"title":"Tree and Graph Coding Drills","category":"Algorithms","difficulty":"medium","id":"1090","createdAt":null},{"title":"Resumable Weighted Data Batcher","category":"Data Structures","difficulty":"medium","id":"1091","createdAt":null},{"title":"Stack Samples to Trace Events Converter","category":"Algorithms","difficulty":"medium","id":"1092","createdAt":null},{"title":"In-Memory Key-Value Store with TTL and Snapshots","category":"Data Structures","difficulty":"medium","id":"1093","createdAt":null},{"title":"Banking Transaction System Core Logic","category":"Data Structures","difficulty":"medium","id":"1094","createdAt":null},{"title":"Persistent LRU Cache","category":"Data Structures","difficulty":"medium","id":"1095","createdAt":null},{"title":"Same-Domain Web Crawler (Sync and Concurrent)","category":"Algorithms","difficulty":"medium","id":"1096","createdAt":null},{"title":"Distributed Mode/Median with Message Passing","category":"Algorithms","difficulty":"hard","id":"1097","createdAt":null},{"title":"Token-Bucket Rate Limiter with Per-User Quotas","category":"Data Structures","difficulty":"medium","id":"1098","createdAt":null},{"title":"LRU Memoization Decorator with Deterministic Key Generation","category":"Data Structures","difficulty":"medium","id":"1099","createdAt":null},{"title":"Solve Linear Equations using Jacobi Method","category":"Linear Algebra","difficulty":"medium","id":"11","createdAt":"January 23, 2026 at 3:39:26 PM UTC-0500"},{"title":"Evaluate Translation Quality with METEOR Score","category":"NLP","difficulty":"medium","id":"110","createdAt":"January 18, 2026 at 4:14:30 PM UTC-0500"},{"title":"Thread-Safe Producer-Consumer Bounded Buffer","category":"Data Structures","difficulty":"medium","id":"1100","createdAt":null},{"title":"SELECT all rows","category":"sql","difficulty":"easy","id":"1101","createdAt":null},{"title":"Select specific columns","category":"sql","difficulty":"easy","id":"1102","createdAt":null},{"title":"Filter rows with WHERE","category":"sql","difficulty":"easy","id":"1103","createdAt":null},{"title":"Sort results with ORDER BY","category":"sql","difficulty":"easy","id":"1104","createdAt":null},{"title":"Remove duplicates with DISTINCT","category":"sql","difficulty":"easy","id":"1105","createdAt":null},{"title":"Top N with LIMIT","category":"sql","difficulty":"easy","id":"1106","createdAt":null},{"title":"Count rows per group","category":"sql","difficulty":"easy","id":"1107","createdAt":null},{"title":"Average per group","category":"sql","difficulty":"easy","id":"1108","createdAt":null},{"title":"Your first JOIN","category":"sql","difficulty":"easy","id":"1109","createdAt":null},{"title":"Compute Pointwise Mutual Information","category":"NLP","difficulty":"medium","id":"111","createdAt":null},{"title":"Nth-Highest Salary with Ties and NULL","category":"sql","difficulty":"medium","id":"1110","createdAt":null},{"title":"Top-3 Salaries Per Department","category":"sql","difficulty":"medium","id":"1111","createdAt":null},{"title":"Delete Duplicate Emails Keeping One","category":"sql","difficulty":"easy","id":"1112","createdAt":null},{"title":"Employees Earning More Than Their Managers","category":"sql","difficulty":"medium","id":"1113","createdAt":null},{"title":"Rank Rows Within Partitions Using Window Functions","category":"sql","difficulty":"medium","id":"1114","createdAt":null},{"title":"Month-over-Month Percentage Change with LAG","category":"sql","difficulty":"medium","id":"1115","createdAt":null},{"title":"Running Total and Moving Average with Window Frames","category":"sql","difficulty":"medium","id":"1116","createdAt":null},{"title":"Values Appearing Three or More Times Consecutively","category":"sql","difficulty":"medium","id":"1117","createdAt":null},{"title":"Days Warmer Than the Previous Day","category":"sql","difficulty":"medium","id":"1118","createdAt":null},{"title":"Cohort Retention: First Login and Consecutive-Day Logins","category":"sql","difficulty":"hard","id":"1119","createdAt":null},{"title":"Min-Max Scaling of Feature Values","category":"Data Preprocessing","difficulty":"easy","id":"112","createdAt":"December 15, 2025 at 9:34:13 AM UTC-0500"},{"title":"Highest Total Daily Order Cost in a Date Range","category":"sql","difficulty":"medium","id":"1120","createdAt":null},{"title":"Highest-Paid Workers with Title Join and Ties","category":"sql","difficulty":"medium","id":"1121","createdAt":null},{"title":"Each Customer's Lowest-Priced Order","category":"sql","difficulty":"medium","id":"1122","createdAt":null},{"title":"Top-N Most Profitable Companies with DENSE_RANK","category":"sql","difficulty":"medium","id":"1123","createdAt":null},{"title":"Salary Difference Between Departments with Conditional Aggregation","category":"sql","difficulty":"medium","id":"1124","createdAt":null},{"title":"Top-N Percent by Group with NTILE","category":"sql","difficulty":"medium","id":"1125","createdAt":null},{"title":"Employees Earning Above Their Department Average (Correlated Subquery)","category":"sql","difficulty":"medium","id":"1126","createdAt":null},{"title":"Filter, Group, and Aggregate a DataFrame (Top-10 by Metric)","category":"pandas","difficulty":"medium","id":"1127","createdAt":null},{"title":"Handle Missing Data in pandas (dropna/fillna)","category":"pandas","difficulty":"easy","id":"1128","createdAt":null},{"title":"Merge Multiple DataFrames","category":"pandas","difficulty":"medium","id":"1129","createdAt":null},{"title":"Implement a Simple Residual Block with Shortcut Connection","category":"Deep Learning","difficulty":"easy","id":"113","createdAt":null},{"title":"Generate Normal Samples and Compute Histogram Counts","category":"Statistics","difficulty":"easy","id":"1130","createdAt":null},{"title":"Clean a Messy Dataset: Dedup, Standardize, Impute","category":"pandas","difficulty":"medium","id":"1131","createdAt":null},{"title":"Reshape Data with pivot_table and melt","category":"pandas","difficulty":"medium","id":"1132","createdAt":null},{"title":"Monthly-Cohort Retention Rate by Plan","category":"sql","difficulty":"hard","id":"1133","createdAt":null},{"title":"Recover Current Salary from an Append-Only ETL Table","category":"sql","difficulty":"medium","id":"1134","createdAt":null},{"title":"Daily Active Users and DAU/MAU Stickiness","category":"sql","difficulty":"medium","id":"1135","createdAt":null},{"title":"Add a Per-Group Average Column with GroupBy Transform","category":"pandas","difficulty":"easy","id":"1136","createdAt":null},{"title":"Top-K Largest Elements in a List","category":"Algorithms","difficulty":"easy","id":"1137","createdAt":null},{"title":"Running Median of a Data Stream","category":"Data Structures","difficulty":"medium","id":"1138","createdAt":null},{"title":"Simulate Two-Dice Sum Distribution","category":"Probability","difficulty":"easy","id":"1139","createdAt":null},{"title":"Implement Global Average Pooling","category":"Deep Learning","difficulty":"easy","id":"114","createdAt":null},{"title":"Simple Order Book (Insert/Cancel/Match)","category":"Data Structures","difficulty":"medium","id":"1140","createdAt":null},{"title":"Count Words Appearing Exactly Once in Each of Two Lists","category":"Algorithms","difficulty":"easy","id":"1141","createdAt":null},{"title":"Robot Simulation on an Infinite Grid with Obstacles","category":"Algorithms","difficulty":"medium","id":"1142","createdAt":null},{"title":"Online Rolling Z-Score over a Fixed Window","category":"Machine Learning","difficulty":"medium","id":"1143","createdAt":null},{"title":"Online Mean and Variance with Welford's Algorithm","category":"Machine Learning","difficulty":"medium","id":"1144","createdAt":null},{"title":"Reservoir Sampling from a Stream","category":"Algorithms","difficulty":"medium","id":"1145","createdAt":null},{"title":"Monte Carlo Estimate of Expected Value in a Bidding Game","category":"Probability","difficulty":"medium","id":"1146","createdAt":null},{"title":"Queue from Two Stacks and a Min-Stack","category":"Data Structures","difficulty":"medium","id":"1147","createdAt":null},{"title":"Longest Substring / Subarray with Two Pointers","category":"Algorithms","difficulty":"medium","id":"1148","createdAt":null},{"title":"Dynamic Programming Drills: Knapsack and Grid Paths","category":"Algorithms","difficulty":"medium","id":"1149","createdAt":null},{"title":"Implement Batch Normalization for BCHW Input","category":"Deep Learning","difficulty":"medium","id":"115","createdAt":"February 16, 2026 at 10:12:34 AM UTC-0500"},{"title":"Compare First-N and Last-N Rows with Window Functions","category":"sql","difficulty":"medium","id":"1150","createdAt":null},{"title":"First N Fibonacci Numbers","category":"Algorithms","difficulty":"easy","id":"1151","createdAt":null},{"title":"GPU Credit Ledger with Expiration","category":"Data Structures","difficulty":"medium","id":"1152","createdAt":null},{"title":"Normalize a Terminal Path (cd + pwd)","category":"Algorithms","difficulty":"medium","id":"1153","createdAt":null},{"title":"In-Memory Database with Insert and Filtered Select","category":"Data Structures","difficulty":"medium","id":"1154","createdAt":null},{"title":"Spreadsheet Formula Engine with Cycle Detection","category":"Data Structures","difficulty":"medium","id":"1155","createdAt":null},{"title":"Package Version Resolution via Hierarchical Binary Search","category":"Algorithms","difficulty":"medium","id":"1156","createdAt":null},{"title":"Key-Value Store Serialization and State Recovery","category":"Data Structures","difficulty":"medium","id":"1157","createdAt":null},{"title":"Emulate 1-Nearest-Neighbor with a Feed-Forward Network","category":"Deep Learning","difficulty":"medium","id":"1158","createdAt":null},{"title":"Minimum Remove to Make Valid Parentheses","category":"Algorithms","difficulty":"medium","id":"1159","createdAt":null},{"title":"Derivative of a Polynomial","category":"Calculus","difficulty":"easy","id":"116","createdAt":null},{"title":"Valid Palindrome II (Delete At Most One Char)","category":"Algorithms","difficulty":"easy","id":"1160","createdAt":null},{"title":"Count Subarrays Summing to K (Prefix-Sum Hash Map)","category":"Algorithms","difficulty":"medium","id":"1161","createdAt":null},{"title":"Binary Tree Vertical Order Traversal","category":"Data Structures","difficulty":"medium","id":"1162","createdAt":null},{"title":"Dot Product of Two Sparse Vectors","category":"Data Structures","difficulty":"medium","id":"1163","createdAt":null},{"title":"Lowest Common Ancestor of a Binary Tree","category":"Data Structures","difficulty":"medium","id":"1164","createdAt":null},{"title":"Random Pick with Weight (Prefix Sum + Binary Search)","category":"Algorithms","difficulty":"medium","id":"1165","createdAt":null},{"title":"Basic Calculator: Evaluate Expression String","category":"Algorithms","difficulty":"medium","id":"1166","createdAt":null},{"title":"Merge Intervals and Interval List Intersections","category":"Algorithms","difficulty":"medium","id":"1167","createdAt":null},{"title":"Alien Dictionary via Topological Sort","category":"Algorithms","difficulty":"hard","id":"1168","createdAt":null},{"title":"Array/Matrix Drills: Ocean View, Toeplitz, Diagonal Traverse","category":"Algorithms","difficulty":"medium","id":"1169","createdAt":null},{"title":"Compute Orthonormal Basis for 2D Vectors","category":"Linear Algebra","difficulty":"medium","id":"117","createdAt":null},{"title":"Nested List Weight Sum and Range Sum of BST","category":"Algorithms","difficulty":"medium","id":"1170","createdAt":null},{"title":"Heap Drills: Top-K Frequent Elements and K Closest Points","category":"Data Structures","difficulty":"medium","id":"1171","createdAt":null},{"title":"Binary Tree Drills: Diameter, Max Path Sum, Serialize/Deserialize","category":"Data Structures","difficulty":"medium","id":"1172","createdAt":null},{"title":"Array Drills: Product Except Self, 3Sum, Find Peak, Maximum Swap","category":"Algorithms","difficulty":"medium","id":"1173","createdAt":null},{"title":"BFS Maze with Directional Gates and Bitmask Max Unique Chars","category":"Algorithms","difficulty":"medium","id":"1174","createdAt":null},{"title":"Average Comment Threads per Post","category":"sql","difficulty":"medium","id":"1175","createdAt":null},{"title":"Likes on Friend Posts Yesterday","category":"sql","difficulty":"medium","id":"1176","createdAt":null},{"title":"Interactions Since First Login per User","category":"sql","difficulty":"medium","id":"1177","createdAt":null},{"title":"Days Between First and Last Post per User","category":"sql","difficulty":"medium","id":"1178","createdAt":null},{"title":"Identify Power Users by Posting and Reaction Thresholds","category":"sql","difficulty":"medium","id":"1179","createdAt":null},{"title":"Compute the Cross Product of Two 3D Vectors","category":"Linear Algebra","difficulty":"easy","id":"118","createdAt":null},{"title":"Ad Click-Through Rate by Year","category":"sql","difficulty":"medium","id":"1180","createdAt":null},{"title":"Average Session Duration from Load/Exit Events","category":"sql","difficulty":"medium","id":"1181","createdAt":null},{"title":"Compare Two Conditional Counts and Label the Result","category":"sql","difficulty":"medium","id":"1182","createdAt":null},{"title":"Combine Caller and Receiver Users with UNION","category":"sql","difficulty":"medium","id":"1183","createdAt":null},{"title":"Top Users by Longest Consecutive Visit Streak","category":"sql","difficulty":"hard","id":"1184","createdAt":null},{"title":"Count Pages Currently On from Status Events","category":"sql","difficulty":"medium","id":"1185","createdAt":null},{"title":"Number of Islands (Grid Connected Components)","category":"Algorithms","difficulty":"medium","id":"1186","createdAt":null},{"title":"Tiled Matrix Multiply CUDA Kernel","category":"cuda","difficulty":"medium","id":"1187","createdAt":null},{"title":"Fused Bias+ReLU CUDA Kernel","category":"cuda","difficulty":"medium","id":"1188","createdAt":null},{"title":"Parallel Reduction (Block Sum) CUDA Kernel","category":"cuda","difficulty":"medium","id":"1189","createdAt":null},{"title":"Solve System of Linear Equations Using Cramer's Rule","category":"Linear Algebra for Machine Learning","difficulty":"medium","id":"119","createdAt":null},{"title":"Random Rotation Matrix and a Rotation Layer","category":"Linear Algebra","difficulty":"easy","id":"1190","createdAt":null},{"title":"Fixed-Size Block Memory Allocator","category":"Data Structures","difficulty":"medium","id":"1191","createdAt":null},{"title":"Singular Value Decomposition (SVD) of 2x2 Matrix","category":"Linear Algebra","difficulty":"hard","id":"12","createdAt":"January 26, 2026 at 9:49:30 AM UTC-0500"},{"title":"Bhattacharyya Distance Between Two Distributions","category":"Statistics","difficulty":"easy","id":"120","createdAt":null},{"title":"Your First CUDA Kernel: Thread Index","category":"cuda","difficulty":"easy","id":"1201","createdAt":null},{"title":"Vector Addition","category":"cuda","difficulty":"easy","id":"1202","createdAt":null},{"title":"Scalar Multiply (a * x)","category":"cuda","difficulty":"easy","id":"1203","createdAt":null},{"title":"ReLU Activation","category":"cuda","difficulty":"easy","id":"1204","createdAt":null},{"title":"Grid-Stride Loop: Square Each Element","category":"cuda","difficulty":"easy","id":"1205","createdAt":null},{"title":"Add Two Matrices (2D Grid)","category":"cuda","difficulty":"medium","id":"1206","createdAt":null},{"title":"Parallel Reduction: Array Sum","category":"cuda","difficulty":"medium","id":"1207","createdAt":null},{"title":"Dot Product","category":"cuda","difficulty":"medium","id":"1208","createdAt":null},{"title":"Naive Matrix Multiplication","category":"cuda","difficulty":"medium","id":"1209","createdAt":null},{"title":"Vector Element-wise Sum","category":"Linear Algebra","difficulty":"easy","id":"121","createdAt":null},{"title":"Forward Kinematics of a 2-Link Planar Arm","category":"Robotics","difficulty":"easy","id":"1210","createdAt":null},{"title":"Inverse Kinematics of a 2-Link Planar Arm","category":"Robotics","difficulty":"medium","id":"1211","createdAt":null},{"title":"Quaternion SLERP Interpolation","category":"Robotics","difficulty":"medium","id":"1212","createdAt":null},{"title":"1D Kalman Filter Predict-Update Step","category":"Robotics","difficulty":"medium","id":"1213","createdAt":null},{"title":"Per-Token Decode Latency from Memory Bandwidth","category":"Inference","difficulty":"easy","id":"1214","createdAt":null},{"title":"Grammar-Constrained Token Masking","category":"Inference","difficulty":"medium","id":"1215","createdAt":null},{"title":"Binary Search for Value or Closest Index","category":"Algorithms","difficulty":"medium","id":"1216","createdAt":null},{"title":"Compute TPR and FPR from Classifications","category":"Machine Learning","difficulty":"easy","id":"1217","createdAt":"July 26, 2026 at 12:46:29 PM UTC-4"},{"title":"Count Parameters of a Sequential Model","category":"pytorch","difficulty":"easy","id":"1218","createdAt":"July 28, 2026 at 11:03:54 PM UTC-4"},{"title":"One Training Step","category":"pytorch","difficulty":"medium","id":"1219","createdAt":"July 28, 2026 at 11:03:54 PM UTC-4"},{"title":"Policy Gradient with REINFORCE","category":"Reinforcement Learning","difficulty":"hard","id":"122","createdAt":null},{"title":"Create and Inspect a Tensor","category":"pytorch","difficulty":"easy","id":"1220","createdAt":"July 28, 2026 at 11:03:54 PM UTC-4"},{"title":"Reshape and Transpose a Tensor","category":"pytorch","difficulty":"easy","id":"1221","createdAt":"July 28, 2026 at 11:03:54 PM UTC-4"},{"title":"Gradient of a Square with Autograd","category":"pytorch","difficulty":"easy","id":"1222","createdAt":"July 28, 2026 at 11:03:54 PM UTC-4"},{"title":"Gradient of a Weighted Sum of Squares","category":"pytorch","difficulty":"medium","id":"1223","createdAt":"July 28, 2026 at 11:03:54 PM UTC-4"},{"title":"Single Linear Neuron Forward","category":"pytorch","difficulty":"easy","id":"1224","createdAt":"July 28, 2026 at 11:03:54 PM UTC-4"},{"title":"Two-Layer MLP Forward Pass","category":"pytorch","difficulty":"medium","id":"1225","createdAt":"July 28, 2026 at 11:03:54 PM UTC-4"},{"title":"Implement ReLU and Leaky ReLU","category":"pytorch","difficulty":"easy","id":"1226","createdAt":"July 28, 2026 at 11:03:54 PM UTC-4"},{"title":"Numerically Stable Softmax","category":"pytorch","difficulty":"medium","id":"1227","createdAt":"July 28, 2026 at 11:03:54 PM UTC-4"},{"title":"Mean Squared Error from Scratch","category":"pytorch","difficulty":"easy","id":"1228","createdAt":"July 28, 2026 at 11:03:54 PM UTC-4"},{"title":"Binary Cross-Entropy from Logits","category":"pytorch","difficulty":"medium","id":"1229","createdAt":"July 28, 2026 at 11:03:54 PM UTC-4"},{"title":"Calculate Computational Efficiency of MoE","category":"Deep Learning","difficulty":"easy","id":"123","createdAt":null},{"title":"Dropout in Train vs Eval Mode","category":"pytorch","difficulty":"medium","id":"1230","createdAt":"July 28, 2026 at 11:03:54 PM UTC-4"},{"title":"BatchNorm1d Forward in Eval Mode","category":"pytorch","difficulty":"medium","id":"1231","createdAt":"July 28, 2026 at 11:03:54 PM UTC-4"},{"title":"Conv2d Output Shape","category":"pytorch","difficulty":"easy","id":"1232","createdAt":"July 28, 2026 at 11:03:54 PM UTC-4"},{"title":"Apply a 2D Convolution","category":"pytorch","difficulty":"medium","id":"1233","createdAt":"July 28, 2026 at 11:03:54 PM UTC-4"},{"title":"One SGD Update Step","category":"pytorch","difficulty":"easy","id":"1234","createdAt":"July 28, 2026 at 11:03:54 PM UTC-4"},{"title":"SGD with Momentum Step","category":"pytorch","difficulty":"medium","id":"1235","createdAt":"July 28, 2026 at 11:03:54 PM UTC-4"},{"title":"One Adam Update Step","category":"pytorch","difficulty":"hard","id":"1236","createdAt":"July 28, 2026 at 11:03:54 PM UTC-4"},{"title":"Batch a TensorDataset with DataLoader","category":"pytorch","difficulty":"easy","id":"1237","createdAt":"July 28, 2026 at 11:03:54 PM UTC-4"},{"title":"Conditional Aggregation of Odd vs Even Readings per Day","category":"sql","difficulty":"medium","id":"1238","createdAt":null},{"title":"Median from a Bucketed Frequency Table","category":"sql","difficulty":"medium","id":"1239","createdAt":null},{"title":"Implement the Noisy Top-K Gating Function","category":"Deep Learning","difficulty":"medium","id":"124","createdAt":null},{"title":"Ads Ratio Metrics: CTR, CVR and Avg CPC by Level","category":"sql","difficulty":"medium","id":"1240","createdAt":null},{"title":"Monthly Search Counts per Category with Join","category":"sql","difficulty":"medium","id":"1241","createdAt":null},{"title":"Pure-Python String Parsing and Tokenizing","category":"Algorithms","difficulty":"medium","id":"1242","createdAt":null},{"title":"Inverse-Transform Sampling from a Uniform RNG","category":"Probability","difficulty":"medium","id":"1243","createdAt":null},{"title":"Pooled Mean and Pooled Standard Deviation from Summary Stats","category":"Statistics","difficulty":"medium","id":"1244","createdAt":null},{"title":"Graph Reachability via Distance-Threshold Connections","category":"Algorithms","difficulty":"medium","id":"1245","createdAt":null},{"title":"Multi-Source BFS: Time to Fill a Grid","category":"Algorithms","difficulty":"medium","id":"1246","createdAt":null},{"title":"Optimize Grid Scan from O(n^2) to O(n)","category":"Algorithms","difficulty":"medium","id":"1247","createdAt":null},{"title":"Sentiment Classifier: fit/predict with TF-IDF Features","category":"NLP","difficulty":"medium","id":"1248","createdAt":null},{"title":"Monthly Average Product Rating","category":"sql","difficulty":"easy","id":"1249","createdAt":null},{"title":"Implement a Sparse Mixture of Experts Layer","category":"Deep Learning","difficulty":"hard","id":"125","createdAt":null},{"title":"Reverse a Singly Linked List","category":"Data Structures","difficulty":"easy","id":"1250","createdAt":null},{"title":"Fair Bits from a Biased Coin (Von Neumann)","category":"Probability","difficulty":"medium","id":"1251","createdAt":null},{"title":"Fused Row-wise Softmax CUDA Kernel","category":"cuda","difficulty":"medium","id":"1252","createdAt":null},{"title":"Anchor Matching via IoU Assignment","category":"Computer Vision","difficulty":"medium","id":"1253","createdAt":null},{"title":"Asymmetric Uniform Quantization with Zero-Point","category":"Deep Learning","difficulty":"medium","id":"1254","createdAt":null},{"title":"Quantization Scale Calibration (AbsMax and Percentile)","category":"Deep Learning","difficulty":"medium","id":"1255","createdAt":null},{"title":"INT4 Pack/Unpack and Weight-Only W4A16 Matmul","category":"Deep Learning","difficulty":"hard","id":"1256","createdAt":null},{"title":"Simplified GPTQ: Sequential Quantization with Error Compensation","category":"Deep Learning","difficulty":"hard","id":"1257","createdAt":null},{"title":"NF4 Quantization (NormalFloat4)","category":"Deep Learning","difficulty":"medium","id":"1258","createdAt":null},{"title":"Double Quantization of Scales","category":"Deep Learning","difficulty":"medium","id":"1259","createdAt":null},{"title":"Implement Group Normalization","category":"Deep Learning","difficulty":"medium","id":"126","createdAt":null},{"title":"SmoothQuant: Migration Scales for W8A8","category":"Deep Learning","difficulty":"hard","id":"1260","createdAt":null},{"title":"Fake Quantization with Straight-Through Estimator","category":"Deep Learning","difficulty":"medium","id":"1261","createdAt":null},{"title":"Identity Preference Optimization (IPO) Loss","category":"Deep Learning","difficulty":"medium","id":"1262","createdAt":null},{"title":"Kahneman-Tversky Optimization (KTO) Loss","category":"Deep Learning","difficulty":"medium","id":"1263","createdAt":null},{"title":"Odds Ratio Preference Optimization (ORPO) Loss","category":"Deep Learning","difficulty":"medium","id":"1264","createdAt":null},{"title":"Simple Preference Optimization (SimPO) Loss","category":"Deep Learning","difficulty":"medium","id":"1265","createdAt":null},{"title":"RLOO: REINFORCE Leave-One-Out Advantages","category":"Reinforcement Learning","difficulty":"medium","id":"1266","createdAt":null},{"title":"Process Reward Models: Aggregation and Step Loss","category":"Reinforcement Learning","difficulty":"medium","id":"1267","createdAt":null},{"title":"Tensor Puzzle: Ones Vector from First Principles","category":"Linear Algebra","difficulty":"easy","id":"1268","createdAt":null},{"title":"Tensor Puzzle: Sum a Vector with a Dot Product","category":"Linear Algebra","difficulty":"easy","id":"1269","createdAt":null},{"title":"Find Captain Redbeard's Hidden Treasure","category":"Calculus","difficulty":"medium","id":"127","createdAt":null},{"title":"Tensor Puzzle: Outer Product via Broadcasting","category":"Linear Algebra","difficulty":"easy","id":"1270","createdAt":null},{"title":"Tensor Puzzle: Extract the Diagonal","category":"Linear Algebra","difficulty":"easy","id":"1271","createdAt":null},{"title":"Tensor Puzzle: Identity Matrix from Comparisons","category":"Linear Algebra","difficulty":"easy","id":"1272","createdAt":null},{"title":"Tensor Puzzle: Upper-Triangular Ones Matrix","category":"Linear Algebra","difficulty":"easy","id":"1273","createdAt":null},{"title":"Tensor Puzzle: Cumulative Sum via Triangular Matmul","category":"Linear Algebra","difficulty":"medium","id":"1274","createdAt":null},{"title":"Tensor Puzzle: First-Order Difference","category":"Linear Algebra","difficulty":"easy","id":"1275","createdAt":null},{"title":"Tensor Puzzle: Stack Two Vectors as Rows","category":"Linear Algebra","difficulty":"easy","id":"1276","createdAt":null},{"title":"Tensor Puzzle: Circular Roll by One","category":"Linear Algebra","difficulty":"easy","id":"1277","createdAt":null},{"title":"Tensor Puzzle: Reverse a Vector","category":"Linear Algebra","difficulty":"easy","id":"1278","createdAt":null},{"title":"Tensor Puzzle: Compress — Keep True Positions","category":"Linear Algebra","difficulty":"medium","id":"1279","createdAt":null},{"title":"Dynamic Tanh: Normalization-Free Transformer Activation","category":"Deep Learning","difficulty":"easy","id":"128","createdAt":null},{"title":"Tensor Puzzle: Pad or Truncate a Vector to Length j","category":"Linear Algebra","difficulty":"easy","id":"1280","createdAt":null},{"title":"Tensor Puzzle: Sequence Mask by Lengths","category":"Deep Learning","difficulty":"medium","id":"1281","createdAt":null},{"title":"Tensor Puzzle: Bincount by Scatter-Add","category":"Linear Algebra","difficulty":"medium","id":"1282","createdAt":null},{"title":"Tensor Puzzle: Scatter-Add into Bins","category":"Linear Algebra","difficulty":"medium","id":"1283","createdAt":null},{"title":"Tensor Puzzle: Flatten a Matrix by Indexing","category":"Linear Algebra","difficulty":"medium","id":"1284","createdAt":null},{"title":"Tensor Puzzle: Linspace from Endpoints","category":"Linear Algebra","difficulty":"easy","id":"1285","createdAt":null},{"title":"Tensor Puzzle: Heaviside Step with Zero-Value","category":"Linear Algebra","difficulty":"easy","id":"1286","createdAt":null},{"title":"Tensor Puzzle: Repeat a Vector as Rows","category":"Linear Algebra","difficulty":"easy","id":"1287","createdAt":null},{"title":"Tensor Puzzle: Bucketize Values into Bins","category":"Linear Algebra","difficulty":"hard","id":"1288","createdAt":null},{"title":"Calculate Unigram Probability from Corpus","category":"NLP","difficulty":"easy","id":"129","createdAt":null},{"title":"Determinant of a 4x4 Matrix using Laplace's Expansion (hard)","category":"Linear Algebra","difficulty":"hard","id":"13","createdAt":"December 28, 2025 at 8:59:38 AM UTC-0500"},{"title":"Implement a Simple CNN Training Function with Backpropagation","category":"Deep Learning","difficulty":"hard","id":"130","createdAt":"December 28, 2025 at 8:33:00 AM UTC-0500"},{"title":"Implement Efficient Sparse Window Attention","category":"Machine Learning","difficulty":"medium","id":"131","createdAt":null},{"title":"Simulate Markov Chain Transitions","category":"Probability","difficulty":"medium","id":"132","createdAt":null},{"title":"Implement Q-Learning Algorithm for MDPs","category":"Reinforcement Learning","difficulty":"medium","id":"133","createdAt":null},{"title":"Compute Multi-class Cross-Entropy Loss","category":"Deep Learning","difficulty":"easy","id":"134","createdAt":null},{"title":"Implement Early Stopping Based on Validation Loss","category":"Machine Learning","difficulty":"easy","id":"135","createdAt":"December 28, 2025 at 9:17:54 AM UTC-0500"},{"title":"Calculate KL Divergence Between Two Multivariate Gaussian Distributions","category":"Probability","difficulty":"medium","id":"136","createdAt":null},{"title":"Implement a Dense Block with 2D Convolutions","category":"Deep Learning","difficulty":"hard","id":"137","createdAt":"January 20, 2026 at 12:45:18 PM UTC-0500"},{"title":"Find the Best Gini-Based Split for a Binary Decision Tree","category":"Machine Learning","difficulty":"medium","id":"138","createdAt":null},{"title":"Elastic Net Regression via Gradient Descent","category":"Machine Learning","difficulty":"medium","id":"139","createdAt":null},{"title":"Linear Regression Using Normal Equation","category":"Machine Learning","difficulty":"easy","id":"14","createdAt":null},{"title":"Bernoulli Naive Bayes Classifier","category":"Machine Learning","difficulty":"medium","id":"140","createdAt":null},{"title":"Shift and Scale Array to Target Range","category":"Machine Learning","difficulty":"easy","id":"141","createdAt":null},{"title":"Gridworld Policy Evaluation","category":"Reinforcement Learning","difficulty":"medium","id":"142","createdAt":null},{"title":"Instance Normalization (IN) Implementation","category":"Deep Learning","difficulty":"medium","id":"143","createdAt":null},{"title":"Apriori Frequent Itemset Mining","category":"Machine Learning","difficulty":"medium","id":"144","createdAt":null},{"title":"Adagrad Optimizer","category":"Deep Learning","difficulty":"easy","id":"145","createdAt":null},{"title":"Momentum Optimizer","category":"Deep Learning","difficulty":"easy","id":"146","createdAt":"March 26, 2026 at 8:39:48 AM UTUTC-4"},{"title":"GeLU Activation Function ","category":"Deep Learning","difficulty":"easy","id":"147","createdAt":null},{"title":"Adamax Optimizer","category":"Deep Learning","difficulty":"easy","id":"148","createdAt":null},{"title":"Adadelta Optimizer","category":"Deep Learning","difficulty":"medium","id":"149","createdAt":"December 29, 2025 at 1:43:37 PM UTC-0500"},{"title":"Linear Regression Using Gradient Descent","category":"Machine Learning","difficulty":"easy","id":"15","createdAt":"February 4, 2026 at 4:08:10 PM UTC-0500"},{"title":"Nesterov Accelerated Gradient Optimizer","category":"Deep Learning","difficulty":"easy","id":"150","createdAt":"January 26, 2026 at 8:28:54 AM UTC-0500"},{"title":"Dropout Layer","category":"Deep Learning","difficulty":"medium","id":"151","createdAt":"January 18, 2026 at 10:56:40 AM UTC-0500"},{"title":"Implementing ROUGE Score","category":"Machine Learning","difficulty":"medium","id":"152","createdAt":null},{"title":"StepLR Learning Rate Scheduler","category":"Machine Learning","difficulty":"easy","id":"153","createdAt":null},{"title":"ExponentialLR Learning Rate Scheduler","category":"Machine Learning","difficulty":"easy","id":"154","createdAt":null},{"title":"CosineAnnealingLR Learning Rate Scheduler","category":"Machine Learning","difficulty":"medium","id":"155","createdAt":null},{"title":"Implement SwiGLU activation function","category":"Deep Learning","difficulty":"easy","id":"156","createdAt":null},{"title":"Implement the Bellman Equation for Value Iteration","category":"Reinforcement Learning","difficulty":"medium","id":"157","createdAt":null},{"title":"Epsilon-Greedy Action Selection for n-Armed Bandit","category":"Reinforcement Learning","difficulty":"medium","id":"158","createdAt":null},{"title":"Incremental Mean for Online Reward Estimation","category":"Reinforcement Learning","difficulty":"easy","id":"159","createdAt":null},{"title":"Feature Scaling Implementation","category":"Machine Learning","difficulty":"easy","id":"16","createdAt":"January 26, 2026 at 8:42:25 AM UTC-0500"},{"title":"Mixed Precision Training","category":"Machine Learning","difficulty":"medium","id":"160","createdAt":"September 15, 2025 at 10:08:30 AM UTUTC-4"},{"title":"Exponential Weighted Average of Rewards","category":"Reinforcement Learning","difficulty":"easy","id":"161","createdAt":"December 29, 2025 at 3:12:25 PM UTC-0500"},{"title":"Upper Confidence Bound (UCB) Action Selection","category":"Reinforcement Learning","difficulty":"easy","id":"162","createdAt":null},{"title":"Gradient Bandit Action Selection","category":"Reinforcement Learning","difficulty":"medium","id":"163","createdAt":null},{"title":"Gambler's Problem: Value Iteration","category":"Reinforcement Learning","difficulty":"hard","id":"164","createdAt":null},{"title":"Compute Discounted Return","category":"Reinforcement Learning","difficulty":"easy","id":"165","createdAt":null},{"title":"Evaluate Expected Value in a Markov Decision Process","category":"Reinforcement Learning","difficulty":"medium","id":"166","createdAt":null},{"title":"Calculate the Discounted Return for a Given Trajectory","category":"Reinforcement Learning","difficulty":"easy","id":"167","createdAt":null},{"title":"Calculate Conditional Probability from Data","category":"Probability","difficulty":"easy","id":"168","createdAt":null},{"title":"Implement AdamW Optimizer Step","category":"Optimization","difficulty":"medium","id":"169","createdAt":null},{"title":"K-Means Clustering","category":"Machine Learning","difficulty":"medium","id":"17","createdAt":"January 26, 2026 at 9:09:24 AM UTC-0500"},{"title":"Muon Optimizer Step with Matrix Preconditioning","category":"Optimization","difficulty":"medium","id":"170","createdAt":"January 13, 2026 at 12:28:40 PM UTC-0500"},{"title":"Minimax Algorithm for Tic-Tac-Toe","category":"Game Theory","difficulty":"medium","id":"171","createdAt":"July 28, 2025 at 7:48:04 PM UTUTC-4"},{"title":"Muon Optimizer Update with Newton-Schulz Iteration","category":"Deep Learning","difficulty":"medium","id":"172","createdAt":"August 5, 2025 at 7:15:41 PM UTUTC-4"},{"title":"Implement K-Nearest Neighbors","category":"Machine Learning","difficulty":"medium","id":"173","createdAt":"January 16, 2026 at 3:56:26 PM UTC-0500"},{"title":"Train a Simple GAN on 1D Gaussian Data","category":"Deep Learning","difficulty":"hard","id":"174","createdAt":"August 13, 2025 at 11:01:53 AM UTUTC-4"},{"title":"Implement the SARSA Algorithm on policy","category":"Reinforcement Learning","difficulty":"medium","id":"175","createdAt":"August 15, 2025 at 5:36:32 PM UTUTC-4"},{"title":"Chi-square Probability Distribution","category":"Probability","difficulty":"medium","id":"176","createdAt":"August 19, 2025 at 1:21:43 PM UTUTC-4"},{"title":"Implement MuonClip (qk-clip) for Stabilizing Attention","category":"Deep Learning","difficulty":"medium","id":"177","createdAt":"August 26, 2025 at 3:21:20 PM UTUTC-4"},{"title":"Implement Position-wise Feed-Forward Block with Residual and Dropout","category":"Deep Learning","difficulty":"medium","id":"178","createdAt":"December 28, 2025 at 10:02:05 AM UTC-0500"},{"title":"Expected Value and Variance of an n-Sided Die","category":"Probability","difficulty":"easy","id":"179","createdAt":"September 2, 2025 at 10:07:08 AM UTUTC-4"},{"title":"Implement K-Fold Cross-Validation","category":"Machine Learning","difficulty":"medium","id":"18","createdAt":"January 18, 2026 at 4:05:10 PM UTC-0500"},{"title":"Conditional Probability from Joint Distribution","category":"Probability","difficulty":"medium","id":"180","createdAt":"September 2, 2025 at 11:11:10 AM UTUTC-4"},{"title":"Sampling Distribution of the Mean","category":"Probability","difficulty":"easy","id":"181","createdAt":"January 16, 2026 at 4:15:44 PM UTC-0500"},{"title":"Central Limit Theorem Simulation","category":"Probability","difficulty":"medium","id":"182","createdAt":"September 8, 2025 at 9:27:04 AM UTUTC-4"},{"title":"Calculate Portfolio Variance","category":"Financial Engineering","difficulty":"easy","id":"183","createdAt":"September 8, 2025 at 9:55:03 AM UTUTC-4"},{"title":"Empirical Probability Mass Function (PMF)","category":"Probability & Statistics","difficulty":"easy","id":"184","createdAt":"September 15, 2025 at 11:28:44 AM UTUTC-4"},{"title":"Optical Flow EPE with Masks (OmniWorld-style metric)","category":"Computer Vision","difficulty":"medium","id":"185","createdAt":"September 21, 2025 at 12:54:29 PM UTUTC-4"},{"title":"Gaussian Process for Regression","category":"Machine Learning","difficulty":"hard","id":"186","createdAt":"October 10, 2025 at 12:59:51 PM UTUTC-4"},{"title":"Build a Simple ETL Pipeline (MLOps)","category":"MLOps","difficulty":"medium","id":"187","createdAt":"January 23, 2026 at 3:37:26 PM UTC-0500"},{"title":"Gradient Checkpointing","category":"Machine Learning","difficulty":"easy","id":"188","createdAt":"October 16, 2025 at 9:27:03 AM UTUTC-4"},{"title":"Implement Local Response Normalization (LRN)","category":"Deep Learning","difficulty":"medium","id":"189","createdAt":"January 20, 2026 at 12:47:45 PM UTC-0500"},{"title":"Principal Component Analysis (PCA) Implementation","category":"Machine Learning","difficulty":"medium","id":"19","createdAt":"January 19, 2026 at 5:51:12 PM UTC-0500"},{"title":"Overlapping Max Pooling","category":"Deep Learning","difficulty":"medium","id":"190","createdAt":"February 16, 2026 at 1:45:41 PM UTC-0500"},{"title":"PCA Color Augmentation","category":"Computer Vision","difficulty":"hard","id":"191","createdAt":"October 21, 2025 at 11:27:37 AM UTUTC-4"},{"title":"Implement the Huber Loss Function","category":"Machine Learning","difficulty":"medium","id":"192","createdAt":"November 8, 2025 at 11:49:05 PM UTC-0500"},{"title":"Compute Confusion Matrix with Normalization","category":"Machine Learning","difficulty":"medium","id":"193","createdAt":"November 9, 2025 at 1:40:06 PM UTC-0500"},{"title":"Implement Label Smoothing for Multi-Class Cross-Entropy","category":"Machine Learning","difficulty":"medium","id":"194","createdAt":"November 9, 2025 at 1:47:53 PM UTC-0500"},{"title":"Matrix Determinant & Trace","category":"Linear Algebra","difficulty":"easy","id":"195","createdAt":"November 10, 2025 at 9:03:32 AM UTC-0500"},{"title":"Warmup + Cosine Decay Schedule","category":"Optimization","difficulty":"medium","id":"196","createdAt":"November 9, 2025 at 3:44:53 PM UTC-0500"},{"title":"Gradient Clipping by Global Norm","category":"Optimization","difficulty":"medium","id":"197","createdAt":"November 9, 2025 at 3:53:05 PM UTC-0500"},{"title":"Implement Weight Decay as L2 Regularization","category":"Regularization","difficulty":"easy","id":"198","createdAt":"November 9, 2025 at 4:01:49 PM UTC-0500"},{"title":"Early Stopping Based on Validation Loss Plateau","category":"Machine Learning","difficulty":"easy","id":"199","createdAt":"November 9, 2025 at 11:10:01 PM UTC-0500"},{"title":"Transpose of a Matrix","category":"Linear Algebra","difficulty":"easy","id":"2","createdAt":"December 15, 2025 at 7:47:47 AM UTC-0500"},{"title":"Decision Tree Learning","category":"Machine Learning","difficulty":"hard","id":"20","createdAt":"February 16, 2026 at 10:31:10 AM UTC-0500"},{"title":"Implement RMSProp Optimizer","category":"Optimization","difficulty":"medium","id":"200","createdAt":"November 10, 2025 at 8:15:34 AM UTC-0500"},{"title":"QR Decomposition","category":"Linear Algebra","difficulty":"hard","id":"201","createdAt":"November 15, 2025 at 9:43:42 PM UTC-0500"},{"title":"Jacobian Matrix Calculation","category":"Calculus","difficulty":"medium","id":"202","createdAt":"November 15, 2025 at 9:52:59 PM UTC-0500"},{"title":"Jensen-Shannon Divergence","category":"Information Theory","difficulty":"medium","id":"203","createdAt":"November 15, 2025 at 10:00:38 PM UTC-0500"},{"title":"Mutual Information","category":"Information Theory","difficulty":"medium","id":"204","createdAt":"November 16, 2025 at 7:33:20 AM UTC-0500"},{"title":"Entropy & Cross-Entropy","category":"Information Theory","difficulty":"medium","id":"205","createdAt":"November 16, 2025 at 8:36:50 AM UTC-0500"},{"title":"Variational Inference: ELBO Computation","category":"Probabilistic ML","difficulty":"hard","id":"206","createdAt":"December 15, 2025 at 9:29:06 AM UTC-0500"},{"title":"Monte Carlo Tree Search","category":"Reinforcement Learning","difficulty":"hard","id":"207","createdAt":"November 17, 2025 at 6:41:58 PM UTC-0500"},{"title":"Flash Attention v1 - Forward Pass","category":"Deep Learning","difficulty":"hard","id":"208","createdAt":"November 18, 2025 at 8:32:53 AM UTC-0500"},{"title":"GSPO: Group Sequence Policy Optimization","category":"Reinforcement Learning","difficulty":"hard","id":"209","createdAt":"November 18, 2025 at 12:12:33 PM UTC-0500"},{"title":"Pegasos Kernel SVM Implementation","category":"Machine Learning","difficulty":"hard","id":"21","createdAt":"January 20, 2026 at 11:34:01 AM UTC-0500"},{"title":"Dr. GRPO: Complete Objective Function","category":"Reinforcement Learning","difficulty":"medium","id":"210","createdAt":"November 19, 2025 at 7:03:40 PM UTC-0500"},{"title":"Two-Sample T-Test Implementation","category":"Statistics","difficulty":"hard","id":"211","createdAt":"November 22, 2025 at 6:32:13 PM UTC-0500"},{"title":"Confidence Interval for Population Mean","category":"Statistics","difficulty":"medium","id":"212","createdAt":"November 22, 2025 at 6:47:38 PM UTC-0500"},{"title":"Bayesian Inference for Beta-Binomial Model","category":"Statistics","difficulty":"medium","id":"213","createdAt":"November 22, 2025 at 9:19:34 PM UTC-0500"},{"title":"Chain Rule for Composite Functions","category":"Calculus","difficulty":"medium","id":"214","createdAt":"November 24, 2025 at 5:59:37 PM UTC-0500"},{"title":"Partial Derivatives of Multivariable Functions","category":"Calculus","difficulty":"medium","id":"215","createdAt":"November 24, 2025 at 6:07:45 PM UTC-0500"},{"title":"Thanksgiving Feast Predictor: Softmax for Dish Selection","category":"Deep Learning","difficulty":"easy","id":"216","createdAt":"November 27, 2025 at 12:44:17 PM UTC-0500"},{"title":"Derivatives of Activation Functions","category":"Deep Learning","difficulty":"easy","id":"217","createdAt":"November 28, 2025 at 10:13:26 AM UTC-0500"},{"title":"Compute the Hessian Matrix","category":"Deep Learning","difficulty":"medium","id":"218","createdAt":"November 30, 2025 at 10:07:37 PM UTC-0500"},{"title":"Derivative of Softmax","category":"Calculus","difficulty":"medium","id":"219","createdAt":"December 5, 2025 at 3:20:29 PM UTC-0500"},{"title":"Sigmoid Activation Function Understanding","category":"Deep Learning","difficulty":"easy","id":"22","createdAt":null},{"title":"Derivative of Cross-Entropy Loss w.r.t. Logits","category":"Calculus","difficulty":"medium","id":"220","createdAt":"December 5, 2025 at 3:31:30 PM UTC-0500"},{"title":"Newton's Method for Optimization","category":"Calculus","difficulty":"medium","id":"221","createdAt":"December 6, 2025 at 5:47:59 PM UTC-0500"},{"title":"LoRA: Low-Rank Adaptation Forward Pass","category":"Deep Learning","difficulty":"medium","id":"222","createdAt":"December 6, 2025 at 10:52:59 PM UTC-0500"},{"title":"QLoRA: Quantized Low-Rank Adaptation Forward Pass","category":"Deep Learning","difficulty":"medium","id":"223","createdAt":"December 7, 2025 at 8:41:28 AM UTC-0500"},{"title":"Group Relative Advantage for GRPO","category":"Reinforcement Learning","difficulty":"easy","id":"224","createdAt":"December 9, 2025 at 4:33:58 PM UTC-0500"},{"title":"KL Divergence Estimator for GRPO","category":"Reinforcement Learning","difficulty":"easy","id":"225","createdAt":"December 9, 2025 at 5:17:28 PM UTC-0500"},{"title":"Pass@k and Majority Voting Evaluation Metrics","category":"Reinforcement Learning","difficulty":"easy","id":"226","createdAt":"January 27, 2026 at 7:32:05 AM UTC-0500"},{"title":"Knowledge Distillation Loss","category":"Deep Learning","difficulty":"medium","id":"227","createdAt":"December 9, 2025 at 5:21:16 PM UTC-0500"},{"title":"Budget-Constrained RL Loss","category":"Reinforcement Learning","difficulty":"medium","id":"228","createdAt":"December 10, 2025 at 9:50:39 AM UTC-0500"},{"title":"Sparse MoE Top-K Routing","category":"Deep Learning","difficulty":"medium","id":"229","createdAt":"December 10, 2025 at 4:13:55 PM UTC-0500"},{"title":"Softmax Activation Function Implementation ","category":"Deep Learning","difficulty":"easy","id":"23","createdAt":"January 13, 2026 at 1:15:37 PM UTC-0500"},{"title":"3D CNN Forward Pass Implementation","category":"Deep Learning","difficulty":"hard","id":"230","createdAt":"December 10, 2025 at 7:37:21 PM UTC-0500"},{"title":"Temperature Decay Scheduler","category":"Deep Learning","difficulty":"medium","id":"231","createdAt":"December 11, 2025 at 1:49:40 PM UTC-0500"},{"title":"PTX Loss for Catastrophic Forgetting Prevention (RLHF)","category":"Deep Learning","difficulty":"medium","id":"232","createdAt":"December 11, 2025 at 2:06:00 PM UTC-0500"},{"title":"Inference Head Pruning for Transformers","category":"Deep Learning","difficulty":"medium","id":"233","createdAt":"December 11, 2025 at 3:13:49 PM UTC-0500"},{"title":"Block-wise FP8 Quantization","category":"Deep Learning","difficulty":"medium","id":"234","createdAt":"December 12, 2025 at 7:52:26 AM UTC-0500"},{"title":"Implement the SGTM Parameter Update Step","category":"Deep Learning","difficulty":"medium","id":"235","createdAt":"December 12, 2025 at 9:14:01 AM UTC-0500"},{"title":"Mean Ablation for Circuit Discovery","category":"Deep Learning","difficulty":"medium","id":"236","createdAt":"December 13, 2025 at 6:03:01 PM UTC-0500"},{"title":"Convert RGB Image to Grayscale","category":"Computer Vision","difficulty":"easy","id":"237","createdAt":"December 14, 2025 at 11:26:37 AM UTC-0500"},{"title":"Flip an Image Horizontally or Vertically","category":"Computer Vision","difficulty":"easy","id":"238","createdAt":"December 14, 2025 at 11:26:37 AM UTC-0500"},{"title":"Apply Zero Padding to an Image","category":"Computer Vision","difficulty":"easy","id":"239","createdAt":"December 14, 2025 at 11:26:37 AM UTC-0500"},{"title":"Single Neuron","category":"Deep Learning","difficulty":"easy","id":"24","createdAt":null},{"title":"Bilinear Image Resizing","category":"Computer Vision","difficulty":"medium","id":"240","createdAt":"December 14, 2025 at 11:26:37 AM UTC-0500"},{"title":"Sobel Edge Detection","category":"Computer Vision","difficulty":"medium","id":"241","createdAt":"December 14, 2025 at 11:26:37 AM UTC-0500"},{"title":"Non-Maximum Suppression for Object Detection","category":"Computer Vision","difficulty":"hard","id":"242","createdAt":"December 14, 2025 at 11:33:11 AM UTC-0500"},{"title":"Compute Covariance from Joint Probability Mass Function","category":"Probability","difficulty":"medium","id":"243","createdAt":"December 14, 2025 at 11:41:24 AM UTC-0500"},{"title":"Compute Total Probability using Law of Total Probability","category":"Probability","difficulty":"medium","id":"244","createdAt":"December 14, 2025 at 11:41:24 AM UTC-0500"},{"title":"Hypergeometric Distribution PMF","category":"Probability","difficulty":"medium","id":"245","createdAt":"December 14, 2025 at 11:41:24 AM UTC-0500"},{"title":"Birthday Problem Probability","category":"Probability","difficulty":"medium","id":"246","createdAt":"December 14, 2025 at 11:41:24 AM UTC-0500"},{"title":"Negative Binomial Distribution Probability","category":"Probability","difficulty":"medium","id":"247","createdAt":"December 14, 2025 at 11:41:24 AM UTC-0500"},{"title":"Calculate Model Inference Statistics for Monitoring","category":"MLOps","difficulty":"easy","id":"248","createdAt":"December 14, 2025 at 11:47:18 AM UTC-0500"},{"title":"Calculate Batch Prediction Health Metrics","category":"MLOps","difficulty":"easy","id":"249","createdAt":"December 14, 2025 at 11:47:18 AM UTC-0500"},{"title":"Single Neuron with Backpropagation","category":"Deep Learning","difficulty":"medium","id":"25","createdAt":null},{"title":"Calculate SLA Compliance Metrics for Model Service","category":"MLOps","difficulty":"easy","id":"250","createdAt":"December 14, 2025 at 11:47:18 AM UTC-0500"},{"title":"Analyze Canary Deployment Health for Model Rollout","category":"MLOps","difficulty":"medium","id":"251","createdAt":"December 14, 2025 at 11:57:17 AM UTC-0500"},{"title":"Data Quality Scoring for ML Pipelines","category":"MLOps","difficulty":"medium","id":"252","createdAt":"December 14, 2025 at 11:57:17 AM UTC-0500"},{"title":"Feature Drift Detection using Population Stability Index","category":"MLOps","difficulty":"medium","id":"253","createdAt":"December 14, 2025 at 11:57:17 AM UTC-0500"},{"title":"Silhouette Score for Clustering Evaluation","category":"Machine Learning","difficulty":"medium","id":"254","createdAt":"December 14, 2025 at 12:12:54 PM UTC-0500"},{"title":"Implement Focal Loss for Imbalanced Classification","category":"Machine Learning","difficulty":"medium","id":"255","createdAt":"December 14, 2025 at 12:12:54 PM UTC-0500"},{"title":"Calculate Davies-Bouldin Index for Clustering Evaluation","category":"Machine Learning","difficulty":"medium","id":"256","createdAt":"December 14, 2025 at 12:12:54 PM UTC-0500"},{"title":"Compute Temporal Difference Error","category":"Reinforcement Learning","difficulty":"easy","id":"257","createdAt":"December 14, 2025 at 12:13:46 PM UTC-0500"},{"title":"Calinski-Harabasz Index for Clustering Evaluation","category":"Machine Learning","difficulty":"medium","id":"258","createdAt":"January 26, 2026 at 10:04:33 AM UTC-0500"},{"title":"Implement DBSCAN Clustering Algorithm","category":"Machine Learning","difficulty":"medium","id":"259","createdAt":"December 14, 2025 at 1:18:30 PM UTC-0500"},{"title":"Implementing Basic Autograd Operations","category":"Deep Learning","difficulty":"medium","id":"26","createdAt":"February 22, 2026 at 7:57:24 AM UTC-0500"},{"title":"Calculate Expected Calibration Error (ECE)","category":"Machine Learning","difficulty":"medium","id":"260","createdAt":"December 14, 2025 at 1:18:30 PM UTC-0500"},{"title":"Gaussian Naive Bayes Classifier","category":"Machine Learning","difficulty":"medium","id":"261","createdAt":"December 14, 2025 at 1:18:30 PM UTC-0500"},{"title":"Implement the Mish Activation Function","category":"Deep Learning","difficulty":"easy","id":"262","createdAt":"December 15, 2025 at 7:02:03 AM UTC-0500"},{"title":"Implement Binary Cross-Entropy Loss","category":"Deep Learning","difficulty":"easy","id":"263","createdAt":"December 15, 2025 at 7:02:03 AM UTC-0500"},{"title":"Implement the Tanh Activation Function","category":"Deep Learning","difficulty":"easy","id":"264","createdAt":"December 15, 2025 at 7:02:03 AM UTC-0500"},{"title":"Implement 2D Average Pooling","category":"Deep Learning","difficulty":"easy","id":"265","createdAt":"December 15, 2025 at 7:02:03 AM UTC-0500"},{"title":"Implement the Hardtanh Activation Function","category":"Deep Learning","difficulty":"easy","id":"266","createdAt":"December 15, 2025 at 7:02:03 AM UTC-0500"},{"title":"Implement Neural Memory Update with Surprise and Momentum","category":"Deep Learning","difficulty":"medium","id":"267","createdAt":"December 15, 2025 at 1:45:15 PM UTC-0500"},{"title":"Implement Relativistic Critic Rewards for Adversarial Reasoning","category":"Deep Learning","difficulty":"medium","id":"268","createdAt":"December 15, 2025 at 6:37:46 PM UTC-0500"},{"title":"A/B Test Statistical Analysis for Model Comparison","category":"MLOps","difficulty":"hard","id":"269","createdAt":"December 16, 2025 at 1:00:03 PM UTC-0500"},{"title":"Transformation Matrix from Basis B to C","category":"Linear Algebra","difficulty":"easy","id":"27","createdAt":null},{"title":"ML Pipeline DAG Scheduler with Critical Path Analysis","category":"MLOps","difficulty":"hard","id":"270","createdAt":"December 16, 2025 at 1:00:03 PM UTC-0500"},{"title":"Implement Gated Attention","category":"Deep Learning","difficulty":"medium","id":"271","createdAt":"December 22, 2025 at 10:58:53 AM UTC-0500"},{"title":"First-Visit Monte Carlo Prediction","category":"Reinforcement Learning","difficulty":"medium","id":"272","createdAt":"December 27, 2025 at 5:49:45 PM UTC-0500"},{"title":"n-Step TD Prediction","category":"Reinforcement Learning","difficulty":"medium","id":"273","createdAt":"December 27, 2025 at 5:44:57 PM UTC-0500"},{"title":"TD(llama) with Eligibility Traces","category":"Reinforcement Learning","difficulty":"hard","id":"274","createdAt":"December 27, 2025 at 5:59:51 PM UTC-0500"},{"title":"Implement Stratified Train-Test Split","category":"Machine Learning","difficulty":"medium","id":"275","createdAt":"December 27, 2025 at 9:56:52 PM UTC-0500"},{"title":"Implement ROC Curve Calculation","category":"Machine Learning","difficulty":"medium","id":"276","createdAt":"December 27, 2025 at 10:24:56 PM UTC-0500"},{"title":"Calculate AUC (Area Under ROC Curve)","category":"Machine Learning","difficulty":"medium","id":"277","createdAt":"December 27, 2025 at 10:24:56 PM UTC-0500"},{"title":"Implement Precision-Recall Curve","category":"Machine Learning","difficulty":"medium","id":"278","createdAt":"December 27, 2025 at 10:24:56 PM UTC-0500"},{"title":"Calculate Matthews Correlation Coefficient","category":"Machine Learning","difficulty":"medium","id":"279","createdAt":"December 28, 2025 at 8:23:27 AM UTC-0500"},{"title":"SVD of a 2x2 Matrix","category":"Linear Algebra","difficulty":"hard","id":"28","createdAt":"December 15, 2025 at 9:44:34 AM UTC-0500"},{"title":"Implement RBF (Gaussian) Kernel Function","category":"Machine Learning","difficulty":"medium","id":"280","createdAt":"December 28, 2025 at 8:23:27 AM UTC-0500"},{"title":"Implement Polynomial Kernel Function","category":"Machine Learning","difficulty":"easy","id":"281","createdAt":"December 28, 2025 at 10:55:31 AM UTC-0500"},{"title":"Calculate SVM Margin Width","category":"Machine Learning","difficulty":"easy","id":"282","createdAt":"December 28, 2025 at 10:55:31 AM UTC-0500"},{"title":"Implement Hinge Loss for SVM","category":"Machine Learning","difficulty":"easy","id":"283","createdAt":"December 28, 2025 at 10:55:31 AM UTC-0500"},{"title":"Implement Entropy-based Split Selection","category":"Machine Learning","difficulty":"medium","id":"284","createdAt":"December 28, 2025 at 10:56:33 AM UTC-0500"},{"title":"Decision Tree Pruning with Cost-Complexity","category":"Machine Learning","difficulty":"medium","id":"285","createdAt":"December 28, 2025 at 10:56:33 AM UTC-0500"},{"title":"Implement Decision Tree for Regression","category":"Machine Learning","difficulty":"medium","id":"286","createdAt":"December 28, 2025 at 10:56:33 AM UTC-0500"},{"title":"Implement GRU Cell","category":"Deep Learning","difficulty":"medium","id":"287","createdAt":"December 29, 2025 at 8:09:31 AM UTC-0500"},{"title":"Implement Grid Search","category":"Machine Learning","difficulty":"medium","id":"288","createdAt":"December 29, 2025 at 8:09:31 AM UTC-0500"},{"title":"Implement Xavier/Glorot Weight Initialization","category":"Deep Learning","difficulty":"medium","id":"289","createdAt":"December 29, 2025 at 8:09:31 AM UTC-0500"},{"title":"Random Shuffle of Dataset","category":"Machine Learning","difficulty":"easy","id":"29","createdAt":null},{"title":"Implement He Weight Initialization","category":"Deep Learning","difficulty":"easy","id":"290","createdAt":"December 29, 2025 at 8:09:31 AM UTC-0500"},{"title":"Calculate Number of Parameters in Neural Network","category":"Deep Learning","difficulty":"medium","id":"291","createdAt":"December 29, 2025 at 8:09:31 AM UTC-0500"},{"title":"Implement Gradient Clipping by Value","category":"Deep Learning","difficulty":"easy","id":"292","createdAt":"December 29, 2025 at 8:09:31 AM UTC-0500"},{"title":"Calculate P50/P95/P99 Latency Percentiles","category":"Statistics","difficulty":"easy","id":"293","createdAt":"December 29, 2025 at 9:31:20 AM UTC-0500"},{"title":"Implement INT8 Quantization","category":"Deep Learning","difficulty":"medium","id":"294","createdAt":"December 29, 2025 at 9:31:20 AM UTC-0500"},{"title":"Implement Prediction Distribution Monitoring","category":"MLOps","difficulty":"medium","id":"295","createdAt":"December 29, 2025 at 9:31:20 AM UTC-0500"},{"title":"Calculate Statistical Power for Experiment Design","category":"Statistics","difficulty":"medium","id":"296","createdAt":"December 29, 2025 at 9:31:20 AM UTC-0500"},{"title":"Implement Request Batching for Inference","category":"MLOps","difficulty":"medium","id":"297","createdAt":"December 29, 2025 at 9:31:20 AM UTC-0500"},{"title":"Implement mHC Forward Pass","category":"Deep Learning","difficulty":"medium","id":"298","createdAt":"January 1, 2026 at 11:24:02 AM UTC-0500"},{"title":"Implement Tick Bars Sampling","category":"Financial Machine Learning","difficulty":"medium","id":"299","createdAt":"January 2, 2026 at 9:18:48 AM UTC-0500"},{"title":"Reshape Matrix","category":"Linear Algebra","difficulty":"easy","id":"3","createdAt":null},{"title":"Batch Iterator for Dataset","category":"Machine Learning","difficulty":"easy","id":"30","createdAt":null},{"title":"Implement Volume Bars Sampling","category":"Machine Learning","difficulty":"medium","id":"300","createdAt":"January 2, 2026 at 2:27:29 PM UTC-0500"},{"title":"Implement Dollar Bars Sampling","category":"Machine Learning","difficulty":"medium","id":"301","createdAt":"January 2, 2026 at 2:27:29 PM UTC-0500"},{"title":"Diffusion Reconstruction Loss","category":"Deep Learning","difficulty":"medium","id":"302","createdAt":"January 6, 2026 at 11:12:28 AM UTC-0500"},{"title":"Forward Diffusion Process","category":"Deep Learning","difficulty":"medium","id":"303","createdAt":"January 5, 2026 at 8:04:32 PM UTC-0500"},{"title":"Forward & Backward Diffusion Process","category":"Deep Learning","difficulty":"medium","id":"304","createdAt":"January 5, 2026 at 9:37:09 PM UTC-0500"},{"title":"Implement Hard Voting Classifier","category":"Machine Learning","difficulty":"easy","id":"305","createdAt":"January 6, 2026 at 1:49:27 PM UTC-0500"},{"title":"Implement Soft Voting Classifier","category":"Machine Learning","difficulty":"medium","id":"306","createdAt":"January 6, 2026 at 1:49:27 PM UTC-0500"},{"title":"Implement Bagging Classifier from Scratch","category":"Machine Learning","difficulty":"hard","id":"307","createdAt":"January 6, 2026 at 3:51:11 PM UTC-0500"},{"title":"Gradient Direction and Magnitude","category":"Machine Learning","difficulty":"easy","id":"308","createdAt":"January 26, 2026 at 10:13:12 AM UTC-0500"},{"title":"Product Rule for Derivatives","category":"Machine Learning","difficulty":"medium","id":"309","createdAt":"January 9, 2026 at 1:38:30 PM UTC-0500"},{"title":"Divide Dataset Based on Feature Threshold","category":"Machine Learning","difficulty":"medium","id":"31","createdAt":null},{"title":"Taylor Series Approximation","category":"Machine Learning","difficulty":"easy","id":"310","createdAt":"January 26, 2026 at 10:24:20 AM UTC-0500"},{"title":"Classify Critical Points Using Hessian Eigenvalues","category":"Machine Learning","difficulty":"medium","id":"311","createdAt":"February 11, 2026 at 4:24:48 PM UTC-0500"},{"title":"Quotient Rule for Derivatives","category":"Calculus","difficulty":"medium","id":"312","createdAt":"January 9, 2026 at 1:38:30 PM UTC-0500"},{"title":"Numerical Gradient Checking","category":"Machine Learning","difficulty":"medium","id":"313","createdAt":"January 9, 2026 at 1:38:30 PM UTC-0500"},{"title":"Lagrange Multipliers for Constrained Quadratic Optimization","category":"Machine Learning","difficulty":"medium","id":"314","createdAt":"January 9, 2026 at 1:38:30 PM UTC-0500"},{"title":"Elo Rating System for Model Comparison","category":"Machine Learning","difficulty":"medium","id":"315","createdAt":"January 12, 2026 at 1:17:41 PM UTC-0500"},{"title":"MMLU Log-Probability Scoring","category":"LLM","difficulty":"medium","id":"316","createdAt":"January 12, 2026 at 1:17:41 PM UTC-0500"},{"title":"Rubric-Based LLM Judge Evaluation","category":"LLM","difficulty":"medium","id":"317","createdAt":"January 12, 2026 at 1:17:41 PM UTC-0500"},{"title":"Boxed Answer Extraction for Math Benchmarks","category":"LLM","difficulty":"medium","id":"318","createdAt":"January 12, 2026 at 1:17:41 PM UTC-0500"},{"title":"Math Answer Verification with Equivalence Checking","category":"LLM","difficulty":"medium","id":"319","createdAt":"January 12, 2026 at 1:17:41 PM UTC-0500"},{"title":"Generate Sorted Polynomial Features","category":"Machine Learning","difficulty":"medium","id":"32","createdAt":null},{"title":"Calculate Perplexity for Language Models","category":"NLP","difficulty":"easy","id":"320","createdAt":"January 12, 2026 at 1:17:41 PM UTC-0500"},{"title":"BLEU Score for Text Generation","category":"NLP","difficulty":"medium","id":"321","createdAt":"January 12, 2026 at 1:17:41 PM UTC-0500"},{"title":"Bradley-Terry Model for Pairwise Rankings","category":"NLP","difficulty":"medium","id":"322","createdAt":"January 12, 2026 at 1:17:41 PM UTC-0500"},{"title":"Pairwise Preference Judge for LLM Comparison","category":"LLM","difficulty":"medium","id":"323","createdAt":"January 12, 2026 at 1:17:41 PM UTC-0500"},{"title":"Code Execution Verifier for Programming Benchmarks","category":"LLM","difficulty":"medium","id":"324","createdAt":"January 12, 2026 at 1:17:41 PM UTC-0500"},{"title":"Exact Match Score with Normalization","category":"NLP","difficulty":"easy","id":"325","createdAt":"January 12, 2026 at 1:17:41 PM UTC-0500"},{"title":"MMLU Letter-Matching Evaluation","category":"NLP","difficulty":"medium","id":"326","createdAt":"January 12, 2026 at 1:17:41 PM UTC-0500"},{"title":"Engram Context-Aware Gating","category":"Deep Learning","difficulty":"medium","id":"327","createdAt":"January 12, 2026 at 6:12:35 PM UTC-0500"},{"title":"Vector Norms (L1/L2/Frobenius)","category":"Linear Algebra","difficulty":"easy","id":"328","createdAt":"January 14, 2026 at 1:19:47 PM UTC-0500"},{"title":"Matrix Rank","category":"Linear Algebra","difficulty":"medium","id":"329","createdAt":"January 14, 2026 at 1:19:47 PM UTC-0500"},{"title":"Generate Random Subsets of a Dataset","category":"Machine Learning","difficulty":"medium","id":"33","createdAt":"January 23, 2026 at 3:34:10 PM UTC-0500"},{"title":"Compute the Null Space (Kernel) of a Matrix","category":"Linear Algebra","difficulty":"medium","id":"330","createdAt":"January 14, 2026 at 1:19:47 PM UTC-0500"},{"title":"Check Linear Independence of Vectors","category":"Linear Algebra","difficulty":"easy","id":"331","createdAt":"January 14, 2026 at 1:19:47 PM UTC-0500"},{"title":"Check if Matrix is Positive Definite","category":"Linear Algebra","difficulty":"medium","id":"332","createdAt":"January 14, 2026 at 1:19:47 PM UTC-0500"},{"title":"LU Decomposition of a Square Matrix","category":"Linear Algebra","difficulty":"medium","id":"333","createdAt":"January 14, 2026 at 1:19:47 PM UTC-0500"},{"title":"Cholesky Decomposition","category":"Linear Algebra","difficulty":"medium","id":"334","createdAt":"January 14, 2026 at 1:19:47 PM UTC-0500"},{"title":"Train a Paris-Style Decentralized Expert Model","category":"Deep Learning","difficulty":"medium","id":"335","createdAt":"January 21, 2026 at 10:59:06 PM UTC-0500"},{"title":"Compute Posterior Probability using Bayes' Theorem","category":"Probability","difficulty":"easy","id":"336","createdAt":"January 23, 2026 at 3:20:30 PM UTC-0500"},{"title":"Maximum Likelihood Estimation for Gaussian Distribution","category":"Statistics","difficulty":"medium","id":"337","createdAt":"January 23, 2026 at 3:20:30 PM UTC-0500"},{"title":"Maximum A Posteriori (MAP) Estimation for Bernoulli Parameter","category":"Machine Learning","difficulty":"medium","id":"338","createdAt":"January 23, 2026 at 3:20:30 PM UTC-0500"},{"title":"Beta Distribution PDF and Statistics","category":"Statistics","difficulty":"medium","id":"339","createdAt":"January 23, 2026 at 3:20:30 PM UTC-0500"},{"title":"One-Hot Encoding of Nominal Values","category":"Machine Learning","difficulty":"easy","id":"34","createdAt":null},{"title":"Exponential Distribution PDF and CDF","category":"Statistics","difficulty":"easy","id":"340","createdAt":"January 23, 2026 at 3:20:30 PM UTC-0500"},{"title":"Gaussian Mixture Model with EM Algorithm","category":"Machine Learning","difficulty":"medium","id":"341","createdAt":"January 23, 2026 at 3:20:30 PM UTC-0500"},{"title":"Demonstrate Law of Large Numbers with Sampling","category":"Statistics","difficulty":"easy","id":"342","createdAt":"January 22, 2026 at 1:44:40 PM UTC-0500"},{"title":"Implement Random Forest Feature Importance","category":"Machine Learning","difficulty":"medium","id":"343","createdAt":"January 26, 2026 at 1:05:33 PM UTC-0500"},{"title":"Implement Gradient Boosting Regressor Step","category":"Machine Learning","difficulty":"medium","id":"344","createdAt":"January 26, 2026 at 1:05:33 PM UTC-0500"},{"title":"Implement Out-of-Bag Score Calculation","category":"Machine Learning","difficulty":"medium","id":"345","createdAt":"January 26, 2026 at 1:05:33 PM UTC-0500"},{"title":"Implement Stacking Classifier","category":"Machine Learning","difficulty":"hard","id":"346","createdAt":"January 26, 2026 at 1:05:33 PM UTC-0500"},{"title":"XGBoost Objective Function Calculation","category":"Machine Learning","difficulty":"medium","id":"347","createdAt":"January 26, 2026 at 1:05:33 PM UTC-0500"},{"title":"Domain Expert Model Fusion","category":"Machine Learning","difficulty":"medium","id":"348","createdAt":"January 26, 2026 at 3:55:14 PM UTC-0500"},{"title":"Implement Kernel PCA with RBF Kernel","category":"Machine Learning","difficulty":"hard","id":"349","createdAt":"January 27, 2026 at 8:12:37 PM UTC-0500"},{"title":"Convert Vector to Diagonal Matrix","category":"Linear Algebra","difficulty":"easy","id":"35","createdAt":null},{"title":"Calculate Explained Variance Ratio for PCA","category":"Machine Learning","difficulty":"medium","id":"350","createdAt":"January 27, 2026 at 8:12:37 PM UTC-0500"},{"title":"Implement LLE (Locally Linear Embedding)","category":"Machine Learning","difficulty":"hard","id":"351","createdAt":"January 27, 2026 at 8:12:37 PM UTC-0500"},{"title":"Implement t-SNE Gradient Calculation","category":"Machine Learning","difficulty":"medium","id":"352","createdAt":"January 27, 2026 at 8:12:37 PM UTC-0500"},{"title":"Reconstruction Error from PCA","category":"Machine Learning","difficulty":"medium","id":"353","createdAt":"January 27, 2026 at 8:12:37 PM UTC-0500"},{"title":"Handle Missing Data with Imputation","category":"Data Preprocessing","difficulty":"medium","id":"354","createdAt":"January 28, 2026 at 4:29:16 PM UTC-0500"},{"title":"Outlier Detection and Removal Using IQR Method","category":"Data Preprocessing","difficulty":"medium","id":"355","createdAt":"January 28, 2026 at 4:29:16 PM UTC-0500"},{"title":"Label Encoding for Ordinal Variables","category":"Data Preprocessing","difficulty":"easy","id":"356","createdAt":"January 28, 2026 at 4:29:16 PM UTC-0500"},{"title":"Handle Imbalanced Data with SMOTE","category":"Data Preprocessing","difficulty":"medium","id":"357","createdAt":"January 28, 2026 at 4:29:16 PM UTC-0500"},{"title":"Implement Core MDN Residualization","category":"Deep Learning","difficulty":"hard","id":"358","createdAt":"January 29, 2026 at 12:49:29 PM UTC-0500"},{"title":"Distance Correlation for Measuring Metadata Dependence","category":"Deep Learning","difficulty":"medium","id":"359","createdAt":"January 29, 2026 at 12:49:29 PM UTC-0500"},{"title":"Calculate Accuracy Score","category":"Machine Learning","difficulty":"easy","id":"36","createdAt":null},{"title":"MDN with Label Collinearity Control","category":"Deep Learning","difficulty":"hard","id":"360","createdAt":"January 29, 2026 at 12:49:29 PM UTC-0500"},{"title":"Fine-Tune Model Weights with RLHF Policy Gradient","category":"Reinforcement Learning","difficulty":"medium","id":"361","createdAt":"February 4, 2026 at 11:21:36 AM UTC-0500"},{"title":"Implement K-Means++ Initialization","category":"Machine Learning","difficulty":"medium","id":"362","createdAt":"February 4, 2026 at 4:53:25 PM UTC-0500"},{"title":"Implement Mini-Batch K-Means","category":"Machine Learning","difficulty":"medium","id":"363","createdAt":"February 4, 2026 at 4:53:25 PM UTC-0500"},{"title":"Implement Hierarchical Clustering (Agglomerative)","category":"Machine Learning","difficulty":"medium","id":"364","createdAt":"February 4, 2026 at 4:53:25 PM UTC-0500"},{"title":"Implement Gaussian Mixture Model (GMM) E-step","category":"Machine Learning","difficulty":"medium","id":"365","createdAt":"February 4, 2026 at 4:53:25 PM UTC-0500"},{"title":"Implement Gaussian Mixture Model (GMM) M-step","category":"Machine Learning","difficulty":"medium","id":"366","createdAt":"February 4, 2026 at 4:53:25 PM UTC-0500"},{"title":"Implement Isolation Forest for Anomaly Detection","category":"Machine Learning","difficulty":"medium","id":"367","createdAt":"February 4, 2026 at 4:53:25 PM UTC-0500"},{"title":"Calculate BIC/AIC for Model Selection","category":"Machine Learning","difficulty":"medium","id":"368","createdAt":"February 4, 2026 at 4:53:25 PM UTC-0500"},{"title":"Implement Xavier/Glorot Weight Initialization","category":"Deep Learning","difficulty":"easy","id":"369","createdAt":"February 7, 2026 at 7:51:55 PM UTC-0500"},{"title":"Calculate Correlation Matrix","category":"Linear Algebra","difficulty":"medium","id":"37","createdAt":null},{"title":"Implement He Weight Initialization for Neural Networks","category":"Deep Learning","difficulty":"medium","id":"370","createdAt":"February 7, 2026 at 7:51:55 PM UTC-0500"},{"title":"Calculate Number of Parameters in Neural Network","category":"Deep Learning","difficulty":"easy","id":"371","createdAt":"February 7, 2026 at 7:51:55 PM UTC-0500"},{"title":"Implement RMSNorm (Root Mean Square Layer Normalization)","category":"Deep Learning","difficulty":"easy","id":"372","createdAt":"February 11, 2026 at 8:41:01 PM UTC-0500"},{"title":"Implement the Square ReLU Activation Function","category":"Deep Learning","difficulty":"easy","id":"373","createdAt":"February 11, 2026 at 8:41:01 PM UTC-0500"},{"title":"Character-Level Tokenizer (stoi/itos/BOS)","category":"Deep Learning","difficulty":"easy","id":"374","createdAt":"February 11, 2026 at 8:41:01 PM UTC-0500"},{"title":"Learned Positional Embeddings","category":"Deep Learning","difficulty":"easy","id":"375","createdAt":"February 11, 2026 at 8:41:01 PM UTC-0500"},{"title":"KV Cache for Efficient Autoregressive Attention","category":"Deep Learning","difficulty":"medium","id":"376","createdAt":"February 11, 2026 at 8:41:01 PM UTC-0500"},{"title":"Linear Learning Rate Decay","category":"Machine Learning","difficulty":"easy","id":"377","createdAt":"February 11, 2026 at 8:41:01 PM UTC-0500"},{"title":"Temperature Sampling","category":"Machine Learning","difficulty":"medium","id":"378","createdAt":"February 11, 2026 at 8:41:01 PM UTC-0500"},{"title":"RAFT: Iterative Reward-Ranked Fine-Tuning Loop","category":"Reinforcement Learning","difficulty":"medium","id":"379","createdAt":"February 12, 2026 at 8:52:44 PM UTC-0500"},{"title":"Implement AdaBoost Fit Method","category":"Machine Learning","difficulty":"hard","id":"38","createdAt":null},{"title":"Byte Pair Encoding (BPE) Tokenizer","category":"NLP","difficulty":"medium","id":"380","createdAt":"February 13, 2026 at 4:36:09 PM UTC-0500"},{"title":"Rotary Positional Embeddings (RoPE)","category":"Deep Learning","difficulty":"medium","id":"381","createdAt":"February 13, 2026 at 4:36:09 PM UTC-0500"},{"title":"Direct Preference Optimization (DPO) Loss","category":"LLM","difficulty":"medium","id":"382","createdAt":"February 13, 2026 at 4:36:09 PM UTC-0500"},{"title":"Top-p (Nucleus) Sampling","category":"LLM","difficulty":"medium","id":"383","createdAt":"February 13, 2026 at 4:36:09 PM UTC-0500"},{"title":"Contrastive Loss (InfoNCE / SimCLR-style)","category":"Deep Learning","difficulty":"medium","id":"384","createdAt":"February 13, 2026 at 4:36:09 PM UTC-0500"},{"title":"Beam Search Decoding","category":"Machine Learning","difficulty":"medium","id":"385","createdAt":"February 15, 2026 at 9:50:33 AM UTC-0500"},{"title":"Spectral Normalization","category":"Deep Learning","difficulty":"medium","id":"386","createdAt":"February 15, 2026 at 9:50:33 AM UTC-0500"},{"title":"Triplet Margin Loss","category":"Deep Learning","difficulty":"medium","id":"387","createdAt":"February 15, 2026 at 9:50:33 AM UTC-0500"},{"title":"Sliding Window Attention","category":"Deep Learning","difficulty":"medium","id":"388","createdAt":"February 15, 2026 at 9:50:33 AM UTC-0500"},{"title":"Mixture of Experts Load Balancing Loss","category":"Deep Learning","difficulty":"medium","id":"389","createdAt":"February 15, 2026 at 9:50:33 AM UTC-0500"},{"title":"Implementation of Log Softmax Function","category":"Deep Learning","difficulty":"easy","id":"39","createdAt":null},{"title":"Implement Multiquery Attention (MQA)","category":"Deep Learning","difficulty":"medium","id":"390","createdAt":"February 15, 2026 at 7:48:12 PM UTC-0500"},{"title":"Implement Grouped Query Attention (GQA)","category":"Deep Learning","difficulty":"medium","id":"391","createdAt":"February 15, 2026 at 7:48:12 PM UTC-0500"},{"title":"Implement Cosine Annealing with Warm Restarts","category":"Machine Learning","difficulty":"medium","id":"392","createdAt":"February 15, 2026 at 7:48:12 PM UTC-0500"},{"title":"Implement Variational Autoencoder (VAE) Loss (ELBO)","category":"Deep Learning","difficulty":"medium","id":"393","createdAt":"February 15, 2026 at 7:48:12 PM UTC-0500"},{"title":"Implement Speculative Decoding Verification","category":"Deep Learning","difficulty":"hard","id":"394","createdAt":"February 15, 2026 at 7:48:12 PM UTC-0500"},{"title":"DDPM Noise Schedule (Linear Beta Schedule)","category":"Deep Learning","difficulty":"medium","id":"395","createdAt":"February 18, 2026 at 9:32:09 AM UTC-0500"},{"title":"Implement DDPM Reverse Sampling Step","category":"Deep Learning","difficulty":"medium","id":"396","createdAt":"February 18, 2026 at 9:32:09 AM UTC-0500"},{"title":"Classifier-Free Guidance for Conditional Diffusion","category":"Deep Learning","difficulty":"medium","id":"397","createdAt":"February 18, 2026 at 9:32:09 AM UTC-0500"},{"title":"DDIM Deterministic Sampling Step","category":"Deep Learning","difficulty":"medium","id":"398","createdAt":"February 18, 2026 at 9:32:09 AM UTC-0500"},{"title":"Diffusion Model U-Net Time Embedding","category":"Deep Learning","difficulty":"medium","id":"399","createdAt":"February 18, 2026 at 9:32:09 AM UTC-0500"},{"title":"Calculate Mean by Row or Column","category":"Linear Algebra","difficulty":"easy","id":"4","createdAt":null},{"title":"Implementing a Custom Dense Layer in Python","category":"Deep Learning","difficulty":"hard","id":"40","createdAt":"January 16, 2026 at 3:37:43 PM UTC-0500"},{"title":"Noise Prediction Loss for Diffusion Training","category":"Deep Learning","difficulty":"medium","id":"400","createdAt":"February 18, 2026 at 10:00:52 AM UTC-0500"},{"title":"Exponential Moving Average (EMA) for Diffusion Model Weights","category":"Deep Learning","difficulty":"easy","id":"401","createdAt":"February 18, 2026 at 10:00:52 AM UTC-0500"},{"title":"Latent Diffusion Encoding and Decoding","category":"Deep Learning","difficulty":"medium","id":"402","createdAt":"February 18, 2026 at 10:00:52 AM UTC-0500"},{"title":"Diffusion Cosine Noise Schedule","category":"Deep Learning","difficulty":"medium","id":"403","createdAt":"February 18, 2026 at 10:00:52 AM UTC-0500"},{"title":"Implement Score Matching for Score-Based Diffusion","category":"Deep Learning","difficulty":"medium","id":"404","createdAt":"February 18, 2026 at 10:00:52 AM UTC-0500"},{"title":"Multi-Head Latent Attention (MLA)","category":"Deep Learning","difficulty":"hard","id":"405","createdAt":"February 20, 2026 at 3:13:40 PM UTC-0500"},{"title":"NoPE (No Positional Embedding) with iRoPE Attention","category":"Deep Learning","difficulty":"hard","id":"406","createdAt":"February 20, 2026 at 3:13:40 PM UTC-0500"},{"title":"QK-Norm (Query-Key Normalization)","category":"Deep Learning","difficulty":"medium","id":"407","createdAt":"February 20, 2026 at 3:13:40 PM UTC-0500"},{"title":"Pre-Norm vs Post-Norm Transformer Block","category":"Deep Learning","difficulty":"medium","id":"408","createdAt":"February 20, 2026 at 3:13:40 PM UTC-0500"},{"title":"MoE with Shared Expert Forward Pass","category":"Deep Learning","difficulty":"medium","id":"409","createdAt":"February 20, 2026 at 3:13:40 PM UTC-0500"},{"title":"Simple Convolutional 2D Layer","category":"Deep Learning","difficulty":"medium","id":"41","createdAt":null},{"title":"Speculative Decoding End-to-End Simulation","category":"LLM","difficulty":"hard","id":"410","createdAt":"February 24, 2026 at 8:23:26 AM UTC-0500"},{"title":"Compute TTFT ITL and TPS from a Token Timestamp Stream","category":"Machine Learning","difficulty":"easy","id":"411","createdAt":"February 24, 2026 at 8:51:51 AM UTC-0500"},{"title":"Estimate Minimum GPU Count for Model Deployment","category":"MLOps","difficulty":"easy","id":"412","createdAt":"February 24, 2026 at 8:51:51 AM UTC-0500"},{"title":"End-to-End Latency Decomposition","category":"Machine Learning","difficulty":"medium","id":"413","createdAt":"February 24, 2026 at 8:51:51 AM UTC-0500"},{"title":"Compute Arithmetic Intensity and Classify Bottleneck","category":"Inference","difficulty":"easy","id":"414","createdAt":"February 25, 2026 at 4:47:16 PM UTC-0500"},{"title":"Roofline Model Analysis for GPU Operations","category":"Inference","difficulty":"medium","id":"415","createdAt":"February 25, 2026 at 4:47:16 PM UTC-0500"},{"title":"Compute Attention Memory Traffic and FLOPs","category":"Inference","difficulty":"medium","id":"416","createdAt":"February 25, 2026 at 4:47:16 PM UTC-0500"},{"title":"Classify LLM Prefill vs Decode as Compute-Bound or Memory-Bound","category":"Inference","difficulty":"medium","id":"417","createdAt":"February 25, 2026 at 4:47:16 PM UTC-0500"},{"title":"Estimate KV Cache Size from Model Config","category":"Inference","difficulty":"medium","id":"418","createdAt":"February 25, 2026 at 4:47:16 PM UTC-0500"},{"title":"Combined Token Sampling Pipeline (Temperature + Top-k + Top-p)","category":"Inference","difficulty":"hard","id":"419","createdAt":"February 25, 2026 at 4:47:16 PM UTC-0500"},{"title":"Implement ReLU Activation Function","category":"Deep Learning","difficulty":"easy","id":"42","createdAt":null},{"title":"Latent Space Patchification for Diffusion Transformers","category":"Inference","difficulty":"medium","id":"420","createdAt":"February 25, 2026 at 4:47:16 PM UTC-0500"},{"title":"GPU Ops:Byte Ratio Calculation from Spec Sheet","category":"Inference","difficulty":"easy","id":"421","createdAt":"March 4, 2026 at 8:59:14 PM UTC-0500"},{"title":"Multi-GPU Communication Overhead (NVLink vs InfiniBand)","category":"Inference","difficulty":"medium","id":"422","createdAt":"March 4, 2026 at 8:59:14 PM UTC-0500"},{"title":"Multi-Instance GPU (MIG) Resource Allocation","category":"Inference","difficulty":"medium","id":"423","createdAt":"March 4, 2026 at 8:59:14 PM UTC-0500"},{"title":"Kernel Fusion Memory Savings Calculator","category":"Inference","difficulty":"medium","id":"424","createdAt":"March 4, 2026 at 9:18:27 PM UTC-0500"},{"title":"Continuous Batching (In-Flight Batching) Simulator","category":"Inference","difficulty":"medium","id":"425","createdAt":"March 4, 2026 at 9:18:27 PM UTC-0500"},{"title":"Post-Training Quantization with Per-Channel Scale Factors","category":"Deep Learning","difficulty":"medium","id":"426","createdAt":"March 5, 2026 at 5:24:59 PM UTC-0500"},{"title":"FP4 Quantization with Microscaling (MXFP4)","category":"Deep Learning","difficulty":"hard","id":"427","createdAt":"March 5, 2026 at 5:24:59 PM UTC-0500"},{"title":"Number Format Precision Comparison (FP16 vs BF16 vs FP8 vs FP4)","category":"Deep Learning","difficulty":"hard","id":"428","createdAt":"March 5, 2026 at 5:24:59 PM UTC-0500"},{"title":"Quantization Quality Check via Perplexity Delta","category":"Machine Learning","difficulty":"medium","id":"429","createdAt":"March 5, 2026 at 5:24:59 PM UTC-0500"},{"title":"Implement Ridge Regression Loss Function","category":"Machine Learning","difficulty":"easy","id":"43","createdAt":null},{"title":"Draft-Target Speculative Decoding Simulation","category":"Machine Learning","difficulty":"medium","id":"430","createdAt":"March 5, 2026 at 5:24:59 PM UTC-0500"},{"title":"EAGLE-Style Draft Model from Hidden States","category":"Deep Learning","difficulty":"medium","id":"431","createdAt":"March 5, 2026 at 5:24:59 PM UTC-0500"},{"title":"N-gram Speculation Dictionary Construction and Lookup","category":"Machine Learning","difficulty":"medium","id":"432","createdAt":"March 5, 2026 at 5:24:59 PM UTC-0500"},{"title":"Speculative Decoding Acceptance Rate vs Temperature","category":"Machine Learning","difficulty":"medium","id":"433","createdAt":"March 5, 2026 at 5:24:59 PM UTC-0500"},{"title":"Prefix Cache Hit Rate Calculator","category":"Machine Learning","difficulty":"easy","id":"434","createdAt":"March 5, 2026 at 5:24:59 PM UTC-0500"},{"title":"KV Cache Memory Budget and Eviction Policy","category":"Deep Learning","difficulty":"medium","id":"435","createdAt":"March 5, 2026 at 5:24:59 PM UTC-0500"},{"title":"KV Cache Tiered Offloading Simulator","category":"Machine Learning","difficulty":"medium","id":"436","createdAt":"March 5, 2026 at 5:24:59 PM UTC-0500"},{"title":"Cache-Aware Request Routing Across Replicas","category":"MLOps","difficulty":"medium","id":"437","createdAt":"March 5, 2026 at 5:24:59 PM UTC-0500"},{"title":"Tensor Parallelism All-Reduce Communication Cost","category":"Deep Learning","difficulty":"medium","id":"438","createdAt":"March 5, 2026 at 5:24:59 PM UTC-0500"},{"title":"Expert Parallelism Token Routing and Communication Cost","category":"Machine Learning","difficulty":"medium","id":"439","createdAt":"March 5, 2026 at 5:24:59 PM UTC-0500"},{"title":"Leaky ReLU Activation Function","category":"Deep Learning","difficulty":"easy","id":"44","createdAt":null},{"title":"Disaggregated Prefill-Decode Serving Simulator","category":"Machine Learning","difficulty":"hard","id":"440","createdAt":"March 5, 2026 at 5:24:59 PM UTC-0500"},{"title":"Chunked Prefill Scheduling Alongside Decode","category":"MLOps","difficulty":"medium","id":"441","createdAt":"March 5, 2026 at 5:24:59 PM UTC-0500"},{"title":"VLM Visual Token Count from Image Resolution and Patch Size","category":"Deep Learning","difficulty":"easy","id":"442","createdAt":"March 6, 2026 at 1:29:02 PM UTC-0500"},{"title":"Embedding Quantization Quality via Cosine Similarity","category":"Machine Learning","difficulty":"medium","id":"443","createdAt":"March 6, 2026 at 1:29:02 PM UTC-0500"},{"title":"ASR Real-Time Factor for Parallel Chunk Transcription","category":"Machine Learning","difficulty":"medium","id":"444","createdAt":"March 6, 2026 at 1:29:02 PM UTC-0500"},{"title":"TTS Concurrent Real-Time Stream Capacity","category":"Machine Learning","difficulty":"medium","id":"445","createdAt":"March 6, 2026 at 1:29:02 PM UTC-0500"},{"title":"Video Generation Latent Space Memory Estimation","category":"Deep Learning","difficulty":"medium","id":"446","createdAt":"March 6, 2026 at 1:29:02 PM UTC-0500"},{"title":"Classifier-Free Guidance Skip Speedup Calculator","category":"Deep Learning","difficulty":"medium","id":"447","createdAt":"March 6, 2026 at 1:29:02 PM UTC-0500"},{"title":"Context Parallelism with Ring Attention for Video Models","category":"Deep Learning","difficulty":"hard","id":"448","createdAt":"March 6, 2026 at 1:29:02 PM UTC-0500"},{"title":"Autoscaling Replica Simulator with SLA Tracking","category":"Machine Learning","difficulty":"medium","id":"449","createdAt":"March 6, 2026 at 1:40:09 PM UTC-0500"},{"title":"Linear Kernel Function","category":"Machine Learning","difficulty":"easy","id":"45","createdAt":null},{"title":"Cold Start Latency Budget Breakdown","category":"Machine Learning","difficulty":"medium","id":"450","createdAt":"March 6, 2026 at 1:40:09 PM UTC-0500"},{"title":"Break-Even Pay-Per-Token API vs Dedicated GPU","category":"Machine Learning","difficulty":"medium","id":"451","createdAt":"March 6, 2026 at 1:40:09 PM UTC-0500"},{"title":"Continuous Batching vs Static Batching Throughput Comparison","category":"Machine Learning Systems","difficulty":"medium","id":"452","createdAt":"March 6, 2026 at 1:40:09 PM UTC-0500"},{"title":"Implement Graph Convolution Network (GCN) Layer","category":"Deep Learning","difficulty":"medium","id":"453","createdAt":"March 12, 2026 at 12:56:13 PM UTUTC-4"},{"title":"Autoregressive Video Chunk FPS Calculator","category":"Computer Vision","difficulty":"easy","id":"454","createdAt":"March 13, 2026 at 2:56:59 PM UTUTC-4"},{"title":"Historical Context Compression Ratio","category":"Computer Vision","difficulty":"easy","id":"455","createdAt":"March 13, 2026 at 3:23:34 PM UTUTC-4"},{"title":"Multi-term Memory Patchification for Video","category":"Deep Learning","difficulty":"medium","id":"456","createdAt":"March 14, 2026 at 8:57:24 PM UTUTC-4"},{"title":"Implement Attention Sink Detection","category":"Deep Learning","difficulty":"medium","id":"457","createdAt":"March 16, 2026 at 8:54:22 PM UTUTC-4"},{"title":"Implement Sigmoid MoE Router with Bias Correction","category":"Deep Learning","difficulty":"hard","id":"458","createdAt":"March 19, 2026 at 4:05:00 PM UTUTC-4"},{"title":"Frame-Aware Corrupt for Drift Simulation","category":"Computer Vision","difficulty":"medium","id":"459","createdAt":"March 19, 2026 at 4:12:41 PM UTUTC-4"},{"title":"Implement Precision Metric","category":"Machine Learning","difficulty":"easy","id":"46","createdAt":null},{"title":"First Frame Anchor Noise Injection","category":"Deep Learning","difficulty":"easy","id":"460","createdAt":"March 19, 2026 at 5:05:13 PM UTUTC-4"},{"title":"Guidance Attention Mask for Chunked Video","category":"Deep Learning","difficulty":"medium","id":"461","createdAt":"March 19, 2026 at 5:12:28 PM UTUTC-4"},{"title":"UniPC Predictor-Corrector Step","category":"Deep Learning","difficulty":"medium","id":"462","createdAt":"March 20, 2026 at 7:59:08 AM UTUTC-4"},{"title":"Unified History Injection for Autoregressive Video Diffusion","category":"Deep Learning","difficulty":"medium","id":"463","createdAt":"March 20, 2026 at 9:00:58 AM UTUTC-4"},{"title":"Bellman Expectation Equation for State-Value Function","category":"Reinforcement Learning","difficulty":"medium","id":"464","createdAt":"March 23, 2026 at 4:31:54 PM UTUTC-4"},{"title":"Bellman Expectation Equation for Action-Value Function","category":"Reinforcement Learning","difficulty":"medium","id":"465","createdAt":"March 23, 2026 at 4:31:54 PM UTUTC-4"},{"title":"Optimal Policy Extraction from Q-Values","category":"Reinforcement Learning","difficulty":"easy","id":"466","createdAt":"March 23, 2026 at 4:31:54 PM UTUTC-4"},{"title":"Policy Iteration for Markov Decision Processes","category":"Machine Learning","difficulty":"hard","id":"467","createdAt":"March 23, 2026 at 4:47:26 PM UTUTC-4"},{"title":"Asynchronous Dynamic Programming for Value Iteration","category":"Reinforcement Learning","difficulty":"medium","id":"468","createdAt":"March 23, 2026 at 4:47:26 PM UTUTC-4"},{"title":"Generalized Policy Iteration (GPI) Simulation","category":"Reinforcement Learning","difficulty":"medium","id":"469","createdAt":"March 23, 2026 at 4:47:26 PM UTUTC-4"},{"title":"Implement Gradient Descent Variants with MSE Loss","category":"Machine Learning","difficulty":"medium","id":"47","createdAt":"January 20, 2026 at 12:51:48 PM UTC-0500"},{"title":"First-Visit Monte Carlo Control with Exploring Starts","category":"Reinforcement Learning","difficulty":"hard","id":"470","createdAt":"March 23, 2026 at 5:06:47 PM UTUTC-4"},{"title":"Epsilon-Soft On-Policy Monte Carlo Control","category":"Reinforcement Learning","difficulty":"medium","id":"471","createdAt":"March 23, 2026 at 5:06:47 PM UTUTC-4"},{"title":"Off-Policy Monte Carlo Prediction with Importance Sampling","category":"Reinforcement Learning","difficulty":"medium","id":"472","createdAt":"March 23, 2026 at 5:06:47 PM UTUTC-4"},{"title":"Weighted Importance Sampling for Off-Policy Estimation","category":"Reinforcement Learning","difficulty":"medium","id":"473","createdAt":"March 23, 2026 at 5:06:47 PM UTUTC-4"},{"title":"Off-Policy Monte Carlo Control with Weighted Importance Sampling","category":"Reinforcement Learning","difficulty":"hard","id":"474","createdAt":"March 23, 2026 at 5:06:47 PM UTUTC-4"},{"title":"Full TD(0) Prediction for Value Estimation","category":"Reinforcement Learning","difficulty":"medium","id":"475","createdAt":"March 25, 2026 at 2:51:32 PM UTUTC-4"},{"title":"Expected SARSA Algorithm for Policy Evaluation and Control","category":"Reinforcement Learning","difficulty":"medium","id":"476","createdAt":"March 25, 2026 at 2:51:32 PM UTUTC-4"},{"title":"Double Q-Learning Algorithm","category":"Reinforcement Learning","difficulty":"medium","id":"477","createdAt":"March 25, 2026 at 2:51:32 PM UTUTC-4"},{"title":"n-Step SARSA Q-Value Update from Episode Trajectory","category":"Machine Learning","difficulty":"medium","id":"478","createdAt":"April 30, 2026 at 8:35:49 PM UTUTC-4"},{"title":"Dyna-Q with Planning Updates","category":"Reinforcement Learning","difficulty":"medium","id":"479","createdAt":"April 30, 2026 at 8:35:49 PM UTUTC-4"},{"title":"Implement Reduced Row Echelon Form (RREF) Function","category":"Linear Algebra","difficulty":"medium","id":"48","createdAt":null},{"title":"Semi-gradient SARSA with Linear Function Approximation","category":"Machine Learning","difficulty":"medium","id":"480","createdAt":"April 30, 2026 at 8:35:49 PM UTUTC-4"},{"title":"REINFORCE with Baseline: Episode Update","category":"Machine Learning","difficulty":"hard","id":"481","createdAt":"April 30, 2026 at 8:35:49 PM UTUTC-4"},{"title":"One-step Advantage Actor-Critic","category":"Machine Learning","difficulty":"medium","id":"482","createdAt":"April 30, 2026 at 8:35:49 PM UTUTC-4"},{"title":"True Online SARSA with Eligibility Traces","category":"Reinforcement Learning","difficulty":"hard","id":"483","createdAt":"April 30, 2026 at 8:35:49 PM UTUTC-4"},{"title":"Reward Model Loss from Pairwise Human Preferences","category":"Reinforcement Learning","difficulty":"medium","id":"484","createdAt":"March 26, 2026 at 2:33:45 PM UTUTC-4"},{"title":"PPO Clipped Surrogate Loss with Clip Diagnostics","category":"Reinforcement Learning","difficulty":"medium","id":"485","createdAt":"March 26, 2026 at 2:33:45 PM UTUTC-4"},{"title":"Adaptive KL-Penalized Reward Shaping for RLHF","category":"Machine Learning","difficulty":"medium","id":"486","createdAt":"March 26, 2026 at 2:33:45 PM UTUTC-4"},{"title":"Compute GAE Advantages with Episode Boundaries","category":"Reinforcement Learning","difficulty":"medium","id":"487","createdAt":"March 26, 2026 at 2:33:45 PM UTUTC-4"},{"title":"Reward Model Validation Accuracy","category":"Reinforcement Learning","difficulty":"easy","id":"488","createdAt":"March 26, 2026 at 2:33:45 PM UTUTC-4"},{"title":"Log-Probability Ratio for Token Sequences","category":"Reinforcement Learning","difficulty":"medium","id":"489","createdAt":"March 26, 2026 at 2:33:45 PM UTUTC-4"},{"title":"Implement Adam Optimization Algorithm","category":"Deep Learning","difficulty":"medium","id":"49","createdAt":null},{"title":"Build Scaled Dot-Product Attention","category":"Deep Learning","difficulty":"medium","id":"490","createdAt":"March 29, 2026 at 9:02:10 AM UTUTC-4"},{"title":"Build a Transformer Encoder Layer","category":"Deep Learning","difficulty":"hard","id":"491","createdAt":"March 29, 2026 at 9:02:10 AM UTUTC-4"},{"title":"Implementing PagedAttention: Block-wise Attention Computation","category":"Deep Learning","difficulty":"hard","id":"492","createdAt":"March 29, 2026 at 10:30:01 AM UTUTC-4"},{"title":"Building a Virtual Memory System for KV Cache","category":"Deep Learning","difficulty":"medium","id":"493","createdAt":"March 29, 2026 at 10:30:01 AM UTUTC-4"},{"title":"Copy-on-Write Memory Sharing for LLM Sampling","category":"Deep Learning","difficulty":"medium","id":"494","createdAt":"March 29, 2026 at 10:30:01 AM UTUTC-4"},{"title":"Analyzing Memory Fragmentation in LLM Serving","category":"Deep Learning","difficulty":"easy","id":"495","createdAt":"March 29, 2026 at 10:30:01 AM UTUTC-4"},{"title":"Beam Search with Memory-Efficient Block Sharing","category":"NLP","difficulty":"hard","id":"496","createdAt":"March 29, 2026 at 10:30:01 AM UTUTC-4"},{"title":"Preemption Strategies: Swapping vs Recomputation","category":"Deep Learning","difficulty":"medium","id":"497","createdAt":"March 29, 2026 at 10:30:01 AM UTUTC-4"},{"title":"Implementing a Kinematic Vehicle Model for Autonomous Driving","category":"Computer Vision","difficulty":"medium","id":"498","createdAt":"April 5, 2026 at 11:17:43 PM UTUTC-4"},{"title":"Novel View Synthesis with Depth Reprojection","category":"Computer Vision","difficulty":"medium","id":"499","createdAt":"April 5, 2026 at 11:17:43 PM UTUTC-4"},{"title":"Scalar Multiplication of a Matrix","category":"Linear Algebra","difficulty":"easy","id":"5","createdAt":null},{"title":"Implement Lasso Regression using ISTA","category":"Machine Learning","difficulty":"medium","id":"50","createdAt":"January 18, 2026 at 12:32:08 PM UTC-0500"},{"title":"Training a Rectified Flow Diffusion Model","category":"Deep Learning","difficulty":"hard","id":"500","createdAt":"April 5, 2026 at 11:17:43 PM UTUTC-4"},{"title":"Sequential Video Generation with Diffusion Models","category":"Deep Learning","difficulty":"hard","id":"501","createdAt":"April 5, 2026 at 11:17:43 PM UTUTC-4"},{"title":"Multi-Hypothesis Trajectory Prediction","category":"Deep Learning","difficulty":"medium","id":"502","createdAt":"April 5, 2026 at 11:17:43 PM UTUTC-4"},{"title":"Regularization via Information Bottleneck","category":"Deep Learning","difficulty":"easy","id":"503","createdAt":"April 5, 2026 at 11:17:43 PM UTUTC-4"},{"title":"Distributed On-Policy Reinforcement Learning","category":"Deep Learning","difficulty":"hard","id":"504","createdAt":"April 5, 2026 at 11:17:43 PM UTUTC-4"},{"title":"Computing Optimal Model Size with Scaling Laws","category":"Deep Learning","difficulty":"medium","id":"505","createdAt":"April 6, 2026 at 9:05:31 AM UTUTC-4"},{"title":"Designing 4D Parallelism for Large Model Training","category":"Deep Learning","difficulty":"hard","id":"506","createdAt":"April 6, 2026 at 9:05:31 AM UTUTC-4"},{"title":"Detecting Benchmark Contamination in Training Data","category":"NLP","difficulty":"medium","id":"507","createdAt":"April 6, 2026 at 9:05:31 AM UTUTC-4"},{"title":"Quality Filtering with Rejection Sampling","category":"Machine Learning","difficulty":"easy","id":"508","createdAt":"April 6, 2026 at 9:05:31 AM UTUTC-4"},{"title":"Optimistic Initialization for Exploration","category":"Reinforcement Learning","difficulty":"easy","id":"509","createdAt":"April 6, 2026 at 2:58:35 PM UTUTC-4"},{"title":"Optimal String Alignment Distance","category":"NLP","difficulty":"medium","id":"51","createdAt":null},{"title":"Markov Decision Process Simulator","category":"Reinforcement Learning","difficulty":"medium","id":"510","createdAt":"April 6, 2026 at 2:58:35 PM UTUTC-4"},{"title":"Greedy Policy Improvement","category":"Reinforcement Learning","difficulty":"medium","id":"511","createdAt":"April 6, 2026 at 2:58:35 PM UTUTC-4"},{"title":"Every-Visit Monte Carlo Prediction","category":"Reinforcement Learning","difficulty":"medium","id":"512","createdAt":"April 6, 2026 at 2:58:35 PM UTUTC-4"},{"title":"Blackjack with Monte Carlo Prediction","category":"Reinforcement Learning","difficulty":"medium","id":"513","createdAt":"April 6, 2026 at 2:58:35 PM UTUTC-4"},{"title":"Random Walk: TD vs Monte Carlo","category":"Reinforcement Learning","difficulty":"medium","id":"514","createdAt":"April 6, 2026 at 2:58:35 PM UTUTC-4"},{"title":"Batch Training: TD and MC Comparison","category":"Reinforcement Learning","difficulty":"medium","id":"515","createdAt":"April 6, 2026 at 2:58:35 PM UTUTC-4"},{"title":"Certainty-Equivalence in TD Learning","category":"Reinforcement Learning","difficulty":"hard","id":"516","createdAt":"April 6, 2026 at 2:58:35 PM UTUTC-4"},{"title":"Windy Gridworld with Sarsa","category":"Reinforcement Learning","difficulty":"medium","id":"517","createdAt":"April 6, 2026 at 2:58:35 PM UTUTC-4"},{"title":"Cliff Walking: Sarsa vs Q-Learning","category":"Reinforcement Learning","difficulty":"medium","id":"518","createdAt":"April 6, 2026 at 2:58:35 PM UTUTC-4"},{"title":"Lambda-Return Computation","category":"Reinforcement Learning","difficulty":"hard","id":"519","createdAt":"April 6, 2026 at 2:58:35 PM UTUTC-4"},{"title":"Implement Recall Metric in Binary Classification","category":"Machine Learning","difficulty":"easy","id":"52","createdAt":"January 23, 2026 at 3:56:58 PM UTC-0500"},{"title":"TD(λ) Forward View for Value Prediction","category":"Reinforcement Learning","difficulty":"hard","id":"520","createdAt":"April 6, 2026 at 2:58:35 PM UTUTC-4"},{"title":"Sarsa(lambda) Algorithm with Eligibility Traces","category":"Reinforcement Learning","difficulty":"hard","id":"521","createdAt":"April 6, 2026 at 2:58:35 PM UTUTC-4"},{"title":"Q(lambda) with Eligibility Traces","category":"Reinforcement Learning","difficulty":"hard","id":"522","createdAt":"April 6, 2026 at 2:58:35 PM UTUTC-4"},{"title":"Types of Eligibility Traces","category":"Reinforcement Learning","difficulty":"medium","id":"523","createdAt":"April 6, 2026 at 2:58:35 PM UTUTC-4"},{"title":"Dyna-Q: Model-Based RL with Planning","category":"Reinforcement Learning","difficulty":"hard","id":"524","createdAt":"April 6, 2026 at 2:58:35 PM UTUTC-4"},{"title":"Learning a Tabular Environment Model from Experience","category":"Reinforcement Learning","difficulty":"medium","id":"525","createdAt":"April 6, 2026 at 2:58:35 PM UTUTC-4"},{"title":"Planning with Simulated Experience","category":"Reinforcement Learning","difficulty":"medium","id":"526","createdAt":"April 6, 2026 at 2:58:35 PM UTUTC-4"},{"title":"Prioritized Sweeping Algorithm","category":"Reinforcement Learning","difficulty":"hard","id":"527","createdAt":"April 6, 2026 at 2:58:35 PM UTUTC-4"},{"title":"Priority Queue in Planning","category":"Reinforcement Learning","difficulty":"medium","id":"528","createdAt":"April 6, 2026 at 2:58:35 PM UTUTC-4"},{"title":"On-Policy Trajectory Sampling","category":"Reinforcement Learning","difficulty":"medium","id":"529","createdAt":"April 6, 2026 at 2:58:35 PM UTUTC-4"},{"title":"Implement Self-Attention Mechanism","category":"Deep Learning","difficulty":"medium","id":"53","createdAt":"January 26, 2026 at 8:38:26 AM UTC-0500"},{"title":"Linear Value Function Approximation with Semi-Gradient TD(0)","category":"Reinforcement Learning","difficulty":"medium","id":"530","createdAt":"April 6, 2026 at 2:58:35 PM UTUTC-4"},{"title":"Semi-Gradient TD(lambda) with Eligibility Traces and Linear Function Approximation","category":"Reinforcement Learning","difficulty":"hard","id":"531","createdAt":"April 6, 2026 at 2:58:35 PM UTUTC-4"},{"title":"Coarse Coding Features","category":"Reinforcement Learning","difficulty":"medium","id":"532","createdAt":"April 6, 2026 at 2:58:35 PM UTUTC-4"},{"title":"Tile Coding Implementation","category":"Reinforcement Learning","difficulty":"medium","id":"533","createdAt":"April 6, 2026 at 2:58:35 PM UTUTC-4"},{"title":"Linear Sarsa Algorithm","category":"Reinforcement Learning","difficulty":"hard","id":"534","createdAt":"April 6, 2026 at 2:58:35 PM UTUTC-4"},{"title":"Mountain Car with Function Approximation","category":"Reinforcement Learning","difficulty":"medium","id":"535","createdAt":"April 6, 2026 at 2:58:35 PM UTUTC-4"},{"title":"Least-Squares Temporal Difference (LSTD) for Policy Evaluation","category":"Reinforcement Learning","difficulty":"hard","id":"536","createdAt":"April 6, 2026 at 2:58:35 PM UTUTC-4"},{"title":"Experience Replay Implementation","category":"Reinforcement Learning","difficulty":"medium","id":"537","createdAt":"April 6, 2026 at 2:58:35 PM UTUTC-4"},{"title":"Actor-Critic Algorithm","category":"Reinforcement Learning","difficulty":"hard","id":"538","createdAt":"April 6, 2026 at 2:58:35 PM UTUTC-4"},{"title":"Actor-Critic with Traces","category":"Reinforcement Learning","difficulty":"hard","id":"539","createdAt":"April 6, 2026 at 2:58:35 PM UTUTC-4"},{"title":"Implementing a Simple RNN","category":"Deep Learning","difficulty":"medium","id":"54","createdAt":"January 21, 2026 at 3:21:20 PM UTC-0500"},{"title":"R-Learning for Average Reward","category":"Reinforcement Learning","difficulty":"hard","id":"540","createdAt":"April 6, 2026 at 2:58:35 PM UTUTC-4"},{"title":"Differential Sarsa Algorithm","category":"Reinforcement Learning","difficulty":"hard","id":"541","createdAt":"April 6, 2026 at 2:58:35 PM UTUTC-4"},{"title":"Build a Multi-Armed Bandit Testbed","category":"Reinforcement Learning","difficulty":"easy","id":"542","createdAt":"April 7, 2026 at 6:57:06 AM UTUTC-4"},{"title":"Estimate Action Values Using Sample Averaging","category":"Reinforcement Learning","difficulty":"easy","id":"543","createdAt":"April 7, 2026 at 6:57:06 AM UTUTC-4"},{"title":"Comprehensive Bandit Algorithm Comparison","category":"Reinforcement Learning","difficulty":"medium","id":"544","createdAt":"April 7, 2026 at 6:57:06 AM UTUTC-4"},{"title":"Compare Update Strategies in Policy Evaluation","category":"Reinforcement Learning","difficulty":"easy","id":"545","createdAt":"April 7, 2026 at 6:57:06 AM UTUTC-4"},{"title":"Policy Iteration on Jack's Car Rental","category":"Reinforcement Learning","difficulty":"hard","id":"546","createdAt":"April 7, 2026 at 8:31:16 AM UTUTC-4"},{"title":"Monte Carlo Q-Value Estimation","category":"Reinforcement Learning","difficulty":"medium","id":"547","createdAt":"April 7, 2026 at 8:31:16 AM UTUTC-4"},{"title":"n-Step Sarsa Algorithm","category":"Reinforcement Learning","difficulty":"medium","id":"548","createdAt":"April 7, 2026 at 8:31:16 AM UTUTC-4"},{"title":"Off-Policy n-Step TD Prediction with Importance Sampling","category":"Reinforcement Learning","difficulty":"hard","id":"549","createdAt":"April 7, 2026 at 10:41:43 AM UTUTC-4"},{"title":"2D Translation Matrix Implementation","category":"Linear Algebra","difficulty":"medium","id":"55","createdAt":null},{"title":"Gradient Monte Carlo Algorithm","category":"Reinforcement Learning","difficulty":"medium","id":"550","createdAt":"April 7, 2026 at 10:41:43 AM UTUTC-4"},{"title":"Deep Q-Network Implementation","category":"Deep Learning","difficulty":"hard","id":"551","createdAt":"April 7, 2026 at 10:41:43 AM UTUTC-4"},{"title":"REINFORCE with Value Baseline","category":"Reinforcement Learning","difficulty":"hard","id":"552","createdAt":"April 7, 2026 at 3:39:15 PM UTUTC-4"},{"title":"Advantage Actor-Critic (A2C) Batch Update from Parallel Environments","category":"Reinforcement Learning","difficulty":"hard","id":"553","createdAt":"April 7, 2026 at 3:39:15 PM UTUTC-4"},{"title":"Unified Task Handler for Multi-Task RL Agent","category":"Reinforcement Learning","difficulty":"easy","id":"554","createdAt":"April 7, 2026 at 3:39:15 PM UTUTC-4"},{"title":"State Aggregation for Value Approximation","category":"Reinforcement Learning","difficulty":"easy","id":"555","createdAt":"April 10, 2026 at 9:48:56 AM UTUTC-4"},{"title":"Instability in the Deadly Triad","category":"Reinforcement Learning","difficulty":"medium","id":"556","createdAt":"April 10, 2026 at 9:48:56 AM UTUTC-4"},{"title":"Baird's Counterexample: Off-Policy TD Divergence","category":"Reinforcement Learning","difficulty":"medium","id":"557","createdAt":"April 10, 2026 at 9:48:56 AM UTUTC-4"},{"title":"Compute RL Backup Operations for Value Functions","category":"Reinforcement Learning","difficulty":"easy","id":"558","createdAt":"April 10, 2026 at 9:48:56 AM UTUTC-4"},{"title":"Per-Decision Importance Sampling for Off-Policy Evaluation","category":"Reinforcement Learning","difficulty":"medium","id":"559","createdAt":"April 10, 2026 at 9:48:56 AM UTUTC-4"},{"title":"KL Divergence Between Two Normal Distributions","category":"Deep Learning","difficulty":"easy","id":"56","createdAt":null},{"title":"Maximization Bias Experiment","category":"Reinforcement Learning","difficulty":"medium","id":"560","createdAt":"April 10, 2026 at 9:52:36 AM UTUTC-4"},{"title":"True Online TD(λ) with Linear Function Approximation","category":"Reinforcement Learning","difficulty":"hard","id":"561","createdAt":"April 10, 2026 at 9:52:36 AM UTUTC-4"},{"title":"n-Step Sarsa for Control","category":"Reinforcement Learning","difficulty":"medium","id":"562","createdAt":"April 10, 2026 at 9:52:36 AM UTUTC-4"},{"title":"Off-Policy n-Step Sarsa with Importance Sampling","category":"Reinforcement Learning","difficulty":"hard","id":"563","createdAt":"April 10, 2026 at 9:52:36 AM UTUTC-4"},{"title":"Dyna-Q+ with Exploration Bonus","category":"Reinforcement Learning","difficulty":"medium","id":"564","createdAt":"April 10, 2026 at 9:52:36 AM UTUTC-4"},{"title":"Blocking Maze Environment for Testing Dyna-Q+","category":"Reinforcement Learning","difficulty":"medium","id":"565","createdAt":"April 10, 2026 at 9:52:36 AM UTUTC-4"},{"title":"Expected vs Sample Updates Comparison","category":"Reinforcement Learning","difficulty":"medium","id":"566","createdAt":"April 10, 2026 at 9:52:36 AM UTUTC-4"},{"title":"Gradient Temporal Difference (GTD2) for Off-Policy Value Prediction","category":"Reinforcement Learning","difficulty":"hard","id":"567","createdAt":"April 10, 2026 at 9:52:36 AM UTUTC-4"},{"title":"Emphatic Temporal Difference Learning for Off-Policy Evaluation","category":"Reinforcement Learning","difficulty":"hard","id":"568","createdAt":"April 10, 2026 at 9:52:36 AM UTUTC-4"},{"title":"Natural Policy Gradient","category":"Reinforcement Learning","difficulty":"hard","id":"569","createdAt":"April 10, 2026 at 9:52:36 AM UTUTC-4"},{"title":"Gauss-Seidel Method for Solving Linear Systems","category":"Linear Algebra","difficulty":"medium","id":"57","createdAt":"January 26, 2026 at 8:55:33 AM UTC-0500"},{"title":"Gaussian Policy for Continuous Control","category":"Reinforcement Learning","difficulty":"medium","id":"570","createdAt":"April 10, 2026 at 9:52:36 AM UTUTC-4"},{"title":"Afterstate Value Functions","category":"Reinforcement Learning","difficulty":"medium","id":"571","createdAt":"April 10, 2026 at 9:52:36 AM UTUTC-4"},{"title":"Learn Tic-Tac-Toe with TD","category":"Reinforcement Learning","difficulty":"medium","id":"572","createdAt":"April 10, 2026 at 9:52:36 AM UTUTC-4"},{"title":"Fourier Basis Features for Value Function Approximation","category":"Machine Learning","difficulty":"medium","id":"573","createdAt":"April 10, 2026 at 9:52:36 AM UTUTC-4"},{"title":"Acrobot Swing-Up Problem","category":"Reinforcement Learning","difficulty":"hard","id":"574","createdAt":"April 10, 2026 at 9:52:36 AM UTUTC-4"},{"title":"Cart-Pole Balancing with Linear Policy Simulation","category":"Reinforcement Learning","difficulty":"medium","id":"575","createdAt":"April 10, 2026 at 9:52:36 AM UTUTC-4"},{"title":"Access-Control Queuing with R-Learning","category":"Reinforcement Learning","difficulty":"medium","id":"576","createdAt":"April 10, 2026 at 9:52:36 AM UTUTC-4"},{"title":"Residual Gradient Algorithm for Value Function Approximation","category":"Reinforcement Learning","difficulty":"hard","id":"577","createdAt":"April 10, 2026 at 9:52:36 AM UTUTC-4"},{"title":"Fitted Value Iteration","category":"Reinforcement Learning","difficulty":"medium","id":"578","createdAt":"April 10, 2026 at 9:52:36 AM UTUTC-4"},{"title":"Backgammon with TD Learning","category":"Reinforcement Learning","difficulty":"hard","id":"579","createdAt":"April 10, 2026 at 9:52:36 AM UTUTC-4"},{"title":"Gaussian Elimination for Solving Linear Systems","category":"Linear Algebra","difficulty":"medium","id":"58","createdAt":null},{"title":"Off-Policy TD(lambda) with Importance-Weighted Eligibility Traces","category":"Reinforcement Learning","difficulty":"hard","id":"580","createdAt":"April 10, 2026 at 9:52:36 AM UTUTC-4"},{"title":"n-Step Tree Backup Algorithm","category":"Reinforcement Learning","difficulty":"hard","id":"581","createdAt":"April 10, 2026 at 9:52:36 AM UTUTC-4"},{"title":"Retrace(λ) Implementation","category":"Reinforcement Learning","difficulty":"hard","id":"582","createdAt":"April 10, 2026 at 9:52:36 AM UTUTC-4"},{"title":"Q(σ) Unified Algorithm","category":"Reinforcement Learning","difficulty":"hard","id":"583","createdAt":"April 10, 2026 at 9:52:36 AM UTUTC-4"},{"title":"Control Variates in Off-Policy Methods","category":"Reinforcement Learning","difficulty":"hard","id":"584","createdAt":"April 10, 2026 at 9:52:36 AM UTUTC-4"},{"title":"Parallel Value Functions (Horde)","category":"Reinforcement Learning","difficulty":"hard","id":"585","createdAt":"April 10, 2026 at 9:52:36 AM UTUTC-4"},{"title":"General Value Functions","category":"Reinforcement Learning","difficulty":"medium","id":"586","createdAt":"April 10, 2026 at 9:52:36 AM UTUTC-4"},{"title":"Temporal Abstraction with Options","category":"Reinforcement Learning","difficulty":"hard","id":"587","createdAt":"April 10, 2026 at 9:52:36 AM UTUTC-4"},{"title":"Value Functions for Options","category":"Reinforcement Learning","difficulty":"hard","id":"588","createdAt":"April 10, 2026 at 9:52:36 AM UTUTC-4"},{"title":"Deterministic Policy Gradient","category":"Reinforcement Learning","difficulty":"hard","id":"589","createdAt":"April 10, 2026 at 9:52:36 AM UTUTC-4"},{"title":"Implement Long Short-Term Memory (LSTM) Network","category":"Deep Learning","difficulty":"medium","id":"59","createdAt":null},{"title":"Target Network Update for Stable Learning","category":"Deep Learning","difficulty":"easy","id":"590","createdAt":"April 10, 2026 at 9:52:36 AM UTUTC-4"},{"title":"Prioritized Experience Replay","category":"Deep Learning","difficulty":"medium","id":"591","createdAt":"April 10, 2026 at 9:52:36 AM UTUTC-4"},{"title":"Dueling Network Architecture","category":"Deep Learning","difficulty":"medium","id":"592","createdAt":"April 10, 2026 at 9:52:36 AM UTUTC-4"},{"title":"Rainbow DQN Implementation","category":"Reinforcement Learning","difficulty":"hard","id":"593","createdAt":"April 10, 2026 at 9:52:36 AM UTUTC-4"},{"title":"Asynchronous Advantage Actor-Critic (A3C)","category":"Reinforcement Learning","difficulty":"hard","id":"594","createdAt":"April 10, 2026 at 9:52:36 AM UTUTC-4"},{"title":"Trust Region Policy Optimization (TRPO)","category":"Reinforcement Learning","difficulty":"hard","id":"595","createdAt":"April 10, 2026 at 9:52:36 AM UTUTC-4"},{"title":"Distributional RL: Categorical Projection (C51)","category":"Reinforcement Learning","difficulty":"hard","id":"596","createdAt":"April 10, 2026 at 9:52:36 AM UTUTC-4"},{"title":"Successor Representation Learning","category":"Reinforcement Learning","difficulty":"hard","id":"597","createdAt":"April 10, 2026 at 9:52:36 AM UTUTC-4"},{"title":"Model-Based Value Expansion","category":"Reinforcement Learning","difficulty":"hard","id":"598","createdAt":"April 10, 2026 at 9:52:36 AM UTUTC-4"},{"title":"Full vs Sample Backup Comparison","category":"Reinforcement Learning","difficulty":"medium","id":"599","createdAt":"April 10, 2026 at 9:52:36 AM UTUTC-4"},{"title":"Calculate Eigenvalues of a Matrix","category":"Linear Algebra","difficulty":"medium","id":"6","createdAt":"January 26, 2026 at 9:26:25 AM UTC-0500"},{"title":"Implement TF-IDF (Term Frequency-Inverse Document Frequency)","category":"NLP","difficulty":"medium","id":"60","createdAt":null},{"title":"Kanerva Coding for High-Dimensional Spaces","category":"Reinforcement Learning","difficulty":"hard","id":"600","createdAt":"April 10, 2026 at 9:52:36 AM UTUTC-4"},{"title":"Hashing for Memory-Efficient Tile Coding","category":"Reinforcement Learning","difficulty":"hard","id":"601","createdAt":"April 10, 2026 at 9:52:36 AM UTUTC-4"},{"title":"TD(λ) Asymptotic Error Bound Verification","category":"Reinforcement Learning","difficulty":"hard","id":"602","createdAt":"April 10, 2026 at 9:52:36 AM UTUTC-4"},{"title":"Action-Conditional Trace Clearing","category":"Reinforcement Learning","difficulty":"medium","id":"603","createdAt":"April 10, 2026 at 9:52:36 AM UTUTC-4"},{"title":"Bootstrap Parameter Lambda Study","category":"Reinforcement Learning","difficulty":"medium","id":"604","createdAt":"April 10, 2026 at 9:52:36 AM UTUTC-4"},{"title":"Tiling Offset Strategy Comparison","category":"Reinforcement Learning","difficulty":"medium","id":"605","createdAt":"April 10, 2026 at 9:52:36 AM UTUTC-4"},{"title":"Directional Stripe Tilings","category":"Reinforcement Learning","difficulty":"medium","id":"606","createdAt":"April 10, 2026 at 9:52:36 AM UTUTC-4"},{"title":"Feature Density and Approximation Quality","category":"Reinforcement Learning","difficulty":"medium","id":"607","createdAt":"April 10, 2026 at 9:52:36 AM UTUTC-4"},{"title":"Step-Size Selection for Tile Coding","category":"Reinforcement Learning","difficulty":"easy","id":"608","createdAt":"April 10, 2026 at 9:52:36 AM UTUTC-4"},{"title":"Efficient Gradient Computation for Binary Features","category":"Reinforcement Learning","difficulty":"easy","id":"609","createdAt":"April 10, 2026 at 9:52:36 AM UTUTC-4"},{"title":"Implement F-Score Calculation for Binary Classification","category":"Machine Learning","difficulty":"easy","id":"61","createdAt":null},{"title":"Branching Factor Impact on Sample Backups","category":"Reinforcement Learning","difficulty":"medium","id":"610","createdAt":"April 10, 2026 at 9:52:36 AM UTUTC-4"},{"title":"Feature Receptive Field Visualization","category":"Reinforcement Learning","difficulty":"easy","id":"611","createdAt":"April 10, 2026 at 9:52:36 AM UTUTC-4"},{"title":"Value Generalization Pattern Analysis","category":"Reinforcement Learning","difficulty":"medium","id":"612","createdAt":"April 10, 2026 at 9:52:36 AM UTUTC-4"},{"title":"RL Backup Diagram Generator","category":"Reinforcement Learning","difficulty":"medium","id":"613","createdAt":"April 10, 2026 at 9:52:36 AM UTUTC-4"},{"title":"Blocking Maze with Model Updates","category":"Reinforcement Learning","difficulty":"hard","id":"614","createdAt":"April 10, 2026 at 9:52:36 AM UTUTC-4"},{"title":"Shortcut Maze and Exploration","category":"Reinforcement Learning","difficulty":"hard","id":"615","createdAt":"April 10, 2026 at 9:52:36 AM UTUTC-4"},{"title":"Policy Gradient with Softmax Action Selection","category":"Reinforcement Learning","difficulty":"medium","id":"616","createdAt":"April 10, 2026 at 9:52:36 AM UTUTC-4"},{"title":"Semi-Markov Q-Learning","category":"Reinforcement Learning","difficulty":"hard","id":"617","createdAt":"April 10, 2026 at 9:52:36 AM UTUTC-4"},{"title":"TD-Gammon Position Evaluation Network","category":"Reinforcement Learning","difficulty":"hard","id":"618","createdAt":"April 10, 2026 at 9:52:36 AM UTUTC-4"},{"title":"Minimax with Learned Value Function","category":"Reinforcement Learning","difficulty":"medium","id":"619","createdAt":"April 10, 2026 at 9:52:36 AM UTUTC-4"},{"title":"Implement a Simple RNN with Backpropagation Through Time (BPTT)","category":"Deep Learning","difficulty":"hard","id":"62","createdAt":null},{"title":"Acrobot Swing-Up with Sarsa(λ)","category":"Reinforcement Learning","difficulty":"hard","id":"620","createdAt":"April 10, 2026 at 9:52:36 AM UTUTC-4"},{"title":"Dynamic Channel Allocation with Afterstates","category":"Reinforcement Learning","difficulty":"hard","id":"621","createdAt":"April 10, 2026 at 9:52:36 AM UTUTC-4"},{"title":"Job-Shop Scheduling with TD Learning","category":"Reinforcement Learning","difficulty":"hard","id":"622","createdAt":"April 10, 2026 at 9:52:36 AM UTUTC-4"},{"title":"Resource Dilation Factor for Scheduling","category":"Reinforcement Learning","difficulty":"medium","id":"623","createdAt":"April 10, 2026 at 9:52:36 AM UTUTC-4"},{"title":"TDNN for Variable-Length Sequences","category":"Deep Learning","difficulty":"hard","id":"624","createdAt":"April 10, 2026 at 9:52:36 AM UTUTC-4"},{"title":"Forward vs Backward TD Updates","category":"Reinforcement Learning","difficulty":"medium","id":"625","createdAt":"April 10, 2026 at 9:52:36 AM UTUTC-4"},{"title":"Off-line vs On-line TD(0) Prediction","category":"Reinforcement Learning","difficulty":"easy","id":"626","createdAt":"April 10, 2026 at 9:52:36 AM UTUTC-4"},{"title":"Backgammon Feature Engineering","category":"Reinforcement Learning","difficulty":"medium","id":"627","createdAt":"April 10, 2026 at 9:52:36 AM UTUTC-4"},{"title":"Two-Ply Search with Value Function","category":"Reinforcement Learning","difficulty":"medium","id":"628","createdAt":"April 10, 2026 at 9:52:36 AM UTUTC-4"},{"title":"Self-Play Training Loop for Two-Player Games","category":"Reinforcement Learning","difficulty":"medium","id":"629","createdAt":"April 10, 2026 at 9:52:36 AM UTUTC-4"},{"title":"Implement the Conjugate Gradient Method for Solving Linear Systems","category":"Linear Algebra","difficulty":"hard","id":"63","createdAt":null},{"title":"Rote Learning for Game States","category":"Reinforcement Learning","difficulty":"easy","id":"630","createdAt":"April 10, 2026 at 9:52:36 AM UTUTC-4"},{"title":"Minimax Backed-Up Scores","category":"Reinforcement Learning","difficulty":"medium","id":"631","createdAt":"April 10, 2026 at 9:52:36 AM UTUTC-4"},{"title":"Alpha-Beta Pruning Implementation","category":"Algorithms","difficulty":"medium","id":"632","createdAt":"April 10, 2026 at 9:52:36 AM UTUTC-4"},{"title":"Signature Tables for Value Functions","category":"Reinforcement Learning","difficulty":"medium","id":"633","createdAt":"April 10, 2026 at 9:52:36 AM UTUTC-4"},{"title":"Semi-Markov Decision Process Simulation","category":"Reinforcement Learning","difficulty":"medium","id":"634","createdAt":"April 10, 2026 at 9:52:36 AM UTUTC-4"},{"title":"Feature Engineering for Channel Allocation","category":"Reinforcement Learning","difficulty":"medium","id":"635","createdAt":"April 10, 2026 at 9:52:36 AM UTUTC-4"},{"title":"Iterative Repair for Scheduling","category":"Optimization","difficulty":"medium","id":"636","createdAt":"April 10, 2026 at 9:52:36 AM UTUTC-4"},{"title":"Critical Path Method for Scheduling","category":"Algorithms","difficulty":"medium","id":"637","createdAt":"April 10, 2026 at 9:52:36 AM UTUTC-4"},{"title":"Random Sample Greedy Search","category":"Reinforcement Learning","difficulty":"medium","id":"638","createdAt":"April 10, 2026 at 9:52:36 AM UTUTC-4"},{"title":"Error-Dependent Multiple Weight Updates","category":"Reinforcement Learning","difficulty":"medium","id":"639","createdAt":"April 10, 2026 at 9:52:36 AM UTUTC-4"},{"title":"Implement Gini Impurity Calculation for a Set of Classes","category":"Machine Learning","difficulty":"easy","id":"64","createdAt":null},{"title":"Ply-Based Value Discounting","category":"Reinforcement Learning","difficulty":"easy","id":"640","createdAt":"April 10, 2026 at 9:52:36 AM UTUTC-4"},{"title":"Gibbs Softmax Action Selection","category":"Reinforcement Learning","difficulty":"easy","id":"641","createdAt":"April 10, 2026 at 9:52:36 AM UTUTC-4"},{"title":"Continuous-Time Discounting","category":"Reinforcement Learning","difficulty":"medium","id":"642","createdAt":"April 10, 2026 at 9:52:36 AM UTUTC-4"},{"title":"TD Error Backpropagation in Networks","category":"Deep Learning","difficulty":"medium","id":"643","createdAt":"April 10, 2026 at 9:52:36 AM UTUTC-4"},{"title":"Hash Function for Tile Coding","category":"Algorithms","difficulty":"medium","id":"644","createdAt":"April 10, 2026 at 9:52:36 AM UTUTC-4"},{"title":"RBF Center Placement Strategies","category":"Machine Learning","difficulty":"medium","id":"645","createdAt":"April 10, 2026 at 9:52:36 AM UTUTC-4"},{"title":"Sparse Distributed Memory","category":"Machine Learning","difficulty":"hard","id":"646","createdAt":"April 10, 2026 at 9:52:36 AM UTUTC-4"},{"title":"Hamming Distance for Kanerva Coding","category":"Algorithms","difficulty":"easy","id":"647","createdAt":"April 10, 2026 at 9:52:36 AM UTUTC-4"},{"title":"TD(λ) Convergence Verification","category":"Reinforcement Learning","difficulty":"hard","id":"648","createdAt":"April 10, 2026 at 9:52:36 AM UTUTC-4"},{"title":"Bellman Error Minimization with Linear Function Approximation","category":"Reinforcement Learning","difficulty":"hard","id":"649","createdAt":"April 10, 2026 at 9:52:36 AM UTUTC-4"},{"title":"Implement Compressed Row Sparse Matrix (CSR) Format Conversion","category":"Linear Algebra","difficulty":"easy","id":"65","createdAt":null},{"title":"Variance Reduction in TD Learning via Truncated Importance Sampling","category":"Reinforcement Learning","difficulty":"hard","id":"650","createdAt":"April 10, 2026 at 9:52:36 AM UTUTC-4"},{"title":"Feature Selection for RL Value Function Approximation","category":"Machine Learning","difficulty":"medium","id":"651","createdAt":"April 10, 2026 at 9:52:36 AM UTUTC-4"},{"title":"Intra-Option Q-Learning for Temporal Abstraction","category":"Reinforcement Learning","difficulty":"hard","id":"652","createdAt":"April 10, 2026 at 9:52:36 AM UTUTC-4"},{"title":"Hierarchical Value Functions","category":"Reinforcement Learning","difficulty":"medium","id":"653","createdAt":"April 10, 2026 at 9:52:36 AM UTUTC-4"},{"title":"Flatten and Unflatten Hierarchical Gym Spaces","category":"Reinforcement Learning","difficulty":"medium","id":"654","createdAt":"April 12, 2026 at 9:21:36 AM UTUTC-4"},{"title":"Parallel Environment Simulation with Multiprocessing","category":"Reinforcement Learning","difficulty":"hard","id":"655","createdAt":"April 12, 2026 at 9:21:36 AM UTUTC-4"},{"title":"EnvPool-style Asynchronous Environment Pooling","category":"Reinforcement Learning","difficulty":"hard","id":"656","createdAt":"April 12, 2026 at 9:21:36 AM UTUTC-4"},{"title":"Shared Memory IPC for RL Environments","category":"Systems Programming","difficulty":"medium","id":"657","createdAt":"April 12, 2026 at 9:21:36 AM UTUTC-4"},{"title":"Lock-Free Synchronization with Shared Flags","category":"Systems Programming","difficulty":"medium","id":"658","createdAt":"April 12, 2026 at 9:21:36 AM UTUTC-4"},{"title":"Zero-Copy Batch Data Loading from Shared Memory","category":"Performance Optimization","difficulty":"medium","id":"659","createdAt":"April 12, 2026 at 9:21:36 AM UTUTC-4"},{"title":"Implement Orthogonal Projection of a Vector onto a Line","category":"Linear Algebra","difficulty":"easy","id":"66","createdAt":null},{"title":"Multi-Environment Worker Process Management","category":"Reinforcement Learning","difficulty":"medium","id":"660","createdAt":"April 12, 2026 at 9:21:36 AM UTUTC-4"},{"title":"Runtime Gym Space Validation","category":"Reinforcement Learning","difficulty":"easy","id":"661","createdAt":"April 12, 2026 at 9:21:36 AM UTUTC-4"},{"title":"Variable Population Multi-Agent Padding","category":"Reinforcement Learning","difficulty":"medium","id":"662","createdAt":"April 12, 2026 at 9:21:36 AM UTUTC-4"},{"title":"Multi-Agent Data Canonicalization","category":"Reinforcement Learning","difficulty":"easy","id":"663","createdAt":"April 12, 2026 at 9:21:36 AM UTUTC-4"},{"title":"Asynchronous PPO Training Pipeline","category":"Reinforcement Learning","difficulty":"hard","id":"664","createdAt":"April 12, 2026 at 9:21:36 AM UTUTC-4"},{"title":"Episodic Info Dictionary Aggregation","category":"Reinforcement Learning","difficulty":"easy","id":"665","createdAt":"April 12, 2026 at 9:21:36 AM UTUTC-4"},{"title":"Environment Vectorization Auto-Configuration","category":"Performance Optimization","difficulty":"medium","id":"666","createdAt":"April 12, 2026 at 9:21:36 AM UTUTC-4"},{"title":"Gym/Gymnasium API Migration Layer","category":"Reinforcement Learning","difficulty":"easy","id":"667","createdAt":"April 12, 2026 at 9:21:36 AM UTUTC-4"},{"title":"Hierarchical Action Space Flattening","category":"Reinforcement Learning","difficulty":"medium","id":"668","createdAt":"April 12, 2026 at 9:21:36 AM UTUTC-4"},{"title":"RL Algorithm Sanity Check Environments","category":"Reinforcement Learning","difficulty":"medium","id":"669","createdAt":"April 12, 2026 at 9:21:36 AM UTUTC-4"},{"title":"Implement Compressed Column Sparse Matrix Format (CSC)","category":"Linear Algebra","difficulty":"easy","id":"67","createdAt":null},{"title":"Zero-Copy C Environment Implementation","category":"Systems Programming","difficulty":"hard","id":"670","createdAt":"April 12, 2026 at 9:21:36 AM UTUTC-4"},{"title":"IPC Methods Performance Comparison","category":"Performance Optimization","difficulty":"easy","id":"671","createdAt":"April 12, 2026 at 9:21:36 AM UTUTC-4"},{"title":"DQN NatureCNN Architecture Analysis","category":"Deep Learning","difficulty":"easy","id":"672","createdAt":"April 12, 2026 at 9:21:36 AM UTUTC-4"},{"title":"Auto-Sized MLP from Gym Spaces","category":"Deep Learning","difficulty":"easy","id":"673","createdAt":"April 12, 2026 at 9:21:36 AM UTUTC-4"},{"title":"RL Environment Wrapper Profiling","category":"Performance Optimization","difficulty":"easy","id":"674","createdAt":"April 12, 2026 at 9:21:36 AM UTUTC-4"},{"title":"PettingZoo to Gym Environment Adapter","category":"Reinforcement Learning","difficulty":"medium","id":"675","createdAt":"April 12, 2026 at 9:21:36 AM UTUTC-4"},{"title":"Cython vs Python Performance for Array Operations","category":"Performance Optimization","difficulty":"medium","id":"676","createdAt":"April 12, 2026 at 9:21:36 AM UTUTC-4"},{"title":"Handling Variable Environment Reset Times","category":"Reinforcement Learning","difficulty":"medium","id":"677","createdAt":"April 12, 2026 at 9:21:36 AM UTUTC-4"},{"title":"RL Training GPU Utilization Tracker","category":"Performance Optimization","difficulty":"easy","id":"678","createdAt":"April 12, 2026 at 9:21:36 AM UTUTC-4"},{"title":"RL Training Experiment Tracking","category":"Machine Learning","difficulty":"easy","id":"679","createdAt":"April 12, 2026 at 9:21:36 AM UTUTC-4"},{"title":"Find the column space of a matrix","category":"Linear Algebra","difficulty":"medium","id":"68","createdAt":"January 26, 2026 at 8:26:05 AM UTC-0500"},{"title":"Shared Memory Circular Buffer for RL","category":"Data Structures","difficulty":"medium","id":"680","createdAt":"April 12, 2026 at 9:21:36 AM UTUTC-4"},{"title":"RL Experiment Configuration System","category":"Software Engineering","difficulty":"easy","id":"681","createdAt":"April 20, 2026 at 9:45:35 PM UTUTC-4"},{"title":"Behavior Cloning: Learning from Expert Demonstrations","category":"Machine Learning","difficulty":"medium","id":"682","createdAt":"April 20, 2026 at 9:45:35 PM UTUTC-4"},{"title":"Goal-Conditioned World Model with Future Anchoring","category":"Deep Learning","difficulty":"hard","id":"683","createdAt":"April 20, 2026 at 9:45:35 PM UTUTC-4"},{"title":"Adaptive Layer Normalization for Conditional Generation","category":"Deep Learning","difficulty":"medium","id":"684","createdAt":"April 20, 2026 at 9:45:35 PM UTUTC-4"},{"title":"Heteroscedastic Laplace NLL Loss for Uncertainty Estimation","category":"Machine Learning","difficulty":"medium","id":"685","createdAt":"April 20, 2026 at 9:45:35 PM UTUTC-4"},{"title":"Euler Sampling for Rectified Flow Models","category":"Deep Learning","difficulty":"medium","id":"686","createdAt":"April 20, 2026 at 9:45:35 PM UTUTC-4"},{"title":"Perceptual Image Distance from Deep Features","category":"Computer Vision","difficulty":"medium","id":"687","createdAt":"April 20, 2026 at 9:45:35 PM UTUTC-4"},{"title":"Teacher-Forced vs. Free-Running Rollout Evaluation","category":"Machine Learning","difficulty":"medium","id":"688","createdAt":"April 20, 2026 at 9:45:35 PM UTUTC-4"},{"title":"Pose Accuracy Evaluation for World Models","category":"Computer Vision","difficulty":"medium","id":"689","createdAt":"April 20, 2026 at 9:45:35 PM UTUTC-4"},{"title":"Calculate R-squared for Regression Analysis","category":"Machine Learning","difficulty":"easy","id":"69","createdAt":null},{"title":"Hybrid Vision Transformer for Multi-Task Driving Perception","category":"Computer Vision","difficulty":"hard","id":"690","createdAt":"April 20, 2026 at 9:45:35 PM UTUTC-4"},{"title":"Off-Policy vs On-Policy: Compounding Error Demonstration","category":"Machine Learning","difficulty":"medium","id":"691","createdAt":"April 20, 2026 at 9:45:35 PM UTUTC-4"},{"title":"Domain Randomization for Robust Policy Transfer","category":"Machine Learning","difficulty":"medium","id":"692","createdAt":"April 20, 2026 at 9:45:35 PM UTUTC-4"},{"title":"Closed-Loop Driving Policy Unit Tests: Lane Centering and Lane Changes","category":"Machine Learning","difficulty":"medium","id":"693","createdAt":"April 20, 2026 at 9:45:35 PM UTUTC-4"},{"title":"Multi-Signal Conditioning for Diffusion Transformers","category":"Deep Learning","difficulty":"easy","id":"694","createdAt":"April 20, 2026 at 9:45:35 PM UTUTC-4"},{"title":"Noise Model Evaluation: Commanded vs. Simulated Lateral Deviation","category":"Machine Learning","difficulty":"medium","id":"695","createdAt":"April 20, 2026 at 9:45:35 PM UTUTC-4"},{"title":"Logit-Normal Sampling for Diffusion Timesteps","category":"Deep Learning","difficulty":"easy","id":"696","createdAt":"April 20, 2026 at 9:45:35 PM UTUTC-4"},{"title":"Frame-wise Causal Attention Masking for Video Transformers","category":"Deep Learning","difficulty":"medium","id":"697","createdAt":"April 20, 2026 at 9:45:35 PM UTUTC-4"},{"title":"Weighted Multi-Task Loss for Joint Diffusion and Trajectory Learning","category":"Deep Learning","difficulty":"medium","id":"698","createdAt":"April 20, 2026 at 9:45:35 PM UTUTC-4"},{"title":"Build a VQ-VAE from Scratch","category":"Deep Learning","difficulty":"hard","id":"699","createdAt":"April 23, 2026 at 4:08:33 PM UTUTC-4"},{"title":"Matrix Transformation ","category":"Linear Algebra","difficulty":"medium","id":"7","createdAt":"January 22, 2026 at 1:07:39 PM UTC-0500"},{"title":"Calculate Image Brightness","category":"Computer Vision","difficulty":"easy","id":"70","createdAt":null},{"title":"Implement a Spatiotemporal Transformer Block","category":"Deep Learning","difficulty":"hard","id":"700","createdAt":"April 23, 2026 at 4:08:33 PM UTUTC-4"},{"title":"Unsupervised Latent Action Discovery","category":"Deep Learning","difficulty":"hard","id":"701","createdAt":"April 23, 2026 at 4:08:33 PM UTUTC-4"},{"title":"Vector Quantization with Straight-Through Gradients","category":"Deep Learning","difficulty":"medium","id":"702","createdAt":"April 23, 2026 at 4:08:33 PM UTUTC-4"},{"title":"Explore Codebook Size vs. Reconstruction Quality in Latent Action Models","category":"Machine Learning","difficulty":"medium","id":"703","createdAt":"April 23, 2026 at 4:08:33 PM UTUTC-4"},{"title":"Video Tokenizer with Spatiotemporal VQ-VAE","category":"Computer Vision","difficulty":"hard","id":"704","createdAt":"April 23, 2026 at 4:08:33 PM UTUTC-4"},{"title":"Image Patch Embedding and Reconstruction","category":"Computer Vision","difficulty":"easy","id":"705","createdAt":"April 23, 2026 at 4:08:33 PM UTUTC-4"},{"title":"Masked Generative Token Prediction Step","category":"Deep Learning","difficulty":"hard","id":"706","createdAt":"April 23, 2026 at 4:08:33 PM UTUTC-4"},{"title":"Iterative Token Unmasking with MaskGIT Decoding","category":"Deep Learning","difficulty":"medium","id":"707","createdAt":"April 23, 2026 at 4:08:33 PM UTUTC-4"},{"title":"Bernoulli Masking Schedule for Masked Token Prediction","category":"Machine Learning","difficulty":"easy","id":"708","createdAt":"April 23, 2026 at 4:08:33 PM UTUTC-4"},{"title":"Action-Conditioned Autoregressive Video Dynamics Model","category":"Deep Learning","difficulty":"hard","id":"709","createdAt":"April 23, 2026 at 4:08:33 PM UTUTC-4"},{"title":"Calculate Root Mean Square Error (RMSE)","category":"Machine Learning","difficulty":"easy","id":"71","createdAt":null},{"title":"Additive vs. Concatenated Action Conditioning in Transformers","category":"Deep Learning","difficulty":"medium","id":"710","createdAt":"April 23, 2026 at 4:08:33 PM UTUTC-4"},{"title":"Stop-Gradient Operator in Jointly Trained Models","category":"Deep Learning","difficulty":"easy","id":"711","createdAt":"April 23, 2026 at 4:08:33 PM UTUTC-4"},{"title":"Compute Frechet Video Distance (FVD) for Video Quality Evaluation","category":"Computer Vision","difficulty":"medium","id":"712","createdAt":"April 23, 2026 at 4:08:33 PM UTUTC-4"},{"title":"Compute PSNR for Image Reconstruction Quality","category":"Computer Vision","difficulty":"easy","id":"713","createdAt":"April 23, 2026 at 4:08:33 PM UTUTC-4"},{"title":"Measure Latent Action Controllability with Delta-PSNR","category":"Machine Learning","difficulty":"medium","id":"714","createdAt":"April 23, 2026 at 4:08:33 PM UTUTC-4"},{"title":"Batch Size Scaling: Effect on Training Loss and Convergence","category":"Optimization","difficulty":"medium","id":"715","createdAt":"April 23, 2026 at 4:08:33 PM UTUTC-4"},{"title":"Build a Latent-to-Real Action Mapping from a Small Labeled Set","category":"Machine Learning","difficulty":"easy","id":"716","createdAt":"April 23, 2026 at 4:08:33 PM UTUTC-4"},{"title":"Inverse Dynamics Model for Unsupervised Action Labeling","category":"Machine Learning","difficulty":"medium","id":"717","createdAt":"April 23, 2026 at 4:08:33 PM UTUTC-4"},{"title":"Spatial vs. Spatiotemporal Video Tokenizer Ablation","category":"Computer Vision","difficulty":"hard","id":"718","createdAt":"April 23, 2026 at 4:08:33 PM UTUTC-4"},{"title":"Ablation: Pixel vs. Token Input for Latent Action Model","category":"Machine Learning","difficulty":"medium","id":"719","createdAt":"April 23, 2026 at 4:08:33 PM UTUTC-4"},{"title":"Calculate Jaccard Index for Binary Classification","category":"Machine Learning","difficulty":"easy","id":"72","createdAt":null},{"title":"Implement a Vision Transformer (ViT) Image Encoder","category":"Computer Vision","difficulty":"medium","id":"720","createdAt":"April 23, 2026 at 4:08:33 PM UTUTC-4"},{"title":"Train a Video Quality Classifier for Dataset Curation","category":"Computer Vision","difficulty":"medium","id":"721","createdAt":"April 23, 2026 at 4:08:33 PM UTUTC-4"},{"title":"Data Collection from Procedurally Generated RL Environments","category":"Machine Learning","difficulty":"easy","id":"722","createdAt":"April 23, 2026 at 4:08:33 PM UTUTC-4"},{"title":"Video Frame Sampling and Preprocessing Pipeline","category":"Computer Vision","difficulty":"easy","id":"723","createdAt":"April 23, 2026 at 4:08:33 PM UTUTC-4"},{"title":"Frechet Inception Distance (FID) for Image Quality Evaluation","category":"Computer Vision","difficulty":"medium","id":"724","createdAt":"April 23, 2026 at 4:08:33 PM UTUTC-4"},{"title":"Memory Complexity: Full Space-Time vs. ST-Factorized Attention","category":"Deep Learning","difficulty":"medium","id":"725","createdAt":"April 23, 2026 at 4:08:33 PM UTUTC-4"},{"title":"EMA Codebook Updates in VQ-VAE","category":"Deep Learning","difficulty":"medium","id":"726","createdAt":"April 23, 2026 at 4:08:33 PM UTUTC-4"},{"title":"Transformer Policy for Behavioral Cloning from Latent Actions","category":"Machine Learning","difficulty":"hard","id":"727","createdAt":"April 23, 2026 at 4:08:33 PM UTUTC-4"},{"title":"Data-Efficient Action Mapping with Few Labeled Expert Samples","category":"Machine Learning","difficulty":"medium","id":"728","createdAt":"April 23, 2026 at 4:08:33 PM UTUTC-4"},{"title":"Evaluating RL Agents on Procedurally Generated Levels","category":"Machine Learning","difficulty":"medium","id":"729","createdAt":"April 23, 2026 at 4:08:33 PM UTUTC-4"},{"title":"Calculate Dice Score for Classification","category":"Machine Learning","difficulty":"easy","id":"73","createdAt":null},{"title":"Scalable Dataset Curation Using a Learned Quality Classifier","category":"Machine Learning","difficulty":"medium","id":"730","createdAt":"April 23, 2026 at 4:08:33 PM UTUTC-4"},{"title":"Hash-Based Expert Routing for MoE Layers","category":"Deep Learning","difficulty":"easy","id":"731","createdAt":"April 24, 2026 at 12:35:57 PM UTUTC-4"},{"title":"Sinkhorn-Knopp Doubly Stochastic Projection","category":"Linear Algebra","difficulty":"medium","id":"732","createdAt":"April 24, 2026 at 12:35:57 PM UTUTC-4"},{"title":"Dynamic Parameter Generation for Hyper-Connections","category":"Deep Learning","difficulty":"medium","id":"733","createdAt":"April 24, 2026 at 12:35:57 PM UTUTC-4"},{"title":"Token-Level Key-Value Compression with Overlapping Windows","category":"NLP","difficulty":"hard","id":"734","createdAt":"April 24, 2026 at 12:35:57 PM UTUTC-4"},{"title":"Overlapping Weighted KV Compression","category":"NLP","difficulty":"hard","id":"735","createdAt":"April 24, 2026 at 12:35:57 PM UTUTC-4"},{"title":"Lightning Indexer Sparse Attention Selection","category":"NLP","difficulty":"hard","id":"736","createdAt":"April 24, 2026 at 12:35:57 PM UTUTC-4"},{"title":"Weighted Multi-Head Index Score Computation","category":"NLP","difficulty":"medium","id":"737","createdAt":"April 24, 2026 at 12:35:57 PM UTUTC-4"},{"title":"Heavy Non-Overlapping KV Sequence Compression","category":"NLP","difficulty":"medium","id":"738","createdAt":"April 24, 2026 at 12:35:57 PM UTUTC-4"},{"title":"Newton-Schulz Iteration for Approximate Orthogonalization","category":"Linear Algebra","difficulty":"medium","id":"739","createdAt":"April 24, 2026 at 12:35:57 PM UTUTC-4"},{"title":"Create Composite Hypervector for a Dataset Row","category":"Linear Algebra","difficulty":"medium","id":"74","createdAt":"January 26, 2026 at 8:58:44 AM UTC-0500"},{"title":"RMS-Matched Update Rescaling for Orthogonalized Optimizers","category":"Optimization","difficulty":"easy","id":"740","createdAt":"April 24, 2026 at 12:35:57 PM UTUTC-4"},{"title":"Knapsack-Based ZeRO Bucket Assignment","category":"ML","difficulty":"medium","id":"741","createdAt":"April 24, 2026 at 12:35:57 PM UTUTC-4"},{"title":"Stochastic Rounding BF16 Gradient Compression","category":"Optimization","difficulty":"medium","id":"742","createdAt":"April 24, 2026 at 12:35:57 PM UTUTC-4"},{"title":"Storage-Pointer-Based Recomputation Deduplication","category":"Deep Learning","difficulty":"medium","id":"743","createdAt":"April 24, 2026 at 12:35:57 PM UTUTC-4"},{"title":"Anticipatory Routing for MoE Training Stability","category":"Deep Learning","difficulty":"hard","id":"744","createdAt":"April 24, 2026 at 12:35:57 PM UTUTC-4"},{"title":"Multi-Token Prediction Training Objective","category":"NLP","difficulty":"medium","id":"745","createdAt":"April 24, 2026 at 12:35:57 PM UTUTC-4"},{"title":"Lazy Teacher Logit Reconstruction from Cached Hidden States","category":"ML","difficulty":"medium","id":"746","createdAt":"April 24, 2026 at 12:35:57 PM UTUTC-4"},{"title":"Token-Granular Write-Ahead Log for Generation Resume","category":"ML","difficulty":"medium","id":"747","createdAt":"April 24, 2026 at 12:35:57 PM UTUTC-4"},{"title":"Deterministic Sparse Attention Backward KV Accumulation","category":"Deep Learning","difficulty":"hard","id":"748","createdAt":"April 24, 2026 at 12:35:57 PM UTUTC-4"},{"title":"Deterministic MoE Backward with Buffer Isolation","category":"Deep Learning","difficulty":"hard","id":"749","createdAt":"April 24, 2026 at 12:35:57 PM UTUTC-4"},{"title":"Generate a Confusion Matrix for Binary Classification","category":"Machine Learning","difficulty":"easy","id":"75","createdAt":null},{"title":"Progressive Batch Size Scheduler","category":"Optimization","difficulty":"easy","id":"750","createdAt":"April 24, 2026 at 12:35:57 PM UTUTC-4"},{"title":"Progressive Context Length Curriculum Scheduler","category":"NLP","difficulty":"medium","id":"751","createdAt":"April 24, 2026 at 12:35:57 PM UTUTC-4"},{"title":"LCM-Aligned Heterogeneous KV Cache Block Layout","category":"ML","difficulty":"medium","id":"752","createdAt":"April 24, 2026 at 12:35:57 PM UTUTC-4"},{"title":"Multi-Needle Long-Context Retrieval Evaluation","category":"NLP","difficulty":"medium","id":"753","createdAt":"April 24, 2026 at 12:35:57 PM UTUTC-4"},{"title":"Special Token Quick Instruction Mechanism","category":"NLP","difficulty":"medium","id":"754","createdAt":"April 24, 2026 at 12:35:57 PM UTUTC-4"},{"title":"Conditional Reasoning Trace Context Management","category":"NLP","difficulty":"medium","id":"755","createdAt":"April 24, 2026 at 12:35:57 PM UTUTC-4"},{"title":"Wave-Based Expert Parallelism Pipelining","category":"Optimization","difficulty":"hard","id":"756","createdAt":"April 24, 2026 at 12:35:57 PM UTUTC-4"},{"title":"Fill-in-the-Middle Document Transformation","category":"NLP","difficulty":"easy","id":"757","createdAt":"April 24, 2026 at 12:35:57 PM UTUTC-4"},{"title":"Knapsack-Based ZeRO Bucket Assignment","category":"Optimization","difficulty":"medium","id":"758","createdAt":"April 24, 2026 at 12:35:57 PM UTUTC-4"},{"title":"Interleaved CSA-HCA Layer Assignment","category":"Deep Learning","difficulty":"easy","id":"759","createdAt":"April 24, 2026 at 12:35:57 PM UTUTC-4"},{"title":"Calculate Cosine Similarity Between Vectors","category":"Linear Algebra","difficulty":"easy","id":"76","createdAt":"February 11, 2026 at 6:19:46 AM UTC-0500"},{"title":"Overlapping Look-Back KV Compression","category":"NLP","difficulty":"hard","id":"760","createdAt":"April 24, 2026 at 12:35:57 PM UTUTC-4"},{"title":"Reasoning Effort System Prompt Injection","category":"NLP","difficulty":"easy","id":"761","createdAt":"April 24, 2026 at 12:35:57 PM UTUTC-4"},{"title":"Mode-Dependent Context Window Evaluation","category":"ML","difficulty":"easy","id":"762","createdAt":"April 24, 2026 at 12:35:57 PM UTUTC-4"},{"title":"Million-Token Corpus Question Answering Evaluation","category":"NLP","difficulty":"medium","id":"763","createdAt":"April 24, 2026 at 12:35:57 PM UTUTC-4"},{"title":"Compute-Optimal Model Size via IsoFLOP Parabola","category":"Machine Learning","difficulty":"medium","id":"764","createdAt":"April 30, 2026 at 8:41:45 PM UTUTC-4"},{"title":"Fit Power-Law Scaling Law for Training Tokens","category":"Machine Learning","difficulty":"medium","id":"765","createdAt":"April 30, 2026 at 8:41:45 PM UTUTC-4"},{"title":"MinHash for Near-Duplicate Document Detection","category":"NLP","difficulty":"hard","id":"766","createdAt":"April 30, 2026 at 8:41:45 PM UTUTC-4"},{"title":"N-gram Overlap Contamination Detection","category":"NLP","difficulty":"medium","id":"767","createdAt":"April 30, 2026 at 8:41:45 PM UTUTC-4"},{"title":"Rejection Sampling Best-of-K Selection","category":"Machine Learning","difficulty":"easy","id":"768","createdAt":"April 30, 2026 at 8:41:45 PM UTUTC-4"},{"title":"DPO Loss with NLL Regularization on Chosen Sequences","category":"Deep Learning","difficulty":"medium","id":"769","createdAt":"April 30, 2026 at 8:41:45 PM UTUTC-4"},{"title":"Calculate Performance Metrics for a Classification Model","category":"Machine Learning","difficulty":"medium","id":"77","createdAt":null},{"title":"Checkpoint Averaging (Polyak Averaging)","category":"Deep Learning","difficulty":"easy","id":"770","createdAt":"April 30, 2026 at 8:41:45 PM UTUTC-4"},{"title":"Token Distribution KL Divergence Filter","category":"NLP","difficulty":"easy","id":"771","createdAt":"May 1, 2026 at 8:35:12 AM UTUTC-4"},{"title":"Duplicated N-gram Coverage Ratio","category":"NLP","difficulty":"easy","id":"772","createdAt":"May 1, 2026 at 8:35:12 AM UTUTC-4"},{"title":"Cross-Document Attention Mask Construction","category":"Deep Learning","difficulty":"medium","id":"773","createdAt":"May 1, 2026 at 8:35:12 AM UTUTC-4"},{"title":"Prompt Complexity Scoring via Intention Tag Count","category":"NLP","difficulty":"easy","id":"774","createdAt":"May 1, 2026 at 8:35:12 AM UTUTC-4"},{"title":"Greedy Semantic Deduplication via Cosine Similarity","category":"Machine Learning","difficulty":"medium","id":"775","createdAt":"May 1, 2026 at 8:35:12 AM UTUTC-4"},{"title":"Hierarchical Document Summarization Pipeline","category":"NLP","difficulty":"medium","id":"776","createdAt":"May 1, 2026 at 8:35:12 AM UTUTC-4"},{"title":"MCTS with Step-wise Reward for Reasoning Trace Search","category":"Machine Learning","difficulty":"hard","id":"777","createdAt":"May 1, 2026 at 8:35:12 AM UTUTC-4"},{"title":"Top Quartile Reward Score Filter","category":"Machine Learning","difficulty":"easy","id":"778","createdAt":"May 1, 2026 at 8:35:12 AM UTUTC-4"},{"title":"Row-wise FP8 Quantization with Clamped Scale Factors","category":"Deep Learning","difficulty":"medium","id":"779","createdAt":"May 1, 2026 at 8:35:12 AM UTUTC-4"},{"title":"Descriptive Statistics Calculator","category":"Statistics","difficulty":"easy","id":"78","createdAt":"December 15, 2025 at 8:15:13 AM UTC-0500"},{"title":"Pipeline Parallelism Bubble Ratio Calculator","category":"Deep Learning","difficulty":"easy","id":"780","createdAt":"May 1, 2026 at 8:35:12 AM UTUTC-4"},{"title":"Micro-batch Inference Throughput Estimation","category":"Deep Learning","difficulty":"easy","id":"781","createdAt":"May 1, 2026 at 8:35:12 AM UTUTC-4"},{"title":"Compare Reward Score Distributions Across Precision Levels","category":"Machine Learning","difficulty":"medium","id":"782","createdAt":"May 1, 2026 at 8:35:12 AM UTUTC-4"},{"title":"Multi-layer ViT Feature Concatenation","category":"Computer Vision","difficulty":"easy","id":"783","createdAt":"May 1, 2026 at 8:35:12 AM UTUTC-4"},{"title":"Temporal Frame Aggregation for Video Understanding","category":"Computer Vision","difficulty":"easy","id":"784","createdAt":"May 1, 2026 at 8:35:12 AM UTUTC-4"},{"title":"CLIP Image-Text Alignment Score Filtering","category":"Computer Vision","difficulty":"easy","id":"785","createdAt":"May 1, 2026 at 8:35:12 AM UTUTC-4"},{"title":"N-gram Frequency Resampling for Dataset Diversity","category":"NLP","difficulty":"medium","id":"786","createdAt":"May 1, 2026 at 8:35:12 AM UTUTC-4"},{"title":"Wu-Palmer Similarity Score for Open-ended QA Evaluation","category":"NLP","difficulty":"easy","id":"787","createdAt":"May 1, 2026 at 8:35:12 AM UTUTC-4"},{"title":"Exact Match Benchmark Decontamination Check","category":"NLP","difficulty":"easy","id":"788","createdAt":"May 1, 2026 at 8:35:12 AM UTUTC-4"},{"title":"Model FLOPs Utilization (MFU) Calculator","category":"Deep Learning","difficulty":"easy","id":"789","createdAt":"May 1, 2026 at 8:35:12 AM UTUTC-4"},{"title":"Binomial Distribution Probability","category":"Probability","difficulty":"medium","id":"79","createdAt":"January 26, 2026 at 9:18:23 AM UTC-0500"},{"title":"Sigmoidal Accuracy-to-Log-Likelihood Scaling Law Fit","category":"Machine Learning","difficulty":"medium","id":"790","createdAt":"May 1, 2026 at 8:35:12 AM UTUTC-4"},{"title":"Union-Find Connected Components for Image Deduplication","category":"Computer Vision","difficulty":"medium","id":"791","createdAt":"May 1, 2026 at 8:35:12 AM UTUTC-4"},{"title":"Instruction Complexity Scoring via Unique Intention Tags","category":"NLP","difficulty":"easy","id":"792","createdAt":"May 1, 2026 at 8:35:12 AM UTUTC-4"},{"title":"Aspect-Ratio Preserving Image Tiling for Vision Transformers","category":"Computer Vision","difficulty":"medium","id":"793","createdAt":"May 1, 2026 at 8:35:12 AM UTUTC-4"},{"title":"Combined RM and LLM Quality Filter","category":"Machine Learning","difficulty":"easy","id":"794","createdAt":"May 1, 2026 at 8:35:12 AM UTUTC-4"},{"title":"Masked Cross-Entropy Loss for Supervised Finetuning","category":"Deep Learning","difficulty":"medium","id":"795","createdAt":"May 1, 2026 at 8:35:12 AM UTUTC-4"},{"title":"Verifiable Instruction Constraint Checker","category":"NLP","difficulty":"medium","id":"796","createdAt":"May 1, 2026 at 8:35:12 AM UTUTC-4"},{"title":"Macro-Average Accuracy Across Benchmark Subtasks","category":"Machine Learning","difficulty":"easy","id":"797","createdAt":"May 1, 2026 at 8:35:12 AM UTUTC-4"},{"title":"Linear Discriminant Analysis (LDA) Binary Classifier","category":"Machine Learning","difficulty":"medium","id":"798","createdAt":"May 6, 2026 at 10:47:53 AM UTUTC-4"},{"title":"Quadratic Discriminant Analysis (QDA) Classifier","category":"Machine Learning","difficulty":"medium","id":"799","createdAt":"May 6, 2026 at 10:47:53 AM UTUTC-4"},{"title":"Calculate 2x2 Matrix Inverse","category":"Linear Algebra","difficulty":"easy","id":"8","createdAt":"December 15, 2025 at 7:41:46 AM UTC-0500"},{"title":"Normal Distribution PDF Calculator","category":"Probability","difficulty":"medium","id":"80","createdAt":null},{"title":"Learning Curve Generator for Bias-Variance Diagnosis","category":"Machine Learning","difficulty":"medium","id":"800","createdAt":"May 6, 2026 at 10:47:53 AM UTUTC-4"},{"title":"Polynomial Regression Fit","category":"Machine Learning","difficulty":"medium","id":"801","createdAt":"May 6, 2026 at 10:47:53 AM UTUTC-4"},{"title":"Stochastic Gradient Descent Step for Linear Regression","category":"Machine Learning","difficulty":"medium","id":"802","createdAt":"May 6, 2026 at 10:47:53 AM UTUTC-4"},{"title":"Mini-Batch Gradient Descent Step for Linear Regression","category":"Machine Learning","difficulty":"medium","id":"803","createdAt":"May 6, 2026 at 10:47:53 AM UTUTC-4"},{"title":"Bias-Variance Decomposition from Bootstrap","category":"Machine Learning","difficulty":"medium","id":"804","createdAt":"May 6, 2026 at 10:47:53 AM UTUTC-4"},{"title":"Best Variance Reduction Split for Regression Tree","category":"Machine Learning","difficulty":"medium","id":"805","createdAt":"May 6, 2026 at 10:47:53 AM UTUTC-4"},{"title":"CART Recursive Tree Builder","category":"Machine Learning","difficulty":"medium","id":"806","createdAt":"May 6, 2026 at 10:47:53 AM UTUTC-4"},{"title":"Random Forest Fit from Scratch","category":"Machine Learning","difficulty":"medium","id":"807","createdAt":"May 6, 2026 at 10:47:53 AM UTUTC-4"},{"title":"Extra Trees Split Selection","category":"Machine Learning","difficulty":"medium","id":"808","createdAt":"May 6, 2026 at 10:47:53 AM UTUTC-4"},{"title":"Pasting Ensemble with 1-NN Base Learners","category":"Machine Learning","difficulty":"medium","id":"809","createdAt":"May 6, 2026 at 10:47:53 AM UTUTC-4"},{"title":"Poisson Distribution Probability Calculator","category":"Probability","difficulty":"easy","id":"81","createdAt":null},{"title":"Bagging with Random Patches and 1-Nearest Neighbor","category":"Machine Learning","difficulty":"medium","id":"810","createdAt":"May 6, 2026 at 10:47:53 AM UTUTC-4"},{"title":"Histogram-Based Gradient Boosting Split Finding","category":"Machine Learning","difficulty":"medium","id":"811","createdAt":"May 6, 2026 at 10:47:53 AM UTUTC-4"},{"title":"Permutation Feature Importance","category":"Machine Learning","difficulty":"medium","id":"812","createdAt":"May 6, 2026 at 10:47:53 AM UTUTC-4"},{"title":"Epsilon-Insensitive Loss for SVM Regression","category":"Machine Learning","difficulty":"medium","id":"813","createdAt":"May 6, 2026 at 10:47:53 AM UTUTC-4"},{"title":"SVM Dual Formulation via Coordinate Descent","category":"Machine Learning","difficulty":"medium","id":"814","createdAt":"May 6, 2026 at 10:47:53 AM UTUTC-4"},{"title":"Implement Sigmoid Kernel Function","category":"Machine Learning","difficulty":"medium","id":"815","createdAt":"May 6, 2026 at 10:47:53 AM UTUTC-4"},{"title":"Implement p-Spectrum String Kernel","category":"Machine Learning","difficulty":"medium","id":"816","createdAt":"May 6, 2026 at 10:47:53 AM UTUTC-4"},{"title":"Multinomial Naive Bayes Classifier","category":"Machine Learning","difficulty":"medium","id":"817","createdAt":"May 6, 2026 at 10:47:53 AM UTUTC-4"},{"title":"Classical Multidimensional Scaling (MDS)","category":"Machine Learning","difficulty":"medium","id":"818","createdAt":"May 6, 2026 at 10:47:53 AM UTUTC-4"},{"title":"Isomap with Geodesic Distances","category":"Machine Learning","difficulty":"medium","id":"819","createdAt":"May 6, 2026 at 10:47:53 AM UTUTC-4"},{"title":"Grayscale Image Contrast Calculator","category":"Computer Vision","difficulty":"easy","id":"82","createdAt":null},{"title":"Incremental PCA with Partial Fit","category":"Machine Learning","difficulty":"medium","id":"820","createdAt":"May 6, 2026 at 10:47:53 AM UTUTC-4"},{"title":"Randomized PCA via Range Finding","category":"Machine Learning","difficulty":"medium","id":"821","createdAt":"May 6, 2026 at 10:47:53 AM UTUTC-4"},{"title":"Gaussian Random Projection (Johnson-Lindenstrauss)","category":"Machine Learning","difficulty":"medium","id":"822","createdAt":"May 6, 2026 at 10:47:53 AM UTUTC-4"},{"title":"Mean Shift Clustering","category":"Machine Learning","difficulty":"medium","id":"823","createdAt":"May 6, 2026 at 10:47:53 AM UTUTC-4"},{"title":"Spectral Clustering via Graph Laplacian","category":"Machine Learning","difficulty":"medium","id":"824","createdAt":"May 6, 2026 at 10:47:53 AM UTUTC-4"},{"title":"BIRCH Clustering for Large Datasets","category":"Machine Learning","difficulty":"medium","id":"825","createdAt":"May 6, 2026 at 10:47:53 AM UTUTC-4"},{"title":"Affinity Propagation Clustering","category":"Machine Learning","difficulty":"medium","id":"826","createdAt":"May 6, 2026 at 10:47:53 AM UTUTC-4"},{"title":"Elbow Method for K-Means","category":"Machine Learning","difficulty":"medium","id":"827","createdAt":"May 6, 2026 at 10:47:53 AM UTUTC-4"},{"title":"BIC and AIC for GMM Component Selection","category":"Machine Learning","difficulty":"medium","id":"828","createdAt":"May 6, 2026 at 10:47:53 AM UTUTC-4"},{"title":"Bayesian Gaussian Mixture Variational Update","category":"Machine Learning","difficulty":"medium","id":"829","createdAt":"May 6, 2026 at 10:47:53 AM UTUTC-4"},{"title":"Dot Product Calculator","category":"Linear Algebra","difficulty":"easy","id":"83","createdAt":"January 23, 2026 at 3:47:12 PM UTC-0500"},{"title":"Local Outlier Factor (LOF) Anomaly Score","category":"Machine Learning","difficulty":"medium","id":"830","createdAt":"May 6, 2026 at 10:47:53 AM UTUTC-4"},{"title":"One-Class SVM for Anomaly Detection","category":"Machine Learning","difficulty":"medium","id":"831","createdAt":"May 6, 2026 at 10:47:53 AM UTUTC-4"},{"title":"Image Segmentation via K-Means Clustering","category":"Machine Learning","difficulty":"medium","id":"832","createdAt":"May 6, 2026 at 10:47:53 AM UTUTC-4"},{"title":"Macro F1 Score for Multi-Class Classification","category":"Machine Learning","difficulty":"medium","id":"833","createdAt":"May 6, 2026 at 10:47:53 AM UTUTC-4"},{"title":"Micro F1 Score for Multi-Label Classification","category":"Machine Learning","difficulty":"medium","id":"834","createdAt":"May 6, 2026 at 10:47:53 AM UTUTC-4"},{"title":"Weighted F1 Score for Multi-Class Classification","category":"Machine Learning","difficulty":"medium","id":"835","createdAt":"May 6, 2026 at 10:47:53 AM UTUTC-4"},{"title":"Top-K Accuracy for Multi-Class Classification","category":"Machine Learning","difficulty":"medium","id":"836","createdAt":"May 6, 2026 at 10:47:53 AM UTUTC-4"},{"title":"Hamming Loss for Multilabel Classification","category":"Machine Learning","difficulty":"medium","id":"837","createdAt":"May 6, 2026 at 10:47:53 AM UTUTC-4"},{"title":"Error Analysis from Confusion Matrix","category":"Machine Learning","difficulty":"medium","id":"838","createdAt":"May 6, 2026 at 10:47:53 AM UTUTC-4"},{"title":"Cross-Validated Prediction with K-Fold Linear Regression","category":"Machine Learning","difficulty":"medium","id":"839","createdAt":"May 6, 2026 at 10:47:53 AM UTUTC-4"},{"title":"Phi Transformation for Polynomial Features","category":"Linear Algebra","difficulty":"easy","id":"84","createdAt":null},{"title":"Implement Stratified K-Fold Cross-Validation","category":"Machine Learning","difficulty":"medium","id":"840","createdAt":"May 6, 2026 at 10:47:53 AM UTUTC-4"},{"title":"Randomized Search for Hyperparameter Tuning","category":"Machine Learning","difficulty":"medium","id":"841","createdAt":"May 6, 2026 at 10:47:53 AM UTUTC-4"},{"title":"StandardScaler Fit and Transform","category":"Machine Learning","difficulty":"medium","id":"842","createdAt":"May 6, 2026 at 10:47:53 AM UTUTC-4"},{"title":"Ordinal Encoding for Categorical Features","category":"Machine Learning","difficulty":"medium","id":"843","createdAt":"May 6, 2026 at 10:47:53 AM UTUTC-4"},{"title":"Pipeline Composition (Chain Transformers and Estimator)","category":"Machine Learning","difficulty":"medium","id":"844","createdAt":"May 6, 2026 at 10:47:53 AM UTUTC-4"},{"title":"ColumnTransformer-Style Dispatcher","category":"Machine Learning","difficulty":"medium","id":"845","createdAt":"May 6, 2026 at 10:47:53 AM UTUTC-4"},{"title":"Feature Hashing Trick for Sparse Features","category":"Machine Learning","difficulty":"medium","id":"846","createdAt":"May 6, 2026 at 10:47:53 AM UTUTC-4"},{"title":"Dummy Classifier Baseline","category":"Machine Learning","difficulty":"medium","id":"847","createdAt":"May 6, 2026 at 10:47:53 AM UTUTC-4"},{"title":"Dummy Regressor Baseline","category":"Machine Learning","difficulty":"medium","id":"848","createdAt":"May 6, 2026 at 10:47:53 AM UTUTC-4"},{"title":"Precision and Recall at Threshold","category":"Machine Learning","difficulty":"medium","id":"849","createdAt":"May 6, 2026 at 10:47:53 AM UTUTC-4"},{"title":"Positional Encoding Calculator","category":"Deep Learning","difficulty":"hard","id":"85","createdAt":null},{"title":"Multi-Output Binary Classification with Binary Relevance","category":"Machine Learning","difficulty":"medium","id":"850","createdAt":"May 6, 2026 at 10:47:53 AM UTUTC-4"},{"title":"Train a Sparse Autoencoder on Residual-Stream Activations","category":"Machine Learning","difficulty":"medium","id":"851","createdAt":"May 7, 2026 at 8:10:06 AM UTUTC-4"},{"title":"Top-K Sparse Autoencoder Forward Pass","category":"Machine Learning","difficulty":"medium","id":"852","createdAt":"May 7, 2026 at 8:10:06 AM UTUTC-4"},{"title":"Linear Probe Training on Hidden States","category":"Machine Learning","difficulty":"medium","id":"853","createdAt":"May 7, 2026 at 8:10:06 AM UTUTC-4"},{"title":"Steering Vector from Contrastive Pairs","category":"Machine Learning","difficulty":"medium","id":"854","createdAt":"May 7, 2026 at 8:10:06 AM UTUTC-4"},{"title":"Apply Steering Vector at Inference","category":"Machine Learning","difficulty":"medium","id":"855","createdAt":"May 7, 2026 at 8:10:06 AM UTUTC-4"},{"title":"Activation Patching for Circuit Discovery","category":"Machine Learning","difficulty":"medium","id":"856","createdAt":"May 7, 2026 at 8:10:06 AM UTUTC-4"},{"title":"Path Patching for Indirect Effect Isolation","category":"Machine Learning","difficulty":"medium","id":"857","createdAt":"May 7, 2026 at 8:10:06 AM UTUTC-4"},{"title":"Direct Logit Attribution for Transformer Components","category":"Machine Learning","difficulty":"medium","id":"858","createdAt":"May 7, 2026 at 8:10:06 AM UTUTC-4"},{"title":"Attribution Patching (Linear Approximation)","category":"Machine Learning","difficulty":"medium","id":"859","createdAt":"May 7, 2026 at 8:10:06 AM UTUTC-4"},{"title":"Detect Overfitting or Underfitting","category":"Machine Learning","difficulty":"easy","id":"86","createdAt":null},{"title":"Logit Lens Projection","category":"Machine Learning","difficulty":"medium","id":"860","createdAt":"May 7, 2026 at 8:10:06 AM UTUTC-4"},{"title":"Tuned Lens - Learned Affine Probe per Layer","category":"Machine Learning","difficulty":"medium","id":"861","createdAt":"May 7, 2026 at 8:10:06 AM UTUTC-4"},{"title":"Toy Models of Superposition: Feature Reconstruction","category":"Machine Learning","difficulty":"medium","id":"862","createdAt":"May 7, 2026 at 8:10:06 AM UTUTC-4"},{"title":"Self-Critique Loss for Constitutional AI","category":"Machine Learning","difficulty":"medium","id":"863","createdAt":"May 7, 2026 at 8:10:06 AM UTUTC-4"},{"title":"Constitutional Revision Objective","category":"Machine Learning","difficulty":"medium","id":"864","createdAt":"May 7, 2026 at 8:10:06 AM UTUTC-4"},{"title":"RLAIF Reward Model from AI Feedback","category":"Machine Learning","difficulty":"medium","id":"865","createdAt":"May 7, 2026 at 8:10:06 AM UTUTC-4"},{"title":"Merge LoRA Adapter Weights for Zero-Latency Inference","category":"Deep Learning","difficulty":"easy","id":"866","createdAt":"May 13, 2026 at 2:02:20 PM UTUTC-4"},{"title":"Calculate LoRA Trainable Parameter Count vs Full Fine-Tuning","category":"Deep Learning","difficulty":"easy","id":"867","createdAt":"May 13, 2026 at 2:02:20 PM UTUTC-4"},{"title":"Compute Normalized Subspace Similarity Between Low-Rank Matrices","category":"Linear Algebra","difficulty":"medium","id":"868","createdAt":"May 13, 2026 at 2:02:20 PM UTUTC-4"},{"title":"Subspace Amplification of Pretrained Weights by a Low-Rank Update","category":"Linear Algebra","difficulty":"medium","id":"869","createdAt":"May 13, 2026 at 2:02:20 PM UTUTC-4"},{"title":"Adam Optimizer","category":"Deep Learning","difficulty":"medium","id":"87","createdAt":null},{"title":"LoRA-Adapted Linear Projection with Task Switching","category":"Deep Learning","difficulty":"medium","id":"870","createdAt":"May 13, 2026 at 2:02:20 PM UTUTC-4"},{"title":"Efficient Task Switching with LoRA Weight Swapping","category":"Deep Learning","difficulty":"medium","id":"871","createdAt":"May 13, 2026 at 2:02:20 PM UTUTC-4"},{"title":"Truncated SVD Rank-r Approximation of Weight Updates","category":"Linear Algebra","difficulty":"medium","id":"872","createdAt":"May 13, 2026 at 2:02:20 PM UTUTC-4"},{"title":"Implement Adapter Bottleneck Layer for Transformer Fine-Tuning","category":"Deep Learning","difficulty":"medium","id":"873","createdAt":"May 13, 2026 at 2:02:20 PM UTUTC-4"},{"title":"Calculate Memory Savings of LoRA vs Full Fine-Tuning with Adam","category":"Deep Learning","difficulty":"medium","id":"874","createdAt":"May 13, 2026 at 2:02:20 PM UTUTC-4"},{"title":"Compute Grassmann Distance Between Subspaces","category":"Linear Algebra","difficulty":"medium","id":"875","createdAt":"May 13, 2026 at 2:02:20 PM UTUTC-4"},{"title":"Analyze Singular Value Spectrum to Determine Intrinsic Rank","category":"Linear Algebra","difficulty":"medium","id":"876","createdAt":"May 13, 2026 at 2:02:20 PM UTUTC-4"},{"title":"BitFit: Bias-Only Parameter Selection for Fine-Tuning","category":"Deep Learning","difficulty":"easy","id":"877","createdAt":"May 13, 2026 at 2:02:20 PM UTUTC-4"},{"title":"Prefix Tuning Parameter and Sequence Length Trade-off","category":"NLP","difficulty":"easy","id":"878","createdAt":"May 13, 2026 at 2:02:20 PM UTUTC-4"},{"title":"Simulate LoRA Rank Selection with Synthetic Low-Rank Updates","category":"Deep Learning","difficulty":"medium","id":"879","createdAt":"May 13, 2026 at 2:02:20 PM UTUTC-4"},{"title":"GPT-2 Text Generation","category":"NLP","difficulty":"hard","id":"88","createdAt":"December 29, 2025 at 2:09:30 PM UTC-0500"},{"title":"Create a Float Tensor from a Python List","category":"pytorch","difficulty":"easy","id":"880","createdAt":"May 13, 2026 at 3:05:55 PM UTUTC-4"},{"title":"Reshape and Transpose a Tensor","category":"pytorch","difficulty":"easy","id":"881","createdAt":"May 13, 2026 at 3:05:55 PM UTUTC-4"},{"title":"Add a Bias Vector to a Batch via Broadcasting","category":"pytorch","difficulty":"easy","id":"882","createdAt":"May 13, 2026 at 3:05:55 PM UTUTC-4"},{"title":"Implement a Linear Layer Forward Pass with Matrix Multiplication","category":"pytorch","difficulty":"easy","id":"883","createdAt":"May 13, 2026 at 3:05:55 PM UTUTC-4"},{"title":"Compute a Gradient with PyTorch Autograd","category":"pytorch","difficulty":"easy","id":"884","createdAt":"May 13, 2026 at 3:05:55 PM UTUTC-4"},{"title":"Build a Linear Regression Model with nn.Module","category":"pytorch","difficulty":"easy","id":"885","createdAt":"May 13, 2026 at 3:05:55 PM UTUTC-4"},{"title":"Run One Training Step: Forward, Loss, Backward, Optimizer","category":"pytorch","difficulty":"easy","id":"886","createdAt":"May 13, 2026 at 3:05:55 PM UTUTC-4"},{"title":"Build an MLP with nn.Sequential","category":"pytorch","difficulty":"easy","id":"887","createdAt":"May 13, 2026 at 3:05:55 PM UTUTC-4"},{"title":"Save and Load Model Weights with state_dict","category":"pytorch","difficulty":"easy","id":"888","createdAt":"May 13, 2026 at 3:05:55 PM UTUTC-4"},{"title":"Create a Float Tensor with Tinygrad","category":"tinygrad","difficulty":"easy","id":"889","createdAt":"May 13, 2026 at 3:09:02 PM UTUTC-4"},{"title":"The Pattern Weaver's Code","category":"Deep Learning","difficulty":"medium","id":"89","createdAt":null},{"title":"Reshape and Transpose a Tinygrad Tensor","category":"tinygrad","difficulty":"easy","id":"890","createdAt":"May 13, 2026 at 3:09:02 PM UTUTC-4"},{"title":"Add a Bias Vector to a Batch with Tinygrad Broadcasting","category":"tinygrad","difficulty":"easy","id":"891","createdAt":"May 13, 2026 at 3:09:02 PM UTUTC-4"},{"title":"Implement a Linear Layer Forward Pass in Tinygrad","category":"tinygrad","difficulty":"easy","id":"892","createdAt":"May 13, 2026 at 3:09:02 PM UTUTC-4"},{"title":"Compute a Gradient with Tinygrad Autograd","category":"tinygrad","difficulty":"easy","id":"893","createdAt":"May 13, 2026 at 3:09:02 PM UTUTC-4"},{"title":"Build a Linear Regression Model in Tinygrad","category":"tinygrad","difficulty":"easy","id":"894","createdAt":"May 13, 2026 at 3:09:02 PM UTUTC-4"},{"title":"Run One Tinygrad Training Step: Forward, Loss, Backward, Optimizer","category":"tinygrad","difficulty":"easy","id":"895","createdAt":"May 13, 2026 at 3:09:02 PM UTUTC-4"},{"title":"Build a 2-Layer MLP as a Tinygrad Class","category":"tinygrad","difficulty":"easy","id":"896","createdAt":"May 13, 2026 at 3:09:02 PM UTUTC-4"},{"title":"Transfer Model Weights with Tinygrad state_dict","category":"tinygrad","difficulty":"easy","id":"897","createdAt":"May 13, 2026 at 3:09:02 PM UTUTC-4"},{"title":"Backprop a Linear Layer by Hand","category":"pytorch","difficulty":"easy","id":"898","createdAt":"May 15, 2026 at 8:19:21 AM UTUTC-4"},{"title":"Build a Dataset and Use It with a DataLoader","category":"pytorch","difficulty":"easy","id":"899","createdAt":"May 15, 2026 at 8:19:21 AM UTUTC-4"},{"title":"Matrix times Matrix ","category":"Linear Algebra","difficulty":"medium","id":"9","createdAt":"December 15, 2025 at 7:30:01 AM UTC-0500"},{"title":"BM25 Ranking ","category":"NLP","difficulty":"medium","id":"90","createdAt":null},{"title":"Implement Conv2d with `unfold`","category":"pytorch","difficulty":"medium","id":"900","createdAt":"May 15, 2026 at 8:19:21 AM UTUTC-4"},{"title":"Implement Dropout from Scratch","category":"pytorch","difficulty":"easy","id":"901","createdAt":"May 15, 2026 at 8:19:21 AM UTUTC-4"},{"title":"Implement BatchNorm2d from Scratch (training mode)","category":"pytorch","difficulty":"medium","id":"902","createdAt":"May 15, 2026 at 8:19:21 AM UTUTC-4"},{"title":"Implement a Custom `autograd.Function`","category":"pytorch","difficulty":"medium","id":"903","createdAt":"May 15, 2026 at 8:19:21 AM UTUTC-4"},{"title":"Implement Multi-Head Self-Attention","category":"pytorch","difficulty":"hard","id":"904","createdAt":"May 15, 2026 at 8:19:21 AM UTUTC-4"},{"title":"Implement a Transformer Encoder Block","category":"pytorch","difficulty":"medium","id":"905","createdAt":"May 15, 2026 at 8:19:21 AM UTUTC-4"},{"title":"Sinusoidal Positional Encoding","category":"pytorch","difficulty":"easy","id":"906","createdAt":"May 15, 2026 at 8:19:21 AM UTUTC-4"},{"title":"Implement an LSTM Cell from Scratch","category":"pytorch","difficulty":"medium","id":"907","createdAt":"May 15, 2026 at 8:19:21 AM UTUTC-4"},{"title":"Implement LayerNorm from Scratch","category":"pytorch","difficulty":"easy","id":"908","createdAt":"May 15, 2026 at 8:19:21 AM UTUTC-4"},{"title":"Gradient Clipping by Norm","category":"pytorch","difficulty":"medium","id":"909","createdAt":"May 15, 2026 at 8:19:21 AM UTUTC-4"},{"title":"Calculate F1 Score from Predicted and True Labels","category":"Machine Learning","difficulty":"easy","id":"91","createdAt":null},{"title":"Cosine LR Schedule with Linear Warmup","category":"pytorch","difficulty":"easy","id":"910","createdAt":"May 15, 2026 at 8:19:21 AM UTUTC-4"},{"title":"Mixed-Precision Forward with `autocast`","category":"pytorch","difficulty":"medium","id":"911","createdAt":"May 15, 2026 at 8:19:21 AM UTUTC-4"},{"title":"Gradient Accumulation Over Micro-Batches","category":"pytorch","difficulty":"medium","id":"912","createdAt":"May 15, 2026 at 8:19:21 AM UTUTC-4"},{"title":"Early Stopping with Patience","category":"pytorch","difficulty":"easy","id":"913","createdAt":"May 15, 2026 at 8:19:21 AM UTUTC-4"},{"title":"Numerically Stable Cross-Entropy","category":"pytorch","difficulty":"medium","id":"914","createdAt":"May 15, 2026 at 8:19:21 AM UTUTC-4"},{"title":"Implement Focal Loss","category":"pytorch","difficulty":"medium","id":"915","createdAt":"May 15, 2026 at 8:19:21 AM UTUTC-4"},{"title":"Implement Triplet Loss","category":"pytorch","difficulty":"easy","id":"916","createdAt":"May 15, 2026 at 8:19:21 AM UTUTC-4"},{"title":"Implement a ResNet Basic Block","category":"pytorch","difficulty":"medium","id":"917","createdAt":"May 15, 2026 at 8:19:21 AM UTUTC-4"},{"title":"Build a Tiny GPT","category":"pytorch","difficulty":"hard","id":"918","createdAt":"May 15, 2026 at 8:19:21 AM UTUTC-4"},{"title":"Tinygrad: Backprop a Linear Layer by Hand","category":"tinygrad","difficulty":"easy","id":"919","createdAt":"May 17, 2026 at 9:33:24 AM UTUTC-4"},{"title":"Linear Regression - Power Grid Optimization","category":"Machine Learning","difficulty":"medium","id":"92","createdAt":null},{"title":"Tinygrad: Iterate Mini-Batches","category":"tinygrad","difficulty":"easy","id":"920","createdAt":"May 17, 2026 at 9:33:24 AM UTUTC-4"},{"title":"Tinygrad: Implement Conv2d from Python Loops","category":"tinygrad","difficulty":"medium","id":"921","createdAt":"May 17, 2026 at 9:33:24 AM UTUTC-4"},{"title":"Tinygrad: Implement Dropout from Scratch","category":"tinygrad","difficulty":"easy","id":"922","createdAt":"May 17, 2026 at 9:33:24 AM UTUTC-4"},{"title":"Tinygrad: Implement BatchNorm2d from Scratch (Training Mode)","category":"tinygrad","difficulty":"medium","id":"923","createdAt":"May 17, 2026 at 9:33:24 AM UTUTC-4"},{"title":"Tinygrad: Implement Forward and Backward as Two Functions","category":"tinygrad","difficulty":"medium","id":"924","createdAt":"May 17, 2026 at 9:33:24 AM UTUTC-4"},{"title":"Tinygrad: Implement Multi-Head Self-Attention","category":"tinygrad","difficulty":"hard","id":"925","createdAt":"May 17, 2026 at 9:33:24 AM UTUTC-4"},{"title":"Tinygrad: Implement a Transformer Encoder Block","category":"tinygrad","difficulty":"medium","id":"926","createdAt":"May 17, 2026 at 9:33:24 AM UTUTC-4"},{"title":"Tinygrad: Sinusoidal Positional Encoding","category":"tinygrad","difficulty":"easy","id":"927","createdAt":"May 17, 2026 at 9:33:24 AM UTUTC-4"},{"title":"Tinygrad: Implement an LSTM Cell from Scratch","category":"tinygrad","difficulty":"medium","id":"928","createdAt":"May 17, 2026 at 9:33:24 AM UTUTC-4"},{"title":"Tinygrad: Implement LayerNorm from Scratch","category":"tinygrad","difficulty":"easy","id":"929","createdAt":"May 17, 2026 at 9:33:24 AM UTUTC-4"},{"title":"Calculate Mean Absolute Error (MAE)","category":"Machine Learning","difficulty":"easy","id":"93","createdAt":"January 26, 2026 at 8:11:38 AM UTC-0500"},{"title":"Tinygrad: Gradient Clipping by Norm","category":"tinygrad","difficulty":"medium","id":"930","createdAt":"May 17, 2026 at 9:33:24 AM UTUTC-4"},{"title":"Tinygrad: Cosine LR Schedule with Linear Warmup","category":"tinygrad","difficulty":"easy","id":"931","createdAt":"May 17, 2026 at 9:33:24 AM UTUTC-4"},{"title":"Tinygrad: Compute a Linear Layer in Float16","category":"tinygrad","difficulty":"medium","id":"932","createdAt":"May 17, 2026 at 9:38:13 AM UTUTC-4"},{"title":"Tinygrad: Gradient Accumulation Over Micro-Batches","category":"tinygrad","difficulty":"medium","id":"933","createdAt":"May 17, 2026 at 9:38:13 AM UTUTC-4"},{"title":"Tinygrad: Early Stopping with Patience","category":"tinygrad","difficulty":"easy","id":"934","createdAt":"May 17, 2026 at 9:33:24 AM UTUTC-4"},{"title":"Tinygrad: Numerically Stable Cross-Entropy","category":"tinygrad","difficulty":"medium","id":"935","createdAt":"May 17, 2026 at 11:54:40 AM UTUTC-4"},{"title":"Tinygrad: Implement Focal Loss","category":"tinygrad","difficulty":"medium","id":"936","createdAt":"May 17, 2026 at 11:54:40 AM UTUTC-4"},{"title":"Tinygrad: Implement Triplet Loss","category":"tinygrad","difficulty":"easy","id":"937","createdAt":"May 17, 2026 at 9:33:24 AM UTUTC-4"},{"title":"Tinygrad: Implement a ResNet Basic Block","category":"tinygrad","difficulty":"medium","id":"938","createdAt":"May 17, 2026 at 9:33:24 AM UTUTC-4"},{"title":"Tinygrad: Build a Tiny GPT","category":"tinygrad","difficulty":"hard","id":"939","createdAt":"May 17, 2026 at 9:33:24 AM UTUTC-4"},{"title":"Implement Multi-Head Attention","category":"Deep Learning","difficulty":"hard","id":"94","createdAt":"December 28, 2025 at 9:22:15 AM UTC-0500"},{"title":"Regex-Based Text Tokenizer","category":"NLP","difficulty":"easy","id":"940","createdAt":"May 17, 2026 at 12:17:55 PM UTUTC-4"},{"title":"Build Vocabulary from Token List","category":"NLP","difficulty":"easy","id":"941","createdAt":"May 17, 2026 at 12:17:55 PM UTUTC-4"},{"title":"Simple Word Tokenizer Encode and Decode","category":"NLP","difficulty":"easy","id":"942","createdAt":"May 17, 2026 at 12:17:55 PM UTUTC-4"},{"title":"Tokenizer with Unknown and End-of-Text Tokens","category":"NLP","difficulty":"easy","id":"943","createdAt":"May 17, 2026 at 12:17:55 PM UTUTC-4"},{"title":"Sliding Window Text Dataset Generator","category":"NLP","difficulty":"easy","id":"944","createdAt":"May 17, 2026 at 12:17:55 PM UTUTC-4"},{"title":"Token Embedding Lookup Table","category":"Deep Learning","difficulty":"easy","id":"945","createdAt":"May 17, 2026 at 12:17:55 PM UTUTC-4"},{"title":"Add Positional Embeddings to Token Embeddings","category":"Deep Learning","difficulty":"easy","id":"946","createdAt":"May 17, 2026 at 12:17:55 PM UTUTC-4"},{"title":"Embedding Layer as One-Hot Matrix Multiplication","category":"Deep Learning","difficulty":"easy","id":"947","createdAt":"May 17, 2026 at 12:17:55 PM UTUTC-4"},{"title":"Find Most Frequent Token Pair for BPE","category":"NLP","difficulty":"easy","id":"948","createdAt":"May 17, 2026 at 12:17:55 PM UTUTC-4"},{"title":"Replace Token Pair in BPE Sequences","category":"NLP","difficulty":"easy","id":"949","createdAt":"May 17, 2026 at 12:17:55 PM UTUTC-4"},{"title":"Calculate the Phi Coefficient","category":"Statistics","difficulty":"easy","id":"95","createdAt":null},{"title":"BPE Encode Text Using Merge Table","category":"NLP","difficulty":"medium","id":"950","createdAt":"May 17, 2026 at 12:17:55 PM UTUTC-4"},{"title":"BPE Decode Token IDs to Text","category":"NLP","difficulty":"easy","id":"951","createdAt":"May 17, 2026 at 12:17:55 PM UTUTC-4"},{"title":"BPE Pre-Tokenization with Whitespace Marking","category":"NLP","difficulty":"medium","id":"952","createdAt":"May 17, 2026 at 12:17:55 PM UTUTC-4"},{"title":"Calculate Vocabulary Size from Token List","category":"NLP","difficulty":"easy","id":"953","createdAt":"May 17, 2026 at 12:17:55 PM UTUTC-4"},{"title":"Construct Next-Token Prediction Targets","category":"NLP","difficulty":"easy","id":"954","createdAt":"May 17, 2026 at 12:17:55 PM UTUTC-4"},{"title":"Simple Self-Attention Without Trainable Weights","category":"Deep Learning","difficulty":"easy","id":"955","createdAt":"May 17, 2026 at 4:42:54 PM UTUTC-4"},{"title":"Apply Dropout to Attention Weights","category":"Deep Learning","difficulty":"easy","id":"956","createdAt":"May 17, 2026 at 4:42:54 PM UTUTC-4"},{"title":"Implement Batched Causal Self-Attention","category":"Deep Learning","difficulty":"medium","id":"957","createdAt":"May 17, 2026 at 4:42:54 PM UTUTC-4"},{"title":"Multi-Head Attention via Head Stacking","category":"Deep Learning","difficulty":"medium","id":"958","createdAt":"May 17, 2026 at 4:42:54 PM UTUTC-4"},{"title":"Multi-Head Attention with Combined QKV Weight Matrix","category":"Deep Learning","difficulty":"medium","id":"959","createdAt":"May 17, 2026 at 4:42:54 PM UTUTC-4"},{"title":"Implement the Hard Sigmoid Activation Function","category":"Deep Learning","difficulty":"easy","id":"96","createdAt":"January 16, 2026 at 3:17:10 PM UTC-0500"},{"title":"Implement Multi-Head Attention Using Einsum","category":"Deep Learning","difficulty":"hard","id":"960","createdAt":"May 17, 2026 at 4:42:54 PM UTUTC-4"},{"title":"Implement Module with Register Buffer for Causal Mask","category":"Deep Learning","difficulty":"easy","id":"961","createdAt":"May 17, 2026 at 4:42:54 PM UTUTC-4"},{"title":"Compare Naive vs Stable Softmax for Attention Scores","category":"Deep Learning","difficulty":"easy","id":"962","createdAt":"May 17, 2026 at 4:42:54 PM UTUTC-4"},{"title":"Scale Attention Scores by sqrt(d_k)","category":"Deep Learning","difficulty":"easy","id":"963","createdAt":"May 17, 2026 at 4:42:54 PM UTUTC-4"},{"title":"Transfer Weights from Linear-Style to Parameter-Style Self-Attention","category":"Deep Learning","difficulty":"medium","id":"964","createdAt":"May 17, 2026 at 4:42:54 PM UTUTC-4"},{"title":"Construct Causal Attention Mask via tril and triu Methods","category":"Deep Learning","difficulty":"easy","id":"965","createdAt":"May 17, 2026 at 4:42:54 PM UTUTC-4"},{"title":"Batched Attention Score Computation for Multiple Heads","category":"Deep Learning","difficulty":"medium","id":"966","createdAt":"May 17, 2026 at 4:42:54 PM UTUTC-4"},{"title":"Triton: Write a Constant to Every Element","category":"triton","difficulty":"easy","id":"967","createdAt":"May 18, 2026 at 9:44:41 PM UTUTC-4"},{"title":"Triton: Vector Addition Kernel","category":"triton","difficulty":"easy","id":"968","createdAt":"May 18, 2026 at 9:44:41 PM UTUTC-4"},{"title":"Triton: Element-wise ReLU","category":"triton","difficulty":"easy","id":"969","createdAt":"May 18, 2026 at 9:44:41 PM UTUTC-4"},{"title":"Implement the ELU Activation Function","category":"Deep Learning","difficulty":"easy","id":"97","createdAt":null},{"title":"Triton: Add a Bias Vector to Each Row of a Matrix","category":"triton","difficulty":"medium","id":"970","createdAt":"May 18, 2026 at 9:44:41 PM UTUTC-4"},{"title":"Triton: Row-wise Sum","category":"triton","difficulty":"medium","id":"971","createdAt":"May 18, 2026 at 9:44:41 PM UTUTC-4"},{"title":"Triton: Compute Per-Row Mean and Variance","category":"triton","difficulty":"medium","id":"972","createdAt":"May 18, 2026 at 9:44:41 PM UTUTC-4"},{"title":"Triton: Numerically Stable Fused Softmax","category":"triton","difficulty":"medium","id":"973","createdAt":"May 18, 2026 at 9:44:41 PM UTUTC-4"},{"title":"Triton: Matrix Transpose","category":"triton","difficulty":"medium","id":"974","createdAt":"May 18, 2026 at 9:44:41 PM UTUTC-4"},{"title":"Triton: Block Matrix Multiplication","category":"triton","difficulty":"hard","id":"975","createdAt":"May 18, 2026 at 9:44:41 PM UTUTC-4"},{"title":"Triton: Low-Memory Dropout with Seeded RNG","category":"triton","difficulty":"medium","id":"976","createdAt":"May 18, 2026 at 9:44:41 PM UTUTC-4"},{"title":"PUCT Selection Rule for MCTS","category":"ML","difficulty":"easy","id":"977","createdAt":"May 18, 2026 at 11:08:02 PM UTUTC-4"},{"title":"Monte Carlo Tree Search with Neural Policy and Value","category":"ML","difficulty":"hard","id":"978","createdAt":"May 18, 2026 at 11:08:02 PM UTUTC-4"},{"title":"Build AlphaZero Training Targets from Self-Play","category":"ML","difficulty":"medium","id":"979","createdAt":"May 18, 2026 at 11:08:02 PM UTUTC-4"},{"title":"Implement PReLU Forward and Backward Pass","category":"Deep Learning","difficulty":"medium","id":"98","createdAt":null},{"title":"AlphaZero Policy and Value Loss","category":"Deep Learning","difficulty":"easy","id":"980","createdAt":"May 18, 2026 at 11:08:02 PM UTUTC-4"},{"title":"Go Move Resolution with Captures","category":"ML","difficulty":"medium","id":"981","createdAt":"May 18, 2026 at 11:08:02 PM UTUTC-4"},{"title":"Tromp-Taylor Go Score","category":"ML","difficulty":"medium","id":"982","createdAt":"May 18, 2026 at 11:08:02 PM UTUTC-4"},{"title":"Build Bigram Count Matrix from Words","category":"NLP","difficulty":"easy","id":"983","createdAt":"May 20, 2026 at 9:04:12 AM UTUTC-4"},{"title":"Sample Names from a Bigram Language Model","category":"NLP","difficulty":"medium","id":"984","createdAt":"May 20, 2026 at 9:04:12 AM UTUTC-4"},{"title":"Row-Normalize a Count Matrix to Probabilities","category":"Linear Algebra","difficulty":"easy","id":"985","createdAt":"May 20, 2026 at 9:04:12 AM UTUTC-4"},{"title":"Average Negative Log-Likelihood for Bigram Model","category":"NLP","difficulty":"easy","id":"986","createdAt":"May 20, 2026 at 9:04:12 AM UTUTC-4"},{"title":"Laplace Smoothing for Bigram Probabilities","category":"NLP","difficulty":"easy","id":"987","createdAt":"May 20, 2026 at 9:04:12 AM UTUTC-4"},{"title":"Train Bigram Language Model as a Neural Network","category":"Deep Learning","difficulty":"medium","id":"988","createdAt":"May 20, 2026 at 9:04:12 AM UTUTC-4"},{"title":"MLP Character-Level Language Model Forward Pass","category":"Deep Learning","difficulty":"medium","id":"989","createdAt":"May 20, 2026 at 9:16:00 AM UTUTC-4"},{"title":"Implement the Softplus Activation Function","category":"Deep Learning","difficulty":"easy","id":"99","createdAt":null},{"title":"Learning Rate Range Finder for Linear Regression","category":"Optimization","difficulty":"easy","id":"990","createdAt":"May 20, 2026 at 9:16:00 AM UTUTC-4"},{"title":"Sample from MLP Character Language Model","category":"NLP","difficulty":"medium","id":"991","createdAt":"May 20, 2026 at 9:16:00 AM UTUTC-4"},{"title":"Manual Backprop Through Cross-Entropy Intermediates","category":"Deep Learning","difficulty":"hard","id":"997","createdAt":"May 20, 2026 at 9:56:07 AM UTUTC-4"},{"title":"Reduce Gradient Across Broadcasted Dimensions","category":"Deep Learning","difficulty":"easy","id":"998","createdAt":"May 20, 2026 at 9:56:07 AM UTUTC-4"},{"title":"Backward Pass of Tanh Using Cached Output","category":"Deep Learning","difficulty":"easy","id":"999","createdAt":"May 20, 2026 at 9:56:07 AM UTUTC-4"}],"daily_question":{"title":"Implement a Simple CNN Training Function with Backpropagation","category":"Deep Learning","difficulty":"hard","id":"130"}}