Upgrade to Pro
— share decks privately, control downloads, hide ads and more …
Speaker Deck
Features
Speaker Deck
PRO
Sign in
Sign up for free
Search
Search
CodePath SE102 - Linked List (Week II), Session 1
Search
Caren
June 02, 2019
0
650
CodePath SE102 - Linked List (Week II), Session 1
Caren
June 02, 2019
Tweet
Share
More Decks by Caren
See All by Caren
CodePath - Linked List
calren
0
320
CodePath SE102 - Session 1 (Fall 2021)
calren
0
740
intro_to_mobile_info_session.pdf
calren
0
57
CodePath Mobile Mentor Training - 2020
calren
0
77
CodePath Android University - Prework Session
calren
0
94
CodePath Android University - Info Session
calren
0
100
SE103 - Week 9, Session 1
calren
0
520
SE103 - Week 9, Session 2
calren
0
420
SE103 - Week 10, Session 1
calren
0
330
Featured
See All Featured
Site-Speed That Sticks
csswizardry
4
380
Fight the Zombie Pattern Library - RWD Summit 2016
marcelosomers
233
17k
Save Time (by Creating Custom Rails Generators)
garrettdimon
PRO
29
1k
jQuery: Nuts, Bolts and Bling
dougneiner
63
7.6k
個人開発の失敗を避けるイケてる考え方 / tips for indie hackers
panda_program
100
18k
Docker and Python
trallard
44
3.3k
Typedesign – Prime Four
hannesfritz
40
2.5k
Evolution of real-time – Irina Nazarova, EuRuKo, 2024
irinanazarova
6
550
Six Lessons from altMBA
skipperchong
27
3.6k
Product Roadmaps are Hard
iamctodd
PRO
50
11k
We Have a Design System, Now What?
morganepeng
51
7.4k
Designing for Performance
lara
604
68k
Transcript
Linked Lists Week 4
How was HackerRank?
Confusions / common problems with Linked Lists?
Linked List Tips and Tricks
Linked List Tips and Tricks Take multiple passes through the
linked list - get length - save other information about contents Two pointers - ‘race car’ strategy with one regular pointer, and one fast pointer Dummy node - helpful for preventing errors when returning ‘head’
Understand Match Pseudocode / Plan Implement Review Evaluate
Understand Match Pseudocode / Plan Implement Review Evaluate
Reverse Linked List Understand -> Match -> Plan -> Implement
In class exercise Understand -> Match -> Plan -> Implement
In class exercise Understand -> Match -> Plan -> Implement
Try to spend ~15 minutes on a problem
In class exercise Understand -> Match -> Plan -> Implement
Try to spend ~15 minutes on a problem Goal for each problem is to have it pass a simple test case