Curated Collection of Algorithm and Data Structure Problems with Solution Articles
This article compiles a comprehensive list of over 400 algorithm and data‑structure problem solutions—including dynamic programming, backtracking, DFS/BFS, binary‑tree, linked‑list, stack, sorting, searching and classic puzzles—organized by topic and linked to detailed explanations for easy reference.
Below is a curated index of algorithm and data‑structure problem solutions authored by Bo Ge, covering more than 400 classic problems with detailed explanations and code snippets, grouped by technique or data structure.
Dynamic Programming 465. 递归和动态规划解三角形最小路径和 430. 剑指 Offer-动态规划求正则表达式匹配 423. 动态规划和递归解最小路径和 ... (other DP links omitted for brevity)
Backtracking Algorithms 451. 回溯和位运算解子集 450. 什么叫回溯算法，一看就会，一写就废 ... (other backtracking links omitted)
DFS and BFS Related Problems 455. DFS和BFS解被围绕的区域 453. DFS和BFS解求根到叶子节点数字之和 ... (other DFS/BFS links omitted)
Two‑Pointer Techniques 466. 使用快慢指针把有序链表转换二叉搜索树 398. 双指针求无重复字符的最长子串 ... (other two‑pointer links omitted)
Binary‑Tree Related Algorithms 464. BFS和DFS解二叉树的所有路径 458. 填充每个节点的下一个右侧节点指针 II ... (other tree links omitted)
Linked‑List Algorithms 463. 判断回文链表的3种方式 462. 找出两个链表的第一个公共节点 ... (other linked‑list links omitted)
Stack, Queue and Other Classic Algorithms 438. 剑指 Offer-栈的压入、弹出序列 437. 剑指 Offer-包含min函数的栈 ... (other classic links omitted)
Sorting Algorithms 101. 排序-冒泡排序 102. 排序-选择排序 ... (other sorting links omitted)
Search Algorithms 201. 查找-顺序查找 202. 查找-二分法查找 ... (other search links omitted)
For the full list of 400+ problems and their detailed write‑ups, visit the "Data Structures and Algorithms" public account.
DataFunTalk
Dedicated to sharing and discussing big data and AI technology applications, aiming to empower a million data scientists. Regularly hosts live tech talks and curates articles on big data, recommendation/search algorithms, advertising algorithms, NLP, intelligent risk control, autonomous driving, and machine learning/deep learning.
How this landed with the community
Was this worth your time?
0 Comments
Thoughtful readers leave field notes, pushback, and hard-won operational detail here.