take U forward · 41 min · advanced · English

DP 19. 0/1 Knapsack | Recursion to Single Array Space Optimised | DP on Subsequences

CodeLucky · 6 min · advanced · English

2D Dynamic Programming for Beginners: Grids and Matrices Explained!

take U forward · 34 min · intermediate · English

DP 1. Introduction to Dynamic Programming | Memoization | Tabulation | Space Optimization

Errichto Algorithms · 12 min · intermediate · English

Bitwise Operations tutorial #1 | XOR, Shift, Subsets

The Pragmatic Engineer · 34 min · intermediate · English

How to Negotiate a Big Tech Offer as a Software Engineer - with @RahulPandeyrkp

Compensation structure and offer negotiation tactics for software engineers (Gergely Orosz + Rahul Pandey).

CareerVidz · 13 min · beginner · English

SOFTWARE ENGINEER Behavioral Interview Questions & ANSWERS! (STAR TECHNIQUE ANSWERS!)

SWE-specific behavioral questions answered with the STAR method.

GeeksforGeeks · 53 min · intermediate · English

Live Mock Interview with @Striver | MAANG Format | GeeksforGeeks

Second full mock in MAANG format for a different interviewer style and problem set.

NeetCode · 47 min · intermediate · English

Mock Google Coding Interview with a Meta Intern

Full end-to-end live coding mock with real-time problem solving and interviewer feedback.

Codebagel · 11 min · beginner · English

How to Solve ANY Coding Interview Question in 6 Steps

Optional: a structured 6-step understand-plan-implement framework that mirrors UMPIRE.

Web Dev Simplified · 40 min · beginner · English

How To Pass Your Coding Interviews (with Clément Mihailescu)

Communicating and thinking out loud during a live coding round, with an ex-Google engineer.

Clément Mihailescu · 56 min · advanced · English

Google Coding Interview With A Facebook Software Engineer

Real timed mock Google interview on a hard problem — models thinking out loud and solving within interview time limits.

NeetCode · 11 min · intermediate · English

Top 6 Coding Interview Concepts (Data Structures & Algorithms)

Overview of the core data-structure and pattern concepts to seed your reusable code-template playbook.

Codebagel · 16 min · intermediate · English

I Analyzed 3,800 LeetCode Problems. Only 8 Patterns Matter

Optional data-driven angle: which core patterns recur most, so you know what to recognize first.

Greg Hogg · 14 min · intermediate · English

How to Instantly Recognize Leetcode Patterns (500 problems later)

Systematic method to de-noise a problem statement and map it to its underlying pattern in under a minute.

NeetCode · 8 min · beginner · English

Top 5 Dynamic Programming Patterns for Coding Interviews - For Beginners

Optional pattern-spotting overview: the 5 recurring DP patterns that show up in interviews.

Reducible · 21 min · intermediate · English

5 Simple Steps for Solving Dynamic Programming Problems

The DP mindset: spot overlapping subproblems and convert a recursive solution into memoized/tabulated DP.

Abdul Bari · 15 min · beginner · English

Activity Selection problem using Greedy method

The greedy-choice property and interval scheduling via the classic activity-selection problem (sort by finish time).

NeetCode · 19 min · intermediate · English

Network Delay Time - Dijkstra's algorithm - Leetcode 743

Dijkstra's shortest-path algorithm with a min-heap, applied to LeetCode 743 Network Delay Time.

take U forward · 33 min · intermediate · English

G-46. Disjoint Set | Union by Rank | Union by Size | Path Compression

Union-Find / DSU from scratch with union by rank, union by size, and path compression optimizations.

NeetCode · 13 min · intermediate · English

Top 5 Most Common Graph Algorithms for Coding Interviews

How to recognize and model graph problems with the most common traversal-based interview patterns.

Greg Hogg · 32 min · intermediate · English

Graphs: Edge List, Adjacency Matrix, Adjacency List, DFS, BFS - DSA Course in Python Lecture 11

Core graph representations (edge list, adjacency matrix/list) plus BFS and DFS implemented in Python.

NeetCode · 12 min · intermediate · English

Word Search - Backtracking - Leetcode 79 - Python

Optional: DFS on a grid with visited-set backtracking and 4-directional exploration.

NeetCode · 14 min · advanced · English

N-Queens - Backtracking - Leetcode 51 - Python

Constraint sets (column, positive/negative diagonal) with pruning — the model for grid backtracking.

NeetCode · 11 min · intermediate · English

Backtracking: Permutations - Leetcode 46 - Python

Optional second angle: choose/undo with a used-tracking pattern to enumerate permutations.

NeetCode · 12 min · intermediate · English

Subsets - Backtracking - Leetcode 78 - Python

The include/exclude decision tree — the cleanest introduction to the backtracking template.

NeetCode · 13 min · intermediate · English

