I'm learning, teaching and building from tech!
Nothing here yet.
Dec 10, 2022 · 7 min read · Why learn time and space complexities? If you are an aspiring software engineer, understanding and analyzing algorithms with time and space complexities is crucial! We explore the efficiency of algorithms through the Big O language. What is Big O lan...
Join discussion
Nov 3, 2022 · 4 min read · The two ways to search/traverse a graph are Breadth-First-Search (BFS) and Depth-First-Search (DFS). We will start by learning BFS! 🙂 Breadth-First-Search (BFS): Using the BFS, we can traverse the nodes of a graph level by level. Hence, BFS is al...
Join discussion