Compressed Trie Tree
Hello, people! In this post, we will discuss a commonly used data structure to store strings, the Compress Trie Tree, also known […]
Tag: Data Structures
Binary Heaps and Heapsort Algorithm
Hello people…! In this post I will talk about the Binary Heaps and Heapsort Algorithm implemented using structures and not arrays. This […]
Segment Trees
Hello people…! In this post I will talk about one of the most versatile data structure in competitive programming, the Segment Tree. […]
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, […]
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 […]