## Trie Tree Implementation

Posted on

Note – Theory of Programming is shifting to YouTube! This post has a video. Watch it at – https://www.youtube.com/watch?v=EbamlevPlxY Hoping you’ll support the YouTube channel just like you have greatly supported the website! 🙂 Hello people…! In this post we will talk about the Trie Tree Implementation. Trie Trees are are used to search for all […]

## Dijkstra’s Algorithm

Posted on

Hello, people…! In this post, I will talk about one of the fastest single source shortest path algorithms, which is, the Dijkstra’s Algorithm. The Dijkstra’s Algorithm works on a weighted graph with non-negative edge weights and gives a Shortest Path Tree. It is a greedy algorithm, which sort of mimics the working of breadth first search […]

## Binary Heaps

Posted on

Hello people…! In this post I will talk about Binary Heaps, or, more casually called as Heaps. Binary Heaps are used to implement Priority Queues which are associated with Scheduling. Binary Heaps is a starting step to learn many advanced heap related Data Structures that are used in many algorithms. So let’s understand the need […]

## Depth First Search Algorithm

Posted on

Hello people…! In this post I will talk about the other Graph Search Algorithm, the Depth First Search Algorithm. Depth First Search is different by nature from Breadth First Search. As the name suggests, “Depth”, we pick up a vertex S and see all the other vertices that can possibly reached by that vertex S and […]

## Snakes and Ladders Game Code

Posted on

Note – Theory of Programming is shifting to YouTube! This post has a video. Watch it at – https://www.youtube.com/watch?v=a3_QGPthIDU Hoping you’ll support the YouTube channel just like you have greatly supported the website! 🙂 Hello people…! In this post, we will discuss about the Snakes and Ladders Game Code, where we find the shortest path […]

Posted on

Note – Theory of Programming is shifting to YouTube! This post has a video. Watch it at – https://www.youtube.com/watch?v=5mG-qBRhvKQ Hoping you’ll support the YouTube channel just like you have greatly supported the website! 🙂 Hello people…! In this post I will explain one of the most widely used Graph Search Algorithms, the Breadth First Search […]

## Graph Theory Basics

Posted on

Note – Theory of Programming is shifting to YouTube! This post has a video. Watch it at – https://www.youtube.com/watch?v=NaV03tiHTQw Hoping you’ll support the YouTube channel just like you have greatly supported the website! 🙂 Hello people…! In this post, I will talk about Graph Theory Basics, which are its terminologies, types and implementations in C. […]

## Binary Indexed Tree (or) Fenwick Tree

Posted on

Every programmer needs a suitable data structure to compute some complex function or to do a time-taking task quickly. In this post, I will explain the Binary Indexed Tree (BIT) data structure also known as the Fenwick Tree in post-soviet countries. This data structure is very easy to code in competitions. So, a programmer who […]

## Modular Arithmetic Properties

Posted on

In competitive programming, Modular Arithmetic Properties are essential tools in solving big number problems. In the problem statement, whenever they say, “print the answer  “, it’s not that simple. You may have worked a lot to get the logic, but the output must be given as they say. You may get your answer stored in a […]