AI Exploration Journey

Home
RAG
Document Parsing
LLMs
Data Structures
Archive
Leaderboard
About

Data Structures and Algorithms

Famous Algorithm with core code no more than 5 lines: Floyd-Warshall Algorithm
This article introduces the concept of the Floyd-Warshall algorithm, two typical example problems, and their corresponding solutions.
 • 
Florian
Longest Common Increasing Subsequence(LCIS)
This article introduces an interesting and challenging dynamic programming problem, demonstrating the diverse and challenging nature of DP.
 • 
Florian
Unveiling the Bounded Knapsack Problem
The Bounded Knapsack Problem is a classic dynamic programming problem.
 • 
Florian
Discretization in the field of algorithms
In the field of algorithm design, discretization is a simple but very useful technique, which can be seen as a form of hashing.
 • 
Florian
Unveiling the Unbounded Knapsack Problem
The unbounded knapsack problem is an important subtopic of dynamic programming, with significant applications in many fields.
 • 
Florian
The Charm of Data Structures 1: Leetcode 1906.
Leetcode 1906. Minimum Absolute Difference Queries: Segment tree or binary search
 • 
Florian
Longest Common Subsequence(LCS) of Two Permutations
By a clever transformation, the classic LCS problem is converted to an LIS problem, thereby reducing the time complexity.
 • 
Florian
Introduction to Suffix Array
Suffix array is a powerful data structure for solving string problems, which has applications in many fields.
 • 
Florian
Segment Tree 2: Interval Update and Lazy Propagation
This article explains interval update and lazy propagation of segment tree, including insight and operations in detail.
 • 
Florian
Segment Tree 1: Basic Concepts and Operations in Detail
By creating advanced data structures like segment trees ahead of time, we can perform two operations, query and update, in O(logn) time…
 • 
Florian
Introduction to monotonic stack that everyone can understand
In this article, we have explored the intuition behind the monotonic stack algorithm with a typical algorithm problem.
 • 
Florian
Typical problems of Fenwick Tree (Binary Indexed Tree)
This article will introduce some typical problems of Fenwick Tree (Binary Indexed Tree), mainly from leetcode and codeforces.
 • 
Florian
© 2025 Florian June
Privacy ∙ Terms ∙ Collection notice
Start WritingGet the app
Substack is the home for great culture