Word Ladder: BFS on Implicit Graphs Explained
4 min read Word Ladder (LeetCode 127) is the canonical example of BFS on an implicit graph — the nodes are words, the […] Read article
Graphs
Graphs
Clone a Graph: Deep Copy with DFS and BFS
2 min read Clone a Graph (LeetCode 133) is a foundational graph problem that tests your understanding of deep copy vs shallow copy, Read article
Recursion
N-Queens Problem: Backtracking Solution with Optimizations
2 min read The N-Queens problem is the classic backtracking problem. It places N chess queens on an N×N board so no two Read article
Dynamic Programming
0/1 Knapsack Problem: DP Solution with Space Optimization
3 min read The 0/1 Knapsack problem is one of the most important DP patterns. Unlike coin change (unbounded knapsack), each item can Read article
Dynamic Programming
Longest Common Subsequence: DP Solution and Space Optimization
3 min read Longest Common Subsequence (LCS) is a fundamental string DP problem that appears in interviews at Google, Microsoft, and Amazon — Read article
Dynamic Programming
Edit Distance (Levenshtein): DP Solution Explained
3 min read Edit Distance (Levenshtein Distance) is a classic string DP problem that appears in interviews at Google, Microsoft, and Dropbox. It’s Read article
Dynamic Programming
Word Break Problem: Dynamic Programming Solution
2 min read Word Break (LeetCode 139) is a string DP problem that tests whether you can partition a string using a given Read article
Dynamic Programming
Coin Change: Bottom-Up and Top-Down Dynamic Programming
2 min read Coin Change (LeetCode 322) is the canonical dynamic programming problem. It tests your ability to identify optimal substructure, choose between Read article
Graphs
Detect a Cycle in a Graph: Directed and Undirected
4 min read Cycle detection is asked in interviews at Google, Meta, Amazon, and anywhere that tests graphs. The classic application is deadlock Read article
Graphs
Number of Islands: Flood Fill Pattern Explained
4 min read Number of Islands (LeetCode 200) is the most common entry-level graph problem in technical interviews. It appears at Google, Amazon, Read article
Graphs
Topological Sort: Kahn’s Algorithm and DFS Approach
3 min read Topological sort is the graph algorithm you need for scheduling problems: course prerequisites, build systems, task dependencies, and package managers. Read article
Graphs
BFS vs DFS: When to Use Each with Examples
5 min read BFS and DFS are the two foundational graph traversal algorithms. Every other graph algorithm — Dijkstra, Bellman-Ford, topological sort, cycle Read article
AI/ML Interview Questions
MLOps Interview Questions: Pipelines, Monitoring, and Deployment
6 min read MLOps interviews test whether you can build and maintain ML systems in production — not just train models in notebooks. Read article
AI/ML Interview Questions
How to Evaluate an LLM: Benchmarks, Human Eval, and Red-Teaming
5 min read “How do you evaluate an LLM?” is now a standard interview question at companies building AI products. It tests whether Read article
AI/ML Interview Questions
AI Ethics and Fairness: Interview Questions and Technical Framework
5 min read AI ethics and fairness questions appear in interviews at every major tech company — and not just for policy roles. Read article