Recursion and Binary Search - Day-3 - 10 Days Recursion Challenge
Explore recursion through practical examples like sorted array checks, linear search, and binary search. Learn implementation techniques and problem-solving strategies for these fundamental algorithms.
Greedy Algorithms in 1 Video
Comprehensive video on greedy algorithms, covering multiple problems with code examples. Ideal for placement preparation, offering practical insights and problem-solving techniques.
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.
Binary Search Tree FAANG Interview Questions - Part 1
Comprehensive tutorial on solving Binary Search Tree questions for FAANG interviews, covering validation, traversal, and common algorithms with detailed explanations and code implementations.
Binary Search Tree and Its Implementation - Insertion, Deletion, and Searching a Node
Comprehensive guide to Binary Search Trees: implementation, insertion, deletion, and searching. Includes practical examples and interview question solutions for efficient data structure mastery.
Morris Traversal - Flatten a Binary Tree to Linked List - C++ Placement Series
Learn Morris Traversal and how to flatten a binary tree to a linked list in C++. Covers algorithms, approaches, and code implementation with dry runs for better understanding.
Construct a Binary Tree from Inorder-Preorder-Postorder Traversal
Learn to construct binary trees from traversal sequences, with step-by-step approaches and code implementations for both inorder/preorder and preorder/postorder combinations.
Binary Tree FAANG Interview Questions - Part 3
Solve 7 advanced binary tree interview questions with detailed explanations, approaches, and code implementations. Enhance your problem-solving skills for FAANG interviews.
Binary Tree FAANG Interview Questions - Part-1
Comprehensive tutorial solving 5 binary tree interview questions, covering height, diameter, balance, identity, and sum tree problems with multiple approaches and code implementations.
Design Special Stack Problem - C++ Placement Course
Learn to implement a special stack with O(1) time complexity for getMin() operation, exploring efficient approaches and optimized code for this challenging data structure problem.
N Stacks in an Array - Stack Hard Question
Explore advanced stack implementation with "N Stacks in an Array" problem. Learn efficient approaches, coding techniques, and problem-solving strategies for this challenging data structure question.
Stack - Celebrity Problem and Max Rectangle in Binary Matrix with All 1's
Solve famous Stack Hard Questions: Celebrity Problem and Max Rectangle in Binary Matrix. Learn efficient approaches and coding solutions for these challenging algorithmic problems.
Largest Rectangular Area in Histogram - Optimised Approach
Learn to solve the "Largest Rectangular Area in Histogram" problem using optimized stack-based approaches. Gain insights into efficient problem-solving techniques for this classic algorithm challenge.
Stack Interview Questions - Placement Series by Love Babbar
Comprehensive tutorial solving 8 stack interview questions, covering approaches and code implementations for common algorithmic challenges in data structures.
Fully Linear PCPs and Their Cryptographic Applications
Explore probabilistically checkable proofs, distributed verifiers, and cryptographic applications with a focus on fully linear PCPs and their impact on secure protocols and communication complexity.
How to Do Fiat-Shamir in the Standard Model
Explore interactive protocols, Fiat-Shamir transformation, and delegation in cryptography. Learn about security assumptions, hash functions, and correlation intractability in probabilistic proof systems.
How to Delegate Computations Publicly
Explore probabilistically checkable and interactive proof systems, focusing on publicly verifiable arguments and non-interactive protocols for delegating computations.
Transparent SNARKs from DARK Compilers
Explore transparent SNARKs and DARK compilers in cryptography. Learn about polynomial commitments, interactive proof systems, and recent advancements in zero-knowledge proofs for blockchain applications.
Efficient Zero Knowledge Proof from Interactive Proofs
Explore efficient zero-knowledge proofs derived from interactive proofs, focusing on new algorithms, performance improvements, and comparisons to existing systems.
Probabilistically Checkable Proofs - Part I
Explore probabilistically checkable proofs, focusing on proof verification, randomized verifiers, and proof rewriting techniques in this advanced theoretical computer science lecture.
Optimality and Approximation with Policy Gradient Methods in Markov Decision Processes
Explore policy gradient methods in Markov Decision Processes, covering optimality, approximation, and key concepts like entropy regularization and natural policy gradient.