flowchart TB
%%{init: {'theme':'darkmode'}}%%
%% Colors %%
linkStyle default stroke-width:2px
classDef blue fill:#2374f7,stroke:#000,stroke-width:2px,color:#fff
classDef orange fill:#fc822b,stroke:#000,stroke-width:2px,color:#fff
classDef green fill:#16b552,stroke:#000,stroke-width:2px,color:#fff
classDef red fill:#ed2633,stroke:#000,stroke-width:2px,color:#fff
classDef magenta fill:magenta,stroke:#000,stroke-width:2px,color:#fff

BS(Binary Search) --> PQ(PriorityQueue) 
BS(Binary Search) --> BT(BackTracking) --> DP(1-D DP)

%% Clickable Links %%
click DP "<https://typhoon-longship-2b1.notion.site/1-D-DP-823922d7f3d24fb9982df5b47dac9bac?pvs=4>"
click BT "<https://typhoon-longship-2b1.notion.site/BackTracking-Branch-Bound-1a2606a4790a4f4c91730986af5a4787?pvs=4>"
click BS "<https://typhoon-longship-2b1.notion.site/Binary-search-e377a1fdc49c43f38a7ce02302179be3?pvs=4>"
click PQ "<https://typhoon-longship-2b1.notion.site/Heap-Priority-queue-03b7b76731304bca9748cca0c3b36eff>"

This is a set of notes and thoughts of my first time going through DSA outside school.

I’m following neetcode’s roadmap : https://neetcode.io/roadmap

BackTracking(Branch & Bound)

1-D DP

Binary search

Heap/Priority queue