Explore algorithms for rotating two-dimensional matrices.
I'm a software architect and engineer. My main experience is in desktop development and system programming using C++ tech stack, and web back-end development in Java and Python ecosystems. I'm very passionate about math, algorithms, data structures, and software architecture.
Here's what I've written (so far):
Baeldung on Computer Science
- Trees (5)
- Data Structures (5)
- Sorting (2)
- Searching (2)
- Graphs (2)
- Graph Traversal (2)
- Path Finding (1)
- Networking (1)
- Math and Logic (1)
- Algorithms (1)
Explore the patience sort algorithm.
Explore Ukkonen’s algorithm for building suffix trees in linear time.
Learn about the Tarjan’s algorithm for finding strongly connected components in directed graphs.
Explore the tournament sort algorithm.
Learn about the Edmonds-Karp algorithm for finding the maximum flow in network graphs.
Learn about the Splay Tree data structure.
Learn about the Johnson’s algorithm.
Learn about the level-order traversal of binary trees.
Explore the differences between segment trees, binary indexed trees, interval trees, and range trees.
Study the fundamentals of ternary search trees.
Learn how to use an array for Max Heap representation.
Explore the Kosaraju’s algorithm for finding strongly connected components in a graph.
Learn how to implement a stack using the fixed-size array representation.
Compare skip lists and balanced binary search trees using various criteria.
Learn about the disjoint set union data structure, along with some key optimizations for it.