47 lines
1.1 KiB
Plaintext
47 lines
1.1 KiB
Plaintext
|
digraph NeetCodeRoadmap {
|
||
|
|
rankdir=TB;
|
||
|
|
node [shape=box, style="rounded,filled", fillcolor="#3f4bd1", fontcolor=white, fontname="Helvetica"];
|
||
|
|
edge [color="#555555", arrowsize=0.8];
|
||
|
|
|
||
|
|
"1" [label="Arrays\n&\nHashing"];
|
||
|
|
"2" [label="Two\nPointers"];
|
||
|
|
"6" [label="Binary\nSearch"];
|
||
|
|
"3" [label="Stack"];
|
||
|
|
"4" [label="Sliding\nWindow"];
|
||
|
|
"5" [label="Linked\nList"];
|
||
|
|
"7" [label="Trees"];
|
||
|
|
"8" [label="Tries"];
|
||
|
|
"9" [label="Heap\nPriority\nQueue"];
|
||
|
|
"10" [label="Backtracking"];
|
||
|
|
"11" [label="Graphs"];
|
||
|
|
"12" [label="1-D\nDynamic\nProgramming"];
|
||
|
|
"13" [label="Intervals"];
|
||
|
|
"16" [label="Greedy"];
|
||
|
|
"17" [label="Advanced\nGraphs"];
|
||
|
|
"18" [label="Math\n&\nGeometry"];
|
||
|
|
"14" [label="2-D\nDynamic\nProgramming"];
|
||
|
|
"15" [label="Bit\nManipulation"];
|
||
|
|
|
||
|
|
"1" -> "2";
|
||
|
|
"2" -> "6";
|
||
|
|
"1" -> "3";
|
||
|
|
"2" -> "4";
|
||
|
|
"2" -> "5";
|
||
|
|
"5" -> "7";
|
||
|
|
"6" -> "7";
|
||
|
|
"7" -> "8";
|
||
|
|
"7" -> "9";
|
||
|
|
"7" -> "10";
|
||
|
|
"10" -> "11";
|
||
|
|
"10" -> "12";
|
||
|
|
"9" -> "13";
|
||
|
|
"9" -> "16";
|
||
|
|
"9" -> "17";
|
||
|
|
"11" -> "17";
|
||
|
|
"11" -> "18";
|
||
|
|
"15" -> "18";
|
||
|
|
"11" -> "14";
|
||
|
|
"12" -> "14";
|
||
|
|
"12" -> "15";
|
||
|
|
}
|