A quick and practical overview of the Sliding Window algorithm.

### Also find me here:

# Baeldung Author

## Said Sryheni

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):

### Kruskal’s vs Prim’s Algorithm

Filed under Graph Traversal, Trees

A quick and practical overview of Kruskal’s and Prim’s algorithms.

### Shortest Path to Certain Nodes in a Graph

Filed under Graph Traversal, Graphs

A quick and practical guide to finding the shortest path that visits certain nodes in a weighted graph.

### Determining Whether a Directed or Undirected Graph Is a Tree

Filed under Algorithms, Graphs, Trees

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 […]

### Linear Search vs Binary Search

Filed under Searching

A quick and practical overview of differences between linear and binary search.

### Finding the Maximum-Minimum Capacity For a Node in a Graph

Filed under Algorithms, Graphs

A quick and practical guide to finding the Maximum-Minimum capacity for a node in a graph.

### Longest Palindromic Subsequence With Dynamic Programming

Filed under Algorithms, Programming

A quick and practical explanation of the longest palindromic subsequence problem.

### Knuth-Morris-Pratt Algorithm

Filed under Graph Traversal

Learn about the Knuth-Morris-Pratt algorithm that searches for occurrences of a word inside a large text

### Difference Between BFS and Dijkstra’s Algorithms

Filed under Graph Traversal, Path Finding

Learn how BFS and Dijkstra’s algorithms work to find the shortest path from one node to all other nodes in a graph.