Linked Lists
Sequences built from nodes that point onward.
3 subjects · 4 topics · 2 cheatsheets
Subjects covering this category
3 subjects- Subject · Intermediate to Advanced
Recognising which of the common problem-solving patterns an unseen coding problem needs, and solving it in Python, Java or TypeScript within the time an interview allows.
- Approach
- Array and Number Patterns
- Linked List Patterns
- Subject · Beginner to Advanced
Choosing a data structure by the cost of its operations, and implementing arrays, linked lists, stacks, queues, hash tables, trees, heaps, tries and graphs in Python, Java and TypeScript.
- Measuring Cost
- Sequences and Lookup
- Recursion and Trees
- Subject · Intermediate to Advanced
Tracing, implementing and proving the cost of the classic searching, sorting and graph algorithms, and designing new ones with divide and conquer, backtracking, greedy choice and dynamic programming, in Python, Java and TypeScript.
- Searching and Simple Sorting
- Efficient Sorting
- Design Strategies
Cheatsheets
2 cheatsheets- Cheatsheet · Data Structures
Every data structure in the subject on one page: what each one is for, what its operations cost, and how to choose.
- Cheatsheet · Coding Interview Patterns
Fourteen coding interview patterns on one page: the property that points to each, what it costs, when it fails, and its loop in Python.
In Linked Lists itself
4 topics- Data Structures
Linked lists: nodes joined by references, so inserting and deleting is a rewire instead of a shift, at the price of reading by position.
Beginner to Intermediate9 cards · 4 qnot started
- Coding Interview Patterns
Fast and slow pointers: two pointers moving at different speeds that find a list's middle, detect a cycle and locate where the cycle starts.
Intermediate to Advanced8 cards · 4 qnot started
- Coding Interview Patterns
Linked list reversal: reversing a linked list in place with three references, and reversing part of a list or groups of nodes with a dummy node.
Intermediate to Advanced8 cards · 4 qnot started
- Algorithms
Merge sort: the sorting algorithm that splits an array in half, sorts each half and merges them, in O(n log n) time on every input.
Intermediate8 cards · 4 qnot started