Matthias Mnich - Time- and Space-Optimal Algorithms for the Many-Visits TSP
Optimizing algorithms for the many-visits TSP problem, improving time and space complexity while maintaining logarithmic dependence on tour length. Discusses applications and compares with previous work.
Learn Divide & Conquer Algorithms - Great Learning
Explore divide and conquer algorithms: Binary Search, Quick Sort, and Merge Sort. Learn concepts, implementations, and complexities in this comprehensive session on efficient problem-solving techniques.
Data Structures and Algorithms for Tech Interviews - Tips & Tricks to Crack Interviews
Learn essential data structures and algorithms for tech interviews, covering arrays, linked lists, stacks, queues, searching, and sorting techniques with practical implementations and complexity analysis.
HopSkipJumpAttack - A Query-Efficient Decision-Based Attack
Explore a query-efficient decision-based adversarial attack algorithm for generating adversarial examples, analyzing its theoretical foundations and performance against defense mechanisms.
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.
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.
Insertion Sort - Theory and Code - Best-Worst Case Complexity
Comprehensive tutorial on Insertion Sort algorithm, covering theory, implementation, complexity analysis, and practical examples. Ideal for understanding this fundamental sorting technique.
Bubble Sort - Theory and Optimised Code - Best-Worst Case Complexity
Comprehensive guide to Bubble Sort algorithm: theory, implementation, optimization, and complexity analysis. Includes code examples and practical use cases.
Binary Search Advanced Problems
Solve advanced binary search problems: Book Allocation, Painter's Partition, and Aggressive Cows. Learn efficient approaches, understand why binary search is used, and practice with code implementations.
Binary Search Interview Questions - Google, Amazon, Microsoft
Mastering binary search for coding interviews: pivot finding, searching rotated arrays, and calculating square roots. Practical implementations and problem-solving techniques included.
Binary Search Interview Questions - Google, Amazon, Microsoft
Solve binary search interview questions from top tech companies. Learn approaches, implementations, and dry runs for efficient problem-solving in coding interviews.
Binary Search Explained - Theory + Code
Comprehensive tutorial on binary search algorithm, covering theory, implementation, optimization, and real-world applications. Includes code examples and comparisons with linear search.
Merge 2 Sorted Linked Lists - Sort 0s, 1s and 2s in Linked List
Learn to merge sorted linked lists and sort linked lists with 0s, 1s, and 2s. Master efficient algorithms and coding techniques for these common interview problems.
Quick Sort Using Recursion - Day-6 - 10 Day Recursion Challenge
Learn QuickSort algorithm implementation using recursion, including partition logic, code walkthrough, dry run, and time/space complexity analysis.
Recursion with Strings - Day-4 - 10 Day Recursion Challenge
Explore recursion with strings through practical examples like reversing strings, checking palindromes, and calculating power. Learn implementation techniques and problem-solving strategies.
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.
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.
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 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.