Find Median from Data Stream - Heap & Priority Queue - Leetcode 295 - Python

Max-heap + min-heap balancing to maintain a running median in O(log n) add / O(1) query.

Coderbyte · 11 min · beginner · English

Heaps Visually Explained (Priority Queues)

Optional foundational angle: visual heapify-up/down, insert, and extract to build intuition before solving problems.

NeetCode · 10 min · intermediate · English

Kth Largest Element in a Stream - Leetcode 703 - Python

Applies a min-heap of size k to a streaming top-K problem — the canonical interview heap pattern.

NeetCode · 16 min · advanced · English

Implement Trie (Prefix Tree) - Tries - Leetcode 208 - Python

Builds a trie node-by-node and implements insert, search, and startsWith for prefix queries.

NeetCode · 12 min · intermediate · English

Validate Binary Search Tree - Depth First Search - Leetcode 98 - Python

DFS with lower/upper bound interval to enforce the BST ordering invariant across the whole tree.

NeetCode · 14 min · advanced · English

Binary Tree Maximum Path Sum - DFS - Leetcode 124 - Python

Post-order recursion returning one branch upward while updating a global max — the hard path-sum variant.

NeetCode · 12 min · intermediate · English

Diameter of Binary Tree - Leetcode 543 - Python

Bottom-up recursion: each node returns its height while a global tracks max diameter in one pass.

NeetCode · 11 min · intermediate · English

Binary Tree Level Order Traversal - BFS - Leetcode 102 - Python

Optional focused companion on the iterative BFS queue pattern for level-order traversal.

mycodeschool · 14 min · intermediate · English

Binary tree traversal: Preorder, Inorder, Postorder

Clear conceptual walkthrough of the three DFS traversals (pre/in/post-order) to recall from memory.

Abdul Bari · 17 min · beginner · English

Recursive Merge Sort

Optional different angle: divide-and-conquer merge sort with its guaranteed O(n log n) and stability trade-offs.

NeetCode · 13 min · intermediate · English

Kth Largest Element in an Array - Quick Select - Leetcode 215 - Python

Quickselect: reuse quicksort's partition to find the kth largest in average O(n) without fully sorting.

NeetCode · 13 min · intermediate · English

Search in Rotated Sorted Array - Leetcode 33 - Python

Adapts binary search to a rotated sorted array by deciding which half is sorted at each step.

NeetCode · 13 min · intermediate · English

Koko Eating Bananas - Binary Search - Leetcode 875 - Python

Canonical 'binary search the answer' problem: search the speed range, not the array, using a monotonic feasibility check.

NeetCode · 15 min · beginner · English

Binary Search - Leetcode 704 - Python

Clean binary search template with the left<=right invariant and how to avoid off-by-one boundary bugs.

NeetCode · 13 min · intermediate · English

Linkedin Interview Question - Reorder List - Leetcode 143 - Python

Combines midpoint-finding, reversal, and merging into one problem.

NeetCode · 10 min · intermediate · English

Merge Two Sorted Lists - Leetcode 21 - Python

Dummy-node pattern for merging two sorted lists cleanly.

NeetCode · 9 min · intermediate · English

Reverse Linked List - Iterative AND Recursive - Leetcode 206 - Python

Both iterative three-pointer and recursive reversal.

NeetCode · 14 min · advanced · English

LeetCode 239 - Sliding Window Maximum | Monotonic Deque | O(n)

Monotonic deque solution to sliding-window-maximum in O(n).

NeetCode · 13 min · intermediate · English

Daily Temperatures - Monotonic Stack - Leetcode 739 - Python

The monotonic-stack / next-greater-element pattern in O(n).

NeetCodeIO · 10 min · intermediate · English

Valid Parentheses | Stack | NeetCode RoadMap

Stack for matching/parsing — the classic Valid Parentheses walkthrough.

NeetCode · 13 min · intermediate · English

Longest Substring Without Repeating Characters - Leetcode 3 - Python

Optional applied example: dynamically expanding/contracting the window with a hash set.

NeetCode · 7 min · intermediate · English

Sliding Window in 7 minutes | LeetCode Pattern

Concise template for growing/shrinking a window to satisfy a constraint.

AlgoMap · 12 min · beginner · English

Maximum Sum Subarray of Size K - Sliding Window Pattern Explained

Computes fixed-window aggregates in O(n) by adding the entering and subtracting the exiting element.

NeetCode · 9 min · intermediate · English

Linked List Cycle - Floyd's Tortoise and Hare - Leetcode 141 - Python

Classic fast/slow pointer cycle detection in O(1) space, explained step by step.

NeetCode · 11 min · intermediate · English

Container With Most Water - Two Pointers - Leetcode 11 (Python) - Blind 75

Optional deep dive: the canonical opposite-end two-pointer problem and why you move the shorter pointer.