mirror of
https://github.com/yangshun/tech-interview-handbook.git
synced 2025-07-28 04:33:42 +08:00
contents: revamp basic algo content
This commit is contained in:
@ -65,28 +65,36 @@ module.exports = {
|
||||
],
|
||||
},
|
||||
{
|
||||
'Algorithms tips': [
|
||||
'Algorithms cheatsheets': [
|
||||
'algorithms/algorithms-introduction',
|
||||
'algorithms/array',
|
||||
'algorithms/binary',
|
||||
'algorithms/dynamic-programming',
|
||||
'algorithms/geometry',
|
||||
'algorithms/graph',
|
||||
'algorithms/hash-table',
|
||||
'algorithms/heap',
|
||||
'algorithms/interval',
|
||||
'algorithms/linked-list',
|
||||
'algorithms/math',
|
||||
'algorithms/matrix',
|
||||
'algorithms/oop',
|
||||
'algorithms/permutation',
|
||||
'algorithms/queue',
|
||||
'algorithms/recursion',
|
||||
'algorithms/sorting-searching',
|
||||
'algorithms/stack',
|
||||
'algorithms/string',
|
||||
'algorithms/tree',
|
||||
'algorithms/trie',
|
||||
{
|
||||
Basics: [
|
||||
'algorithms/array',
|
||||
'algorithms/string',
|
||||
'algorithms/sorting-searching',
|
||||
'algorithms/recursion',
|
||||
'algorithms/hash-table',
|
||||
],
|
||||
'Data structures': [
|
||||
'algorithms/linked-list',
|
||||
'algorithms/queue',
|
||||
'algorithms/stack',
|
||||
],
|
||||
'Non-linear data structures': [
|
||||
'algorithms/tree',
|
||||
'algorithms/heap',
|
||||
'algorithms/graph',
|
||||
'algorithms/trie',
|
||||
'algorithms/matrix',
|
||||
'algorithms/interval',
|
||||
],
|
||||
Additional: [
|
||||
'algorithms/binary',
|
||||
'algorithms/math',
|
||||
'algorithms/geometry',
|
||||
'algorithms/dynamic-programming',
|
||||
],
|
||||
},
|
||||
],
|
||||
},
|
||||
{
|
||||
|
Reference in New Issue
Block a user