CodeHelp - by Babbar Courses

Morris Traversal - Flatten a Binary Tree to Linked List - C++ Placement Series

Learn Morris traversal and three approaches to flatten a binary tree into a linked list, with dry runs and C++ implementation.

• YouTube
• 32 minutes
• Self-Paced
• Free Video

Multi-Level Queue Scheduling - MLFQ - Comparison Between CPU Scheduling Algorithms

Explore multilevel queue and multilevel feedback queue scheduling, then compare them with other CPU scheduling algorithms.

• YouTube
• 28 minutes
• Self-Paced
• Free Video

Shortest Job First Algorithm - Priority Scheduling - Round Robin CPU Scheduling

Explore non-preemptive and preemptive CPU scheduling, priority scheduling with ageing, and Round Robin scheduling.

• YouTube
• 45 minutes
• Self-Paced
• Free Video

Construct a Binary Tree from Inorder-Preorder-Postorder Traversal

Solves two interview problems by reconstructing binary trees from inorder, preorder, and postorder traversals with step-by-step approaches and code.

• YouTube
• 37 minutes
• Self-Paced
• Free Video

What Is Convoy Effect - FCFS CPU Scheduling Algorithm

Explore FCFS CPU scheduling and the convoy effect through scheduling terms, preemptive versus non-preemptive policies, and scheduling goals.

• YouTube
• 25 minutes
• Self-Paced
• Free Video

Binary Tree FAANG Interview Questions - Part 3

Solve binary-tree interview problems using step-by-step approaches and code, including lowest common ancestor, K-sum paths, kth ancestor, and non-adjacent node sums.

• YouTube
• 59 minutes
• Self-Paced
• Free Video

Binary Tree FAANG Interview Questions - Part 2

Solve seven binary tree interview questions through step-by-step approaches and code.

• YouTube
• 1 hour 12 minutes
• Self-Paced
• Free Video

Context Switching in OS - Medium Term Scheduler - Orphan-Zombie Process

Explore medium-term scheduling, swapping, context switching, and the creation and behavior of orphan and zombie processes in operating systems.

• YouTube
• 41 minutes
• Self-Paced
• Free Video

Binary Tree FAANG Interview Questions - Part-1

Solve five binary-tree interview problems, including tree height, diameter, balance, identity, and sum trees, using multiple approaches and code.

• YouTube
• 1 hour 1 minute
• Self-Paced
• Free Video

Binary Trees and Its Representation - Different Types of Traversals

Learn binary tree creation and representation through level-order, inorder, preorder, and postorder traversals.

• YouTube
• 55 minutes
• Self-Paced
• Free Video

Queue FAANG Interview Questions - Placement Series by Love Babbar

Solve eight queue problems through step-by-step approaches and code, including queue reversal, sliding-window processing, circular tour, and multiple queues in one array.

• YouTube
• 2 hours 24 minutes
• Self-Paced
• Free Video

Queues in C++ - STL, Implementation, Types of Queues

Learn queue data structures in C++ through STL usage and implementations of circular, restricted, and doubly ended queues.

• YouTube
• 1 hour 5 minutes
• Self-Paced
• Free Video

Design Special Stack Problem - C++ Placement Course

Solve a special stack problem by comparing two approaches, explaining why they work, and implementing an optimized solution in C++.

• YouTube
• 29 minutes
• Self-Paced
• Free Video

How OS Creates a Process - Introduction to Process

An introduction to operating-system processes, covering their creation, architecture, attributes, and process control blocks.

• YouTube
• 38 minutes
• Self-Paced
• Free Video

N Stacks in an Array - Stack Hard Question

Solve the “N Stacks in an Array” problem through two approaches and an implementation.

• YouTube
• 38 minutes
• Self-Paced
• Free Video