Skip to main content
Back to course
Log in
Get started
Someone wanted to learn this too, so Grasp built them a personal learning path.
Create your own
Mastering Algorithms and Leetcode
·
Module 5
Linked Structures, Stacks, and Queues
1
Singly Linked List Operations in TypeScript
Implement insertion, deletion, and traversal for a singly linked list in TypeScript.
Implement insertion, deletion, and traversal for a singly linked list in TypeScript.
2
Simplifying Linked List Head Operations with Dummy Nodes
Use a dummy node to simplify linked-list operations at the head.
Use a dummy node to simplify linked-list operations at the head.
3
Iterative Singly Linked List Reversal
Reverse a singly linked list iteratively while preserving the unprocessed suffix.
Reverse a singly linked list iteratively while preserving the unprocessed suffix.
4
Detecting Cycles in Linked Lists
Use slow and fast pointers to detect a cycle in a linked list.
Use slow and fast pointers to detect a cycle in a linked list.
5
Using Stacks for Delimiter Validation
Use a stack to validate properly nested delimiters.
Use a stack to validate properly nested delimiters.
6
Implementing an Array-Based Queue with Amortized O(1) Dequeue
Design an array-backed queue with constant-time amortized removal by maintaining a head index.
Design an array-backed queue with constant-time amortized removal by maintaining a head index.
7
Monotonic Stack Applications
Use a monotonic stack to find the next greater or smaller element for every position.
Use a monotonic stack to find the next greater or smaller element for every position.
8
Evaluating Postfix Expressions with Stacks
Evaluate postfix expressions using an explicit operand stack.
Evaluate postfix expressions using an explicit operand stack.
Previous module
Sorting and Binary Search Patterns
Next module
Recursion and Backtracking Search