shortest path – techinterview

techinterview.org

Companies
Cheat Sheets
Resume
🎁 Win $100

🎁 Win a $100 Amazon Gift Card →

Topics

System Design
Algorithms
Coding Patterns
AI / ML
Quant Finance
Frontend
Browse all topics

Companies

All companies
Company guides category

Roadmaps

Beginner (0–1y)
Intermediate (2–4y)
Advanced (5+y)

Tools

All tools
Study plan generator
Resume / ATS checker
Total comp calculator
Big-O visualizer
STAR answer builder

Cheat Sheets

Big-O cheat sheet
Algorithm patterns
Problems by difficulty

More

Resume
About
Contact

Skip to content

techinterview

Home
All Problems
By Topic
By Difficulty
Company Guides
System Design
Algorithms
AI/ML Questions
Resume Guides
Quant Finance
Interview Prep

techinterview

About
Advanced Interview Preparation Guide (5+ Years)
Beginner Interview Preparation Guide (0-1 Years)
Big-O Cheat Sheet: Time and Space Complexity Guide
Big-O Complexity Visualizer
Blog
Browse All Topics
Coding Interview Study Plan Generator
Common Algorithm Patterns Cheat Sheet
Complete Problem Index
Contact
Free Interview Prep Tools
Free Resume & ATS Checker
Home
Intermediate Interview Preparation Guide (2-4 Years)
Privacy Policy
Problems by Difficulty
Problems by Topic
STAR Method Answer Builder
Tech Total Comp & Offer Calculator
Terms of Service
Win a $100 Amazon Gift Card — Share an Interview Question

Shortest Path in Weighted Graph: Bellman-Ford Algorithm

techinterview.org / April 16, 2026

4 min read Bellman-Ford is the shortest-path algorithm you reach for when Dijkstra fails — specifically when graphs contain negative-weight edges or you […] Read article

Graphs

Word Ladder: BFS on Implicit Graphs Explained

techinterview.org / April 16, 2026

4 min read Word Ladder (LeetCode 127) is the canonical example of BFS on an implicit graph — the nodes are words, the Read article

Topics

System Design
Coding Patterns
Company Guides
Cheat Sheets
Problem Index

Study Paths

Beginner (0-1y)
Intermediate (2-4y)
Advanced (5+y)

Resources

Big-O Cheat Sheet
Algorithm Patterns
Problems by Difficulty
Problems by Topic

Site

About
Contact
Privacy Policy
Terms of Service

About
|
Contact
|
Privacy Policy
|
Terms of Service

🎁 Win $100share one interview Q →

Scroll to Top

This site uses cookies for analytics and to display ads via Google AdSense. By continuing to use the site you consent to our use of cookies. See our Privacy Policy for details and opt-out links.