Data Structures and Algorithms
Comprehensive exploration of data structures and algorithms, covering arrays, linked lists, stacks, queues, trees, graphs, sorting, searching, and hashing techniques with practical implementations.
Dynamic Programming
Explore dynamic programming techniques for solving complex algorithmic problems efficiently, including coin change, knapsack, and longest common subsequence.
Design and Analysis of Algorithms
Explore algorithm fundamentals, analysis techniques, and key concepts for GATE/NET exams. Learn to write effective algorithms and understand their properties.
Algorithms in Java
Learn Java algorithm implementation, covering analysis, search methods, sorting techniques, and programming paradigms like greedy and dynamic. Gain practical skills through hands-on examples and real-world applications.
Java Data Structures
Comprehensive exploration of Java data structures, from arrays to graphs, with practical implementations and in-depth explanations of key concepts like trees, heaps, and hash tables.
Linked Lists in C - What They Are and How To Use Them
Comprehensive exploration of linked lists in C, covering types, implementation, advantages, and practical applications. Includes hands-on demo and performance analysis.
Binary Search in C
Learn to implement binary search in C, covering algorithm basics, iterative and recursive approaches, time and space complexity, with practical examples and demonstrations.
Stack and Queue in C
Explore stack and queue data structures in C, covering implementations using arrays and linked lists, along with their applications, advantages, and disadvantages.
Bubble Sort in C
Learn bubble sort algorithm in C: implementation, demo, time and space complexity analysis, with practical examples and code implementation.
KMP Algorithm in Python
Learn the KMP pattern matching algorithm, its implementation in Python, and its applications in computer science. Understand the advantages over naive algorithms and analyze time complexity.
KMP Algorithm in Java
Learn the KMP pattern matching algorithm, its implementation in Java, and applications in computer science. Covers naive and KMP approaches, code examples, complexity analysis, and real-world uses.
Greedy Programming in Java
Learn greedy programming in Java, covering concepts, examples, and implementations of Fractional Knapsack and Prim's Algorithm for minimal spanning trees. Gain practical skills in solving optimization problems efficiently.
IT Data Structures Class - University of South Florida Fall 2016
Comprehensive exploration of data structures, covering arrays, STL containers, C++ classes, and Big O notation. Includes practical coding examples and best practices.
Multi-threading in Julia with PARTR - JuliaCon 2019
Explore multi-threading in Julia with PARTR, covering old and new features, future developments, and practical examples. Includes performance comparisons and Q&A on threading models and implementation details.
FAANG Interview DSA Series - Heap Sort, Binary Tree, Min Heap and Max Heap Tree and Interview Questions
Comprehensive guide to heap sort, binary trees, and min/max heaps, with practical implementations and interview question solutions for FAANG-level coding challenges.
FAANG DSA Series - Discussing Sorting Algorithms - Selection, Bubble and Insertion Sort - Ft Priya Bhatia
Comprehensive exploration of sorting algorithms including selection, bubble, and insertion sorts, covering implementation, stability, and in-place vs. out-of-place techniques.
Discussing All Search Algorithms With Interview Based Questions
Comprehensive exploration of search algorithms, including linear, binary, and ternary search, with implementations and interview problem-solving techniques for data structures and algorithms.
B-Tree vs B+ Tree in Database Systems
Explore B-tree and B+ tree data structures in database systems, comparing their advantages, limitations, and real-world applications like MongoDB's index implementation challenges.
SAP HANA Cloud's Advanced Multi-Model Capabilities and Graph Processing - Challenge Winners and Expert Insights
Explore SAP HANA Cloud's graph capabilities, including GraphScript, table parameters, and the TRAVERSE DIJKSTRA operator. Learn from challenge winners and experts about advanced multi-model functionalities.
ExtractMin and Heapify in Heap Data Structure - Step by Step Working with Diagram
Comprehensive tutorial on ExtractMin and Heapify operations in Heap data structures, featuring step-by-step explanations, diagrams, pseudocode analysis, and C++ implementation.
AVL Tree Deletion Operation - Recursive Method with Rotations & Full C++ Program Code
Comprehensive tutorial on AVL tree deletion, covering theory, implementation, and C++ code. Includes step-by-step explanation, rotations, and comparison with BST deletion.