Hon to necoQ ni ze Hhieh data smue urn tun

n dues 9mivr)

OTho Point l stidig nindon

L ATT ay is ed )
Prolole
Ho) u , Trteswm
mot on knda
Sum
not dslrHing he Logic
ne ane
b y Sing b0 theT to
means avmay elemen pos ithon dokhnt

ans
ge+ he opimal

2 6hdinq omdon

h'guoe -is no thene)

LLongrst sub arvtay Con
SuoS tnin9 olmg wih Has hing (map

Hashing
o store
o re the valua l/Ke
the valua lih
nee d
L hen you
val O Like get Pareautncy
map he
the pas'tome In tmaureryina
Lrememben
Hme
valua io tuwie 60 i a l
Using Pse

binany Search
L Find the Tminim um 0r the mamum-

T no neccesany thoUnay h a s to b e
301ed ( e k l l s pah n Aogresiv con)
LMom0tomo u) inolenin or de eheasino M
LOWOT bo Un d, up pen bound (Tlansc in ghn)
 Arapping Hain naler
Staek and Queue
(neah rnler element)
rmo tmic stack
at a polot ahd ygw
when you n e sto nding
h hich Hs he La elemen tho
need to kpo
+than y0u NGTE Nethgean
was (smaller
NSE Necsmailegn
grea Ler

QueL
QueuL in 0Ta ph
LBU Cache 4 LFU cache
and groph(ldely Uxd)
Ltree

Linked Lis
lscho
B i t Manipuletiom

PoweTEW

RecuwTsion
(min, maz, priot) Al) Pasgible way).
LOuwo+ all
all div
me he beSt
t n 4 out
ane veny mpimal (1,15 ,16. )
lonshnaing
has to b n ecnnsi m
T
Pro blemS/Sub seamtnc / Count N
All 6Ulb s e
HOUS
Pick and Noh Pek
SocR )raclzing
Back roaclcing Recus on

N&wen
Rale in ma
Sudo ku solve

M Colo wung pTob lem

g ree dy Algo
thene can heroi bu
thene 0 P a Hu1n
T
a patoTn
nead h e problCm
means
Mhen 9 Ou
GTsee dy
whattroT YowT her says

my n 105 Fesko rase

(ST, 8T)
Trees.
Standond veshon 6tnive (59)
Te ome
Thene playlist

GTrBphs
Oranse Num ber is londs )
omi2 (00Hm
hulhisounce BFS W
a1garithm
DOF HEG patn
Disaoiose ( a n k or Path Compres )
(sh)
MST
Ps(n inimum span ree)
Torplogirats (COwst sebdulLe on Le)
Sehe dul
Dynaemite Pro@romming
L D 0P
2 D PP
check DP SmiveT playlist+)
(acholl y
all Patonns r e corened

maimu)
XOR Pro blem
suftin (Gtning one)
9ges Pref

Stming
Patcin matching9
/ Aabbincap/kmp
x