A quick and practical overview of the Sliding Window algorithm.
I am a backend JEE developer specialized in technologies like Spring and Hibernate with +3 years of experience. I have been an ICPC competitive programmer using C++ for +5 years. You can check my ICPCID on https://icpc.baylor.edu/ICPCID/VHOFJ5IO88M4
Here's what I've written (so far):
A quick and practical overview of Kruskal’s and Prim’s algorithms.
A quick and practical guide to finding the shortest path that visits certain nodes in a weighted graph.
1. Overview In graph theory, a tree is a special case of graphs. In this tutorial, we’ll explain how to check if a given graph forms a tree. We’ll explain the concept of trees, and what it means for a graph to form a tree. Also, we’ll discuss both directed and undirected graphs. Finally, we’ll […]
A quick and practical overview of differences between linear and binary search.
A quick and practical guide to finding the Maximum-Minimum capacity for a node in a graph.
A quick and practical explanation of the longest palindromic subsequence problem.
Learn about the Knuth-Morris-Pratt algorithm that searches for occurrences of a word inside a large text
Learn how BFS and Dijkstra’s algorithms work to find the shortest path from one node to all other nodes in a graph.