Two algorithms you must know for a software engineering interview | Tech Tutorials
Depth-First Search (DFS) and Breadth-First Search (BFS) are very well know algorithms if you studied computer science, but for some self-taught people this algorithms are not so well known.
Graph theory helps you to solve several problems and having this two algorithms in mind could save your interview. Actually some big companies will ask you to solve problems that use this DFS or BFS.
We are going to show you how to remember DFS and BFS algorithms very easily. All examples will be made with Python.
Read full article from Two algorithms you must know for a software engineering interview | Tech Tutorials
No comments:
Post a Comment