24 docs tagged with "Competitive Programming"

An efficient algorithm for multiple pattern matching using a trie and failure links.

Combinatorics is a branch of mathematics dealing with combinations, arrangements, and counting of objects.

Combinatorics is a branch of mathematics dealing with combinations, arrangements, and counting of objects.

An overview of the Discrete Logarithm problem and its applications in cryptography.

A detailed guide to understanding and implementing the Divisibility and Prime Numbers.

A detailed guide to understanding and implementing the GCD (Greatest Common Divisor) Algorithm in Number Theory.

Greedy algorithms are a class of algorithms that make the optimal choice at each step with the hope of finding the global optimum

Heaps are commonly used to implement priority queues and ensure efficient retrieval of the minimum or maximum element.

Heaps are commonly used to implement priority queues and ensure efficient retrieval of the minimum or maximum element.

Heaps are commonly used to implement priority queues and ensure efficient retrieval of the minimum or maximum element.

Heaps are useful for merging multiple sorted lists efficiently and solving problems related to merging sorted sequences.

Heaps provide an efficient way to manage and retrieve median values from a stream of data by balancing two heaps.

Mathematical algorithms are essential for solving various computational problems and are widely used in both theoretical computer science and practical applications. They underpin many algorithms used in competitive programming and other fields.

The Two Pointers technique is an efficient algorithmic strategy used to solve various problems involving arrays or lists by utilizing two indices.

A comprehensive guide to using the KMP Algorithm for efficient pattern matching.

Find the Kth largest element in an array using a heap data structure.

A detailed guide to understanding and implementing the LCM (Least Common Multiple) Algorithm in Number Theory.

A detailed guide to understanding and implementing the Modular Arithmetic in Number Theory.

A basic string-search algorithm that checks every position in the text for a match with the pattern.

A comprehensive guide to using the Rabin-Karp Algorithm for efficient pattern matching.

A complete guide to understanding and implementing the Sieve of Eratosthenes for finding prime numbers.

A comprehensive guide to understanding and implementing the sweep line algorithm for computational geometry.

Mathematical Algorithms play a crucial role in solving complex problems efficiently in both DSA and competitive programming.

A comprehensive guide to using the Z-Algorithm for efficient pattern matching.