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
470
SE103 - Week 10, Session 1
calren
0
370
Featured
See All Featured
The Straight Up "How To Draw Better" Workshop
denniskardys
239
140k
Reflections from 52 weeks, 52 projects
jeffersonlam
355
21k
Into the Great Unknown - MozCon
thekraken
40
2.2k
Balancing Empowerment & Direction
lara
5
800
The Cost Of JavaScript in 2023
addyosmani
55
9.3k
A better future with KSS
kneath
240
18k
[Rails World 2023 - Day 1 Closing Keynote] - The Magic of Rails
eileencodes
37
2.6k
Building a Modern Day 
E-commerce SEO Strategy
aleyda
45
8.3k
It's Worth the Effort
3n
187
29k
Rebuilding a faster, lazier Slack
samanthasiow
84
9.3k
Helping Users Find Their Own Way: Creating Modern Search Experiences
danielanewman
31
3k
Fashionably flexible responsive web design (full day workshop)
malarkey
407
66k
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