Upgrade to PRO for Only $50/Year—Limited-Time Offer! 🔥
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
660
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
350
CodePath SE102 - Session 1 (Fall 2021)
calren
0
790
intro_to_mobile_info_session.pdf
calren
0
75
CodePath Mobile Mentor Training - 2020
calren
0
110
CodePath Android University - Prework Session
calren
0
110
CodePath Android University - Info Session
calren
0
130
SE103 - Week 9, Session 1
calren
0
560
SE103 - Week 9, Session 2
calren
0
460
SE103 - Week 10, Session 1
calren
0
370
Featured
See All Featured
Understanding Cognitive Biases in Performance Measurement
bluesmoon
32
2.7k
Fantastic passwords and where to find them - at NoRuKo
philnash
52
3.5k
Cheating the UX When There Is Nothing More to Optimize - PixelPioneers
stephaniewalter
285
14k
The Art of Delivering Value - GDevCon NA Keynote
reverentgeek
16
1.8k
GraphQLとの向き合い方2022年版
quramy
50
14k
Learning to Love Humans: Emotional Interface Design
aarron
274
41k
The Art of Programming - Codeland 2020
erikaheidi
56
14k
Intergalactic Javascript Robots from Outer Space
tanoku
273
27k
BBQ
matthewcrist
89
9.9k
Imperfection Machines: The Place of Print at Facebook
scottboms
269
13k
Done Done
chrislema
186
16k
The Pragmatic Product Professional
lauravandoore
37
7.1k
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