A quick and practical overview of reducing a number to one using the minimum number of operations.
Also find me here:
Baeldung Author
Said Sryheni
I have a master's degree in software engineering. Currently, I'm working as a full-stack developer with +6 years of experience. I like algorithms and data structures, in addition to solving complex problems by writing clean and reliable code.
Here's what I've written (so far):
Baeldung on Computer Science
- All
- Algorithms (30)
- Math and Logic (11)
- Searching (9)
- Path Finding (9)
- Graphs (8)
- Trees (7)
- Graph Traversal (7)
- Data Structures (7)
- Sorting (6)
- Programming (2)
- Networking (1)
- Core Concepts (1)
Negative Weights Using Dijkstra’s Algorithm
Filed under Path Finding
A quick and practical introduction to dealing with negative weights while using Dijkstra’s algorithm.
Pairing Socks From a Pile Efficiently
Filed under Algorithms, Math and Logic
A quick and practical overview of the sock pairing algorithm.
Finding the Shortest Path in a Graph Visiting All Nodes
Filed under Graph Traversal, Graphs, Path Finding
A quick and practical guide to finding the shortest path in a graph visiting all nodes.
Obtaining the Path in the Uniform Cost Search Algorithm
Filed under Graph Traversal, Graphs, Path Finding
A quick and practical overview of Uniform Cost Search pathfinding algorithm.
How to Merge Sort A Linked List
Filed under Data Structures
A quick and introduction to merge sorting a linked list.
Find Local Minimum in N x N Matrix
Filed under Algorithms, Math and Logic
Learn how to solve the problem of finding the local minimum in an N x N matrix
Flood Fill Algorithm
Filed under Algorithms
A quick and practical overview of the Flood Fill algorithm.
Number of Shortest Paths in a Graph
Filed under Path Finding
A quick and practical guide to finding the number of shortest paths in a graph.