Learn about sparse tables in detail.

### Also find me here:

# Baeldung Author

## Gang Wu

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

### Hash Table Vs. Trie (Prefix Tree)

Filed under Data Structures

Learn how to solve problems with hash tables and tries.

### Vertical and Horizontal Tables in LaTeX

Filed under Latex

Learn how to create different types of LaTeX tables.

### Graph Adjacency and Incidence

Filed under Graphs

Learn how to represent graphs with Adjacency and Incidence

### Finding Arrangements of Blocks With L Left Visible Blocks and R Right Visible Blocks

Filed under Algorithms

Learn about a classic problem to find the possible arrangments of blocks to make L visible from the left and R from the right.

### Finding the Largest Balanced Subarray

Filed under Searching

Learn how to find the largest balanced subarray.

### Finding Three Elements in an Array Whose Sum Is Closest to a Given Number

Filed under Data Structures, Math and Logic

Learn how to find three elements in an array such that the sum is closest to a given number.

### Calculate the Number of Binary Search Trees with N Distinct Elements

Filed under Algorithms, Searching

Learn how to calculate the number of possible binary trees from the number of nodes.

### Number of Nodes in a Binary Tree With Level N

Filed under Graph Traversal, Trees

Learn how to calculate the minimum and maximum number of nodes in binary trees

### Print All Paths With a Given Sum in a Binary Tree

Filed under Graph Traversal, Trees

Learn how to construct a binary tree path sum sequence in linear time