C++ STLBasics
Verified against current playlist metadata
Video logic first. C++ implementation second.
Every requested topic is mapped to its exact current video title and link where the supplied playlist contains one. Combined lectures, outside-playlist official videos, and genuine gaps are explicitly labeled rather than guessed.
86Requested topics
49Tier 1 items
37Tier 2 items
78Mapped in playlist
8Missing / outside
0/86
Exact playlist matchCombined lectureOfficial, outside playlistMissing
Tier 1
Must watch — weak areas
49 requested items
Basics
2 topicsHashing TheoryBasics
Stack & Queue
9 topicsImplement Stack using ArraysStack & Queue
L1. Introduction to Stack and Queue | Implementation using Data Structures
Covered inside the consolidated Stack & Queue introduction.
Implement Queue using ArraysStack & Queue
L1. Introduction to Stack and Queue | Implementation using Data Structures
Covered inside the consolidated Stack & Queue introduction.
Implement Queue using StackStack & Queue
L1. Introduction to Stack and Queue | Implementation using Data Structures
Covered inside the consolidated Stack & Queue introduction.
Check for balanced parenthesisStack & Queue
L2. Check for Balanced Parentheses | Stack and Queue
Playlist title uses “Balanced Parentheses”.
Implement Min StackStack & Queue
Infix to PostfixStack & Queue
L3. Prefix, Infix, and Postfix Conversion | Stack and Queue Playlist
Covered by the playlist’s combined Prefix/Infix/Postfix conversion lecture.
Next Greater ElementStack & Queue
Largest rectangle in a histogramStack & Queue
Sliding Window maximumStack & Queue
Heaps
4 topicsIntroduction to Priority Queues using Binary HeapsHeaps
No matching video in this playlist
No matching video is present in this playlist snapshot; use the notebook/TUF article.
Use article / notebook
Kth largest elementHeaps
No matching video in this playlist
No heap/array Kth-largest lecture is present. The BST K-th lecture is a different problem.
Use article / notebook
Merge M sorted ListsHeaps
L25. Merge K Sorted Lists | Multiple Approaches
Mapped only if “M” means a many-way/K-way merge; the playlist video is “Merge K Sorted Lists” and includes a min-heap approach.
K most frequent elementsHeaps
No matching video in this playlist
No matching video is present in this playlist snapshot; use the notebook/TUF article.
Use article / notebook
Linked List
11 topicsIntroduction to LinkedListLinked List
Inserting a nodeLinked List
L2. Deletion and Insertion in LL | 8 Problems
Insertion and deletion are combined in one lecture.
Deleting a nodeLinked List
L2. Deletion and Insertion in LL | 8 Problems
Insertion and deletion are combined in one lecture.
Middle of a LinkedListLinked List
Reverse a LinkedList (iterative)Linked List
L9. Reverse a LinkedList | Iterative and Recursive
Iterative and recursive reversal are combined in one lecture.
Reverse a LL (recursive)Linked List
L9. Reverse a LinkedList | Iterative and Recursive
Iterative and recursive reversal are combined in one lecture.
Detect a loopLinked List
Find the starting pointLinked List
L17. Find the starting point of the Loop/Cycle in LinkedList | Multiple Approaches
Playlist title specifies the starting point of the loop/cycle.
Check if LL is palindromeLinked List
Remove Nth node from the backLinked List
L8. Remove Nth Node from the end of the LinkedList | Multiple Approaches
Playlist title uses “from the end”.
Reverse LL in group of size KLinked List
Binary Trees
16 topicsIntroduction to TreesBinary Trees
Binary Tree Representation in C++Binary Trees
Binary Tree TraversalsBinary Trees
PreorderBinary Trees
InorderBinary Trees
PostorderBinary Trees
Level orderBinary Trees
Iterative InorderBinary Trees
HeightBinary Trees
Check height-balancedBinary Trees
DiameterBinary Trees
Check if two trees are identicalBinary Trees
Zig Zag TraversalBinary Trees
Right/Left ViewBinary Trees
Symmetric Binary TreeBinary Trees
LCA in Binary TreeBinary Trees
BST
7 topicsIntroduction to BSTBST
Search in a BSTBST
Insert a NodeBST
Delete a NodeBST
K-th smallest/largestBST
Check if a tree is a BSTBST
LCA in BSTBST
Tier 2
Use when the notebook's logic does not click
37 requested items
Binary Search
5 topicsImplement Lower BoundBinary Search
Search in Rotated Sorted Array IBinary Search
Koko Eating BananasBinary Search
Aggressive CowsBinary Search
Book AllocationBinary Search
Recursion
4 topicsPrint all subsequences / Power SetRecursion
Power Set | Print all Subsequences
Official take U forward video, but not a member of the supplied playlist.
Learn All Patterns of SubsequencesRecursion
L7. All Kind of Patterns in Recursion | Print All
Official take U forward recursion video; mapped by concept/title, but not a member of the supplied playlist.
Combination SumRecursion
L8. Combination Sum | Recursion | Leetcode | C++ | Java
Official take U forward video, but not a member of the supplied playlist.
N QueenRecursion
L14. N-Queens | Leetcode Hard | Backtracking
Official take U forward video, but not a member of the supplied playlist.
Sliding Window
3 topicsLongest Substring Without Repeating CharactersSliding Window
Longest repeating character replacementSliding Window
Minimum Window SubstringSliding Window
Greedy
4 topicsN meetings in one roomGreedy
L7. N Meeting in One Room | Greedy Algorithms Playlist
Playlist title uses “N Meeting in One Room”.
Minimum number of platformsGreedy
Job sequencingGreedy
Merge IntervalsGreedy
Merge Overlapping Intervals | Brute, Optimal with Precise TC analysis
Mapped to the playlist’s “Merge Overlapping Intervals” lecture.
Graphs
10 topicsGraph and TypesGraphs
Graph Representation C++Graphs
BFSGraphs
DFSGraphs
Number of provincesGraphs
Rotten OrangesGraphs
Cycle Detection undirected (DFS)Graphs
Cycle Detection directed (DFS)Graphs
Kahn's AlgorithmGraphs
Dijkstra's AlgorithmGraphs
DP
10 topicsDP IntroductionDP
Climbing StairsDP
House RobberDP
Grid Unique PathsDP
Subset sum equal to targetDP
0/1 KnapsackDP
Minimum CoinsDP
LCSDP
Edit DistanceDP
LISDP
Bits
1 topicIntroduction to Bit ManipulationBits
L1. Introduction to Bit Manipulation | 1's 2's Compliment | Bit Operators
Official take U forward video, but not a member of the supplied playlist.
No matching topics.
Clear the search or filters to restore the list.
Accuracy notes
- The current playlist snapshot contains 316 entries. The last entry has no exposed title in the extracted metadata and does not affect these mappings.
- Several requested labels are now consolidated: stack/queue implementations share one introduction; linked-list insertion/deletion share one lecture; iterative/recursive reversal share one lecture.
- The four requested recursion videos and the bit-manipulation introduction are official take U forward videos, but they are not members of the supplied A2Z playlist snapshot, so their links intentionally omit the playlist parameter.
- Heap fundamentals, heap Kth-largest, and K-most-frequent are not present as matching videos. “Merge M sorted Lists” is mapped conditionally to “Merge K Sorted Lists” because M appears to mean multiple lists.