Deleting Key in B-Tree Data Structure - Deletion Process with Example
Comprehensive tutorial on deleting keys in B-Tree data structures, covering the deletion process with step-by-step examples and diagrams for better understanding.
Batches - Unifying RPC, WS and Database Access
Explore unified distribution capabilities for RPC, WS, and database access through batches, covering serialization, scripts, providers, and transaction handling.
Designing Functional Programs: From Imperative to Functional Paradigm
Learn functional programming principles and design techniques to build practical applications with immutability and higher-order functions, shifting from imperative and object-oriented paradigms.
Binary Trees Tutorial - Introduction, Traversals, Implementation
Comprehensive tutorial on binary trees covering fundamentals, implementation, and traversals. Ideal for DSA interview preparation, with hands-on coding examples and in-depth explanations.
Graph Data Structures - Part 2
Explore advanced graph data structures and optimization techniques for designing efficient algorithms in this in-depth lecture by Thatchaphol Saranurak.
Conditional Hardness and Fine-grained Complexity
Explore advanced concepts in computational complexity, focusing on conditional hardness and fine-grained analysis of algorithms for deeper understanding of efficiency limits.
Graph Data Structures Part 3
Explore advanced graph data structures and optimization techniques for designing efficient algorithms, presented by Thatchaphol Saranurak from the University of Michigan.
Graph Data Structures - Part 1
Explore fundamental graph data structures and their applications in algorithmic optimization, presented by a leading expert from the University of Michigan.
Array of Objects Algorithms - Search, Sort, Reverse, Max, Min, Custom Methods
Learn essential array operations: searching, sorting, reversing, and finding min/max elements. Master custom comparison methods and best practices for efficient array manipulation in object-oriented programming.
What Is Hashing - Why Do We Need It - What Is a Hash Function - Example - Array vs Hash Table
Explore hashing, hash functions, and hash tables. Learn their importance and benefits over arrays through practical examples and comparisons.
Advanced Inheritance and Polymorphism - Example With Array of Objects
Explore advanced OOP concepts through practical examples. Learn to implement inheritance, polymorphism, and efficient memory management in arrays of objects for more robust and reusable code.
Closed Hashing - Linear Probing, Quadratic Probing & Double Hashing - Collision Control
Explore closed hashing techniques: linear probing, quadratic probing, and double hashing. Learn collision control strategies for efficient hash table implementation and data structure optimization.
Dynamic Arrays of Objects - Data Structures Course Step-by-Step
Learn to create and manage dynamic arrays of objects, covering memory allocation, data insertion, copying, and deletion. Explore deep vs shallow copying and common pitfalls in C++ programming.
Solving Boggle Using AI - Dynamic Programming + Trie in Python
Learn to build an AI algorithm using dynamic programming and trie data structure to efficiently solve Boggle puzzles in Python, covering key concepts in graph theory and algorithm design.
Segment Trees Tutorial - Range Queries - Interview Questions
Comprehensive tutorial on segment trees for efficient range queries in coding interviews. Covers theory, implementation, and practical examples with hands-on coding.
The Operation of Caret - Exponentiation via Multisets - Math Foundations
Explore a new arithmetic operation called "caret" (exponentiation) for multisets, extending the ladder of operations beyond addition and multiplication with concrete examples and recursive counting functions.
Multisets and a New Framework for Arithmetic - Data Structures Math Foundations
Explores multisets to redefine natural numbers, offering fresh insights into fundamental arithmetic operations and laws. Presents a simplified, logical approach to basic mathematics suitable for all levels.
Singletons, Vexels, and the Rank of a Maxel II - Data Structures Math Foundations
Explore vexels, maxels, and their multiplication. Learn about row and column ranks of maxels, and discover the Rank theorem. Gain insights into linear algebra concepts through a generalized framework.
Singletons, Vexels, and the Rank of a Maxel - Data Structures in Mathematics
Explores vexels as multisets of singletons, analogous to maxels, to structure vector space theory. Introduces concepts like singleton multiplication, friezes, and maxel rank, offering a broader perspective on linear spaces.
Inclusion-Exclusion via Multisets - Data Structures in Mathematics Math Foundations
Explore inclusion/exclusion via multisets, expanding to integral multisets with negative multiplicities. Learn a conceptual approach to this fundamental Set Theory theorem and its applications.
An Introduction to the Tropical Calculus - Data Structures in Mathematics
Explore Tropical calculus, a novel approach to set algebra using unique addition and multiplication concepts derived from union and addition operations.