Develop a Mindmapping software

Posted on February 14, 2020

...To be continued

Blog Rendering test

Link Test hello

Finding The Optimal Sub Problems

DFS, BFS, Backtracking, DP, Divide and conqure

Test for heading

Test jreiwjof s fhdiowha iods hfiudsah fehio

Finding The Data Structure

Stack, Heap, Binary Tree, Union-find

Finding The Algorithm

KMP, Round-robin. Prefix Sum, Reservoir Sampling, Two pointers, Topological Sort, Greedy, random selection

  1. Try to guess time complexity Especially O(n)
  2. Use Recursion
  3. Derive some knowledge

Inline code test console.log('123') test

fewfewfew
fewfewfew
fewfe

def saySometing():
    print("HelloWorld")
def saySometing():
    print("HelloWorld")
def saySometing():
    print("HelloWorld")

1231111

function(){
    console.log("Hello")
}

123321

Quot
Quot
Quot

🏷 test