Mnt Code Blog

Mnt Code Blog

Home
Notes

December 2024

Interviews (FANG): BFS - Breadth-First Search
In today's article, we’re embarking on an epic journey to uncover the secrets of Breadth-First Search (BFS), an algorithm that helps us explore Trees…
 • 
Mnt Code
Parallel and Distributed Algorithms - Part 2 - How to Get Things Done... Faster!
In today’s article, we’ll continue our journey in the land of parallel and distributed algorithms, but we’ll focus precisely on Parallel Algorithms with…
 • 
Mnt Code
Parallel and Distributed Algorithms - Part 1
Introduction to Parallel and Distributed Algorithms. Part 1: Theoretical article.
 • 
Mnt Code
Clean Code: CRM - Code Readability and Maintainability
When you write clear, maintainable code, you’re not just helping yourself, you’re creating something others can build on and improve. Even small…
 • 
Mnt Code
Dijkstra’s Algorithm - Part 1 (theory)
In this article, we'll talk about the theory of Dijkstra’s Algorithm in the easiest, funnest way possible!
 • 
Mnt Code
Interviews (FANG): Efficient Pattern Searching in Text using KMP!
Let's explore a magical algorithm called "KMP", that can improve your boring string searching algorithm hahah!
 • 
Mnt Code
1

November 2024

© 2025 Mnt Code
Privacy ∙ Terms ∙ Collection notice
Start your SubstackGet the app
Substack is the home for great culture