Learn about stack structures for fast lookup.
Gang Wu has over 15 years of experience as a software developer in multiple industries. He is proficient in software design and implementation with various programming languages, such as Java, C++, C#, etc. For the past five years, he has been working on web applications with Java technologies. When he is not writing code, he enjoys playing games and watching movies with his family.
Here's what I've written (so far):
Baeldung on Computer Science
- Data Structures (8)
- Algorithms (8)
- Trees (5)
- Searching (2)
- Math and Logic (2)
- Graphs (2)
- Programming (1)
- Path Finding (1)
- Latex (1)
- Graph Traversal (1)
- Graph Theory (1)
- Artificial Intelligence (1)
Learn more about Fenwick Trees.
Learn about sparse tables in detail.
Learn how to solve problems with hash tables and tries.
Learn how to create different types of LaTeX tables.
Learn how to represent graphs with Adjacency and Incidence
Learn about a classic problem to find the possible arrangments of blocks to make L visible from the left and R from the right.
Learn how to find the largest balanced subarray.
Learn how to find three elements in an array such that the sum is closest to a given number.
Learn how to calculate the number of possible binary trees from the number of nodes.
Learn how to calculate the minimum and maximum number of nodes in binary trees
Learn how to construct a binary tree path sum sequence in linear time
Learn how to represent a polynomial with the linked list data structure.
Learn algorithms to serialize and deserialize a binary tree
Learn how to use both Dijkstra’s algorithm and the uniform-cost search algorithm to find the shortest paths between vertices in a graph
Learn about the ways to quantify the similarity of strings
Learn two linear-time algorithms that can check if a linked list is a circular linked list
Have a look at the algorithm for reversing a linked list.
Learn how to check whether a binary tree structure is symmetric, using either a recursive solution or an iterative approach.
Learn how to make a topological sort on a DAG in linear time
Learn the difference between Minimum Spanning Trees and Shortest Path Trees