CodeHelp - by Babbar Courses

How OS Manages Free Space - Memory Management

Explore memory management in operating systems, covering free space management, defragmentation, and allocation methods like First-Fit and Best-Fit for efficient resource utilization.

• YouTube
• 31 minutes
• On-Demand
• Free Video

Trie and Its Implementation - C++ Placement Series

Comprehensive tutorial on Trie data structure in C++, covering theory, implementation, and operations like insertion, search, and removal. Includes practical examples and a coding question.

• YouTube
• 48 minutes
• On-Demand
• Free Video

Solving LeetCode Problems on Concurrency - OS Placement Series

Explore concurrency coding challenges with hands-on problem-solving, covering Print In Order, Fizz Buzz Multithreaded, and The Dining Philosophers problems. Gain practical insights into OS concepts and placement preparation.

• YouTube
• 31 minutes
• On-Demand
• Free Video

Hashmaps in C++ - C++ Placement Series

Comprehensive exploration of hashmaps in C++, covering implementation, STL usage, hash functions, collision handling, and practical applications for efficient data storage and retrieval.

• YouTube
• 1 hour 3 minutes
• On-Demand
• Free Video

Deadlock Avoidance - Deadlock Detection and Recovery

Comprehensive exploration of deadlock avoidance, detection, and recovery in operating systems, featuring Banker's Algorithm and wait-for graphs. Includes practical examples and motivational tips for learners.

• YouTube
• 24 minutes
• On-Demand
• Free Video

What is Deadlock - Necessary Conditions - Handling Methods

Comprehensive exploration of deadlocks in operating systems, covering definition, conditions, resource allocation graphs, and prevention methods. Ideal for understanding this critical OS concept.

• YouTube
• 54 minutes
• On-Demand
• Free Video

Heaps Hard Interview Questions - Part 3

Solve challenging binary heap problems with step-by-step approaches and coding solutions. Learn advanced data structure techniques for efficient problem-solving in technical interviews.

• YouTube
• 1 hour 5 minutes
• On-Demand
• Free Video

Heaps in C++ - Interview Questions - Part 2

Solve interview questions on binary heaps in C++. Learn multiple approaches and implementations for problems like Kth largest sum subarray, merging K sorted arrays, and merging K sorted linked lists.

• YouTube
• 50 minutes
• On-Demand
• Free Video

Conditional Variables & Semaphores to Synchronise Threads

Explore ThreadSync using Conditional Variables and Semaphores. Learn through hands-on examples and gain practical insights into efficient thread synchronization techniques.

• YouTube
• 23 minutes
• On-Demand
• Free Video

Critical Section Problem - Race Condition in OS

Explore thread scheduling, race conditions, and solutions like Peterson's and mutex locks. Gain practical insights with hands-on examples and learn critical section problem-solving techniques.

• YouTube
• 35 minutes
• On-Demand
• Free Video

Heaps in C++ - Interview Questions - Part 1

Comprehensive tutorial on solving heap-related problems in C++, covering five key questions with detailed approaches and code implementations for interview preparation.

• YouTube
• 1 hour 8 minutes
• On-Demand
• Free Video

Heaps in C++ - Heap Sort - Insertion-Deletion in Heap - Priority Queue STL

Comprehensive guide to heaps in C++: implementation, operations, heapify algorithm, heap sort, and priority queue STL. Covers theory and practical coding.

• YouTube
• 1 hour 5 minutes
• On-Demand
• Free Video

Largest BST in a Binary Tree - C++ Placement Series

Learn to identify and implement the largest Binary Search Tree within a given binary tree using C++, with step-by-step explanations and coding demonstrations.

• YouTube
• 23 minutes
• On-Demand
• Free Video

Merge 2 Binary Search Trees - C++ Placement Series

Learn to merge two binary search trees efficiently in C++. Explore multiple approaches with step-by-step code implementation and optimization techniques.

• YouTube
• 46 minutes
• On-Demand
• Free Video

Binary Search Tree FAANG Interview Questions - Part 2

Solve advanced Binary Search Tree problems for FAANG interviews, covering topics like balancing, construction from preorder, flattening to linked list, and finding two sum.

• YouTube
• 48 minutes
• On-Demand
• Free Video