Bellman Ford Algorithm
Hello people…! In this post I will talk about another single source shortest path algorithm, the Bellman Ford Algorithm. Unlike Dijkstra’s Algorithm, […]
Author: Vamsi
Trie Tree Implementation
Note – Theory of Coding is also on YouTube! This post has a video. Watch it at – https://www.youtube.com/watch?v=EbamlevPlxY Hoping you’ll support […]
Dijkstra’s Algorithm
Hello, people…! In this post, I will talk about one of the fastest single source shortest path algorithms, which is, the Dijkstra’s Algorithm. […]
Binary Heaps
Hello people…! In this post I will talk about Binary Heaps, or, more casually called as Heaps. Binary Heaps are used to […]
Depth First Search Algorithm
Hello people…! In this post I will talk about the other Graph Search Algorithm, the Depth First Search Algorithm. Depth First Search […]
Snakes and Ladders Game Code
Note – Theory of Coding is also on YouTube! This post has a video. Watch it at – https://www.youtube.com/watch?v=a3_QGPthIDU Hoping you’ll support […]
Breadth First Search Algorithm
Note – Theory of Coding is also on YouTube! This post has a video. Watch it at – https://www.youtube.com/watch?v=5mG-qBRhvKQ Hoping you’ll support […]
Graph Theory Basics
Hello people…! In this post, I will talk about Graph Theory Basics, what are its terminologies, types and implementations in C. Graphs […]
Binary Indexed Tree (or) Fenwick Tree
Every programmer needs a suitable data structure to compute some complex function or to do a time-taking task quickly. In this post, […]
Modular Arithmetic Properties
In competitive programming, Modular Arithmetic Properties are essential tools in solving big number problems. In the problem statement, whenever they say, “print […]