I know the basics: DFS, BFS, Topological Sort.
Which of the other one's do I need to be safe for interviews at #microsoft , #facebook , #google , #apple , #snap ( #snapchat )?
Union Find
Djikstra
Minimum Spanning Tree (Kruskal + Prim)
Bellman-Ford
Any other's I'm missing?
Also, I find BFS traversal of graph much easier than DFS traversal conceptually, must be how my brain is wired. I always opt to use BFS if both options are viable.
When is DFS the only viable option, or the much better option compared to BFS? Is there a quintessential question on Leetcode that demonstrates the necessity of DFS over BFS?
Want to see the real deal?
More inside scoop? View in App
More inside scoop? View in App
blind
SUPPORT
FOLLOW US
DOWNLOAD THE APP:
FOLLOWING
Industries
Job Groups
- Software Engineering
- Product Management
- Information Technology
- Data Science & Analytics
- Management Consulting
- Hardware Engineering
- Design
- Sales
- Security
- Investment Banking & Sell Side
- Marketing
- Private Equity & Buy Side
- Corporate Finance
- Supply Chain
- Business Development
- Human Resources
- Operations
- Legal
- Admin
- Customer Service
- Communications
Return to Office
Work From Home
COVID-19
Layoffs
Investments & Money
Work Visa
Housing
Referrals
Job Openings
Startups
Office Life
Mental Health
HR Issues
Blockchain & Crypto
Fitness & Nutrition
Travel
Health Care & Insurance
Tax
Hobbies & Entertainment
Working Parents
Food & Dining
IPO
Side Jobs
Show more
SUPPORT
FOLLOW US
DOWNLOAD THE APP:
comments
Don't really need minim spanning or bellman ford unless someone is trying to be a jackass with their interview question
I also find BFS much easier to understand than DFS. No recursion and "backtracking" involved in BFS.