Word Ladder: BFS on Implicit Graphs Explained
Word Ladder (LeetCode 127) is the canonical example of BFS on an implicit graph — the nodes are words, the […]
Graphs
Graphs
Minimum Spanning Tree: Prim’s and Kruskal’s Algorithms
Minimum Spanning Tree problems test whether you can connect all nodes in a weighted graph at minimum total cost —
Graphs
Shortest Path in Weighted Graph: Bellman-Ford Algorithm
Bellman-Ford is the shortest-path algorithm you reach for when Dijkstra fails — specifically when graphs contain negative-weight edges or you
Dynamic Programming
Word Break Problem: Dynamic Programming Solution
Word Break (LeetCode 139) is a string DP problem that tests whether you can partition a string using a given
Dynamic Programming
Edit Distance (Levenshtein): DP Solution Explained
Edit Distance (Levenshtein Distance) is a classic string DP problem that appears in interviews at Google, Microsoft, and Dropbox. It’s
Dynamic Programming
Longest Common Subsequence: DP Solution and Space Optimization
Longest Common Subsequence (LCS) is a fundamental string DP problem that appears in interviews at Google, Microsoft, and Amazon —
Dynamic Programming
0/1 Knapsack Problem: DP Solution with Space Optimization
The 0/1 Knapsack problem is one of the most important DP patterns. Unlike coin change (unbounded knapsack), each item can
Dynamic Programming
Coin Change: Bottom-Up and Top-Down Dynamic Programming
Coin Change (LeetCode 322) is the canonical dynamic programming problem. It tests your ability to identify optimal substructure, choose between
Graphs
Topological Sort: Kahn’s Algorithm and DFS Approach
Topological sort is the graph algorithm you need for scheduling problems: course prerequisites, build systems, task dependencies, and package managers.
Graphs
Number of Islands: Flood Fill Pattern Explained
Number of Islands (LeetCode 200) is the most common entry-level graph problem in technical interviews. It appears at Google, Amazon,
Graphs
Detect a Cycle in a Graph: Directed and Undirected
Cycle detection is asked in interviews at Google, Meta, Amazon, and anywhere that tests graphs. The classic application is deadlock
Graphs
BFS vs DFS: When to Use Each with Examples
BFS and DFS are the two foundational graph traversal algorithms. Every other graph algorithm — Dijkstra, Bellman-Ford, topological sort, cycle
AI/ML Interview Questions
AI Ethics and Fairness: Interview Questions and Technical Framework
AI ethics and fairness questions appear in interviews at every major tech company — and not just for policy roles.
AI/ML Interview Questions
How to Evaluate an LLM: Benchmarks, Human Eval, and Red-Teaming
“How do you evaluate an LLM?” is now a standard interview question at companies building AI products. It tests whether
AI/ML Interview Questions
MLOps Interview Questions: Pipelines, Monitoring, and Deployment
MLOps interviews test whether you can build and maintain ML systems in production — not just train models in notebooks